Sudipto Guha

Artificial Intelligence · 1999–2016

A researcher in the Science corpus: 11 papers; trusts 22 researchers and is trusted by 47 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 33 citations into it; #4,699 of 35,345 by trust here, #6,014 by citations
• Computer Networks and Communications — 27 citations into it; #2,972 of 9,886 by trust here, #2,424 by citations
• Computational Theory and Mathematics — 18 citations into it
• Signal Processing — 12 citations into it; #831 of 7,572 by trust here, #812 by citations
• Algorithms & Complexity — 10 citations into it
• Organizational Behavior and Human Resource Management — 8 citations into it

Whom Sudipto Guha trusts overall

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

1. Piotr Indyk
2. Kamal Kumar Jain
3. Amit Chakrabarti
4. Anna C. Gilbert
5. Martin Ester
6. Moses Charikar
7. Vijay V. Vazirani
8. Erik D. Demaine
9. Hans-Peter Kriegel
10. Adam Meyerson

Who trusts Sudipto Guha overall

1. Moses Charikar
2. Kamal Kumar Jain
3. S. Muthu Muthukrishnan
4. Vijay Arya
5. Adam Meyerson
6. Brian Babcock
7. Yixin Chen
8. Clemens Rösner
9. Charu C. Aggarwal
10. Anna C. Gilbert

Papers from Sudipto Guha's perspective

Ordered by how strongly the researchers Sudipto Guha 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. Primal-dual approximation algorithms for metric facility location and k-median problems
3. Pattern classification and scene analysis
4. Data-streams and histograms (Symposium on the Theory of Computing)
5. Finding frequent items in data streams
6. Algorithms for Clustering Data
7. Approximation algorithms for facility location problems
8. Stable distributions, pseudorandom generators, embeddings and data stream computation (Proceedings 41st Annual Symposium on Foundations of Computer Science)
9. Extensions of Lipschitz mappings into Hilbert space
10. An improved data stream summary: the count-min sketch and its applications

Their papers

• Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams (2009) — 97 citations
• Robust Random Cut Forest Based Anomaly Detection on Streams (2016) — 338 citations
• Graph sketches: sparsification, spanners, and subgraphs (2012) — 334 citations
• Clustering Data Streams: Theory and Practice (2003) — 943 citations
• Near-optimal sparse fourier representations via sampling (2002) — 292 citations
• Fast, small-space algorithms for approximate histogram maintenance (2002) — 305 citations
• Streaming-data algorithms for high-quality clustering (2002) — 694 citations
• Data-streams and histograms (2001) — 315 citations
• Clustering data streams (2000) — 903 citations
• Approximation algorithms for facility location problems (2000) — 369 citations
• A constant-factor approximation algorithm for the k-median problem (extended abstract) (1999)