Danupon Nanongkai
Computational Theory and Mathematics · 2010–2015
A researcher in the Science corpus: 2 papers; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 8 citations into it
Whom Danupon Nanongkai trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Danupon Nanongkai's perspective
Ordered by how strongly the researchers Danupon Nanongkai trusts endorse each paper. Same corpus, a different order for every researcher.
- Gaussian elimination is not optimal
- Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems (IEEE Annual Symposium on Foundations of Computer Science)
- 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
- Structured Matrices and Polynomials: Unified Superfast Algorithms
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
Their papers
- Distributed verification and hardness of distributed approximation (2010) — 362 citations
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (2015) — 325 citations