D. Sivakumar

Artificial Intelligence · ACM-SIAM Symposium on Discrete Algorithms · 2000–2003

A researcher in the Science corpus: 9 papers; trusts 8 researchers and is trusted by 90 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 8 citations into it; #2,946 of 35,345 by trust here, #4,170 by citations
• Computational Theory and Mathematics — 6 citations into it; #1,246 of 12,182 by trust here, #1,700 by citations
• Computer Networks and Communications — 5 citations into it; #5,891 of 9,886 by trust here, #3,426 by citations

Whom D. Sivakumar trusts overall

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

1. Jon M. Kleinberg
2. Piotr Indyk
3. Jianhua Lin
4. Cynthia Dwork

Who trusts D. Sivakumar overall

1. Daniele Micciancio
2. David P. Woodruff
3. S. Muthu Muthukrishnan
4. Phong Q. Nguyen
5. Nicolas Gama
6. Andrew McGregor
7. Jure Leskovec
8. Amy Nicole Langville
9. Oded Regev
10. Chris Peikert

Papers from D. Sivakumar's perspective

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

1. Clustering data streams (Proceedings 41st Annual Symposium on Foundations of Computer Science)
2. Finding frequent items in data streams
3. Size-Estimation Framework with Applications to Transitive Closure and Reachability
4. The Anatomy of a Large-Scale Hypertextual Web Search Engine
5. Stable distributions, pseudorandom generators, embeddings and data stream computation (Proceedings 41st Annual Symposium on Foundations of Computer Science)
6. Information Theory: 1948-1998 - Guest Editorial
7. Authoritative sources in a hyperlinked environment
8. When Is ''Nearest Neighbor'' Meaningful?
9. Reductions in streaming algorithms, with an application to counting triangles in graphs (ACM-SIAM Symposium on Discrete Algorithms)
10. Similarity Search in High Dimensions via Hashing

Their papers

• Rank aggregation methods for the Web (2001) — 2,068 citations
• Efficient similarity search and classification via rank aggregation (2003) — 457 citations
• An information statistics approach to data stream and communication complexity (2002) — 692 citations
• A sieve algorithm for the shortest lattice vector problem (2001) — 613 citations
• Comparing top k lists (2003) — 1,094 citations
• Reductions in streaming algorithms, with an application to counting triangles in graphs (2002) — 430 citations
• Counting Distinct Elements in a Data Stream (2002) — 578 citations
• The Web as a graph (2000) — 368 citations
• Stochastic models for the Web graph (2000) — 746 citations