Adam Kirsch
Random Struct. Algorithms · 2006
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 12 researchers here, as inferred from the citation graph.
Whom Adam Kirsch trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Michael M. Mitzenmacher
- Andrei Z. Broder
- Li Fan
- Eli Upfal
- Donald Ervin Knuth
- Pei Cao
- Cristian Estan
- Jussara M. Almeida
Who trusts Adam Kirsch overall
- R. Schnell
- Russell Sears
- Frank Niedermeyer
- Bin Fan
- Raghu Ramakrishnan
- Tobias Bachteler
- D. Andersen
- Simone Steinmetzer
- Jörg Reiher
- Sasu Tarkoma
Papers from Adam Kirsch's perspective
Ordered by how strongly the researchers Adam Kirsch trusts endorse each paper. Same corpus, a different order for every researcher.
- Summary cache: a scalable wide-area web cache sharing protocol
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis
- Network Applications of Bloom Filters: A Survey
- Compressed bloom filters (ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing)
- New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice (TOCS)
- The Art of Computer Programming: Volume 3: Sorting and Searching
- The Art of Computer Programming
- Probability and Measure
- The Bloomier filter: an efficient data structure for static support lookup tables (ACM-SIAM Symposium on Discrete Algorithms)
- Space/time trade-offs in hash coding with allowable errors
Their papers
- Less hashing, same performance: Building a better Bloom filter (2006) — 438 citations