Gopal Pandurangan
SIAM journal on computing (Print) · 2010
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Gopal Pandurangan trusts
Their strongest outbound trust, strongest first, inferred from their citations.
- Amit Chakrabarti (in Computational Theory and Mathematics)
- Seif Haridi (in Algorithms & Complexity)
Papers from Gopal Pandurangan's perspective
Ordered by how strongly the researchers Gopal Pandurangan trusts endorse each paper. Same corpus, a different order for every researcher.
- Communication Complexity
- An information statistics approach to data stream and communication complexity
- Approximation Algorithms
- Distributed Algorithms
- Constant-time distributed dominating set approximation (ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing)
- Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
- Size-Estimation Framework with Applications to Transitive Closure and Reachability
- Reductions in streaming algorithms, with an application to counting triangles in graphs (ACM-SIAM Symposium on Discrete Algorithms)
- Information Theory: 1948-1998 - Guest Editorial
- Clustering data streams (Proceedings 41st Annual Symposium on Foundations of Computer Science)
Their papers
- Distributed verification and hardness of distributed approximation (2010) — 362 citations