default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Kolb
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c7]Ziad Sehili, Lars Kolb, Christian Borgs, Rainer Schnell, Erhard Rahm:
Privacy Preserving Record Linkage with PPJoin. BTW 2015: 85-104- 2014
- [b1]Lars Kolb:
Effiziente MapReduce-Parallelisierung von Entity Resolution-Workflows. Leipzig University, Germany, 2014 - [j4]Lars Kolb, Ziad Sehili, Erhard Rahm
:
Iterative Computation of Connected Graph Components with MapReduce. Datenbank-Spektrum 14(2): 107-117 (2014) - 2013
- [j3]Lars Kolb, Erhard Rahm:
Parallel Entity Resolution with Dedoop. Datenbank-Spektrum 13(1): 23-32 (2013) - [c6]Michael Hartung, Lars Kolb, Anika Groß, Erhard Rahm:
Optimizing Similarity Computations for Ontology Matching - Experiences from GOMMA. DILS 2013: 81-89 - [c5]Axel-Cyrille Ngonga Ngomo, Lars Kolb, Norman Heino, Michael Hartung, Sören Auer, Erhard Rahm:
When to Reach for the Cloud: Using Parallel Hardware for Link Discovery. ESWC 2013: 275-289 - [c4]Lars Kolb, Andreas Thor, Erhard Rahm:
Don't match twice: redundancy-free similarity computation with MapReduce. DanaC@SIGMOD 2013: 1-5 - 2012
- [j2]Lars Kolb, Andreas Thor, Erhard Rahm:
Multi-pass sorted neighborhood blocking with MapReduce. Comput. Sci. Res. Dev. 27(1): 45-63 (2012) - [j1]Lars Kolb, Andreas Thor, Erhard Rahm:
Dedoop: Efficient Deduplication with Hadoop. Proc. VLDB Endow. 5(12): 1878-1881 (2012) - [c3]Lars Kolb, Andreas Thor, Erhard Rahm:
Load Balancing for MapReduce-based Entity Resolution. ICDE 2012: 618-629 - 2011
- [c2]Lars Kolb, Andreas Thor, Erhard Rahm:
Parallel Sorted Neighborhood Blocking with MapReduce. BTW 2011: 45-64 - [c1]Lars Kolb, Andreas Thor, Erhard Rahm:
Block-based load balancing for entity resolution with MapReduce. CIKM 2011: 2397-2400 - [i3]Lars Kolb, Andreas Thor, Erhard Rahm:
Load Balancing for MapReduce-based Entity Resolution. CoRR abs/1108.1631 (2011) - 2010
- [i2]Toralf Kirsten, Lars Kolb, Michael Hartung, Anika Groß, Hanna Köpcke, Erhard Rahm:
Data Partitioning for Parallel Entity Matching. CoRR abs/1006.5309 (2010) - [i1]Lars Kolb, Andreas Thor, Erhard Rahm:
Parallel Sorted Neighborhood Blocking with MapReduce. CoRR abs/1010.3053 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
