Jeffrey Scott Vitter

Artificial Intelligence · 1985–2004

A researcher in the Science corpus: 6 papers; trusts 10 researchers and is trusted by 290 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 8 citations into it; #8,276 of 35,345 by trust here, #17,776 by citations
• Computer Networks and Communications — 8 citations into it; #2,660 of 9,886 by trust here, #5,133 by citations
• Signal Processing — 7 citations into it; #2,322 of 7,572 by trust here, #4,051 by citations
• Algorithms & Complexity — 6 citations into it; #9 of 516 by trust here, #54 by citations

Whom Jeffrey Scott Vitter trusts overall

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

1. Frank Thomson Leighton
2. Donald Ervin Knuth
3. Alok Aggarwal
4. Pankaj Kumar Agarwal
5. Paolo Ferragina
6. S. Muthu Muthukrishnan
7. Eugene W. Myers
8. Erik D. Demaine
9. Rasmus Pagh
10. Martín Farach-Colton

Who trusts Jeffrey Scott Vitter overall

1. Xisen Jin
2. Nicolas Papernot
3. Prashant Bhat
4. Chris Dongjoo Kim
5. Matthew Riemer
6. Zhen Wang
7. Gurmeet Singh Manku
8. Brian Babcock
9. Daniel Lemire
10. Zheda Mai

Papers from Jeffrey Scott Vitter's perspective

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

1. Indexing the positions of continuously moving objects (ACM SIGMOD Conference)
2. The input/output complexity of sorting and related problems
3. Suffix arrays: a new method for on-line string searches
4. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets (ACM-SIAM Symposium on Discrete Algorithms)
5. Time Bounds for Selection
6. Cuckoo Hashing
7. Opportunistic data structures with applications
8. Data streams: algorithms and applications (ACM-SIAM Symposium on Discrete Algorithms)
9. Similarity Search in High Dimensions via Hashing
10. An Introduction to Probability Theory and its Applications, Volume I

Their papers

• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (2000) — 693 citations
• Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data (2004) — 311 citations
• High-order entropy-compressed text indexes (2003) — 841 citations
• External memory algorithms and data structures: dealing with massive data (2001) — 732 citations
• The input/output complexity of sorting and related problems (1988)
• Random sampling with a reservoir (1985)