R. Schnell

Artificial Intelligence · 2003–2014

A researcher in the Science corpus: 5 papers; trusts 18 researchers and is trusted by 23 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 11 citations into it; #8,967 of 35,345 by trust here, #20,377 by citations
• Management Science and Operations Research — 11 citations into it; #2,760 of 11,946 by trust here, #6,314 by citations
• Computer Networks and Communications — 10 citations into it; #8,364 of 9,886 by trust here, #8,191 by citations
• Algorithms & Complexity — 5 citations into it; #464 of 516 by trust here, #435 by citations

Whom R. Schnell trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Peter Christen
2. Tobias Bachteler
3. Andrew McCallum
4. Adam Kirsch
5. Andrei Z. Broder
6. Michael M. Mitzenmacher
7. Jörg Reiher
8. Sophia Rabe-Hesketh
9. Hugo Krawczyk
10. Kamal Nigam

Who trusts R. Schnell overall

1. Mehmet Kuzu
2. Peter Christen
3. Luca Bonomi
4. Frank Niedermeyer
5. Stephen Hardy
6. Murat Kantarcioglu
7. Joseph W. Sakshaug
8. Dinusha Vatsalan
9. Simone Steinmetzer
10. Mentari Djatmiko

Papers from R. Schnell's perspective

Ordered by how strongly the researchers R. Schnell trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Constraint Satisfaction Cryptanalysis of Bloom Filters in Private Record Linkage
2. Privacy-preserving record linkage using Bloom filters (BMC Medical Informatics Decis. Mak.)
3. Summary cache: a scalable wide-area web cache sharing protocol
4. Data quality and record linkage techniques
5. Privacy-Preserving Record Linkage
6. Research use of linked health data — a best practice protocol (Australian and New Zealand Journal of Public Health)
7. Efficient clustering of high-dimensional data sets with application to reference matching (Knowledge Discovery and Data Mining)
8. Space/time trade-offs in hash coding with allowable errors
9. Less hashing, same performance: Building a better Bloom filter (Random Struct. Algorithms)
10. A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication

Their papers

• A Novel Error-Tolerant Anonymous Linking Code (2011) — 84 citations
• Privacy-preserving record linkage using Bloom filters (2009) — 301 citations
• Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage (2014) — 100 citations
• Efficient private record linkage of very large datasets (2013) — 9 citations
• Separating interviewer and sampling-point effects (2003) — 146 citations