Monika Henzinger
Computational Theory and Mathematics · with Heydon · 2000–2015
A researcher in the Science corpus: 2 papers; trusts 2 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 5 citations into it
Whom Monika Henzinger trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Monika Henzinger overall
- Zi Chu
- Michihiro Yasunaga
- Steven Gianvecchio
- Minas Gjoka
- Dániel Fogaras
- Haining Wang
- Brian D. Davison
- Jure Leskovec
- Sushil Jajodia
- Maciej Kurant
Papers from Monika Henzinger's perspective
Ordered by how strongly the researchers Monika Henzinger 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)
- The Anatomy of a Large-Scale Hypertextual Web Search Engine
- Graph structure in the Web (Comput. Networks)
- Structured Matrices and Polynomials: Unified Superfast Algorithms
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Improved bound for complexity of matrix multiplication (Proceedings of the Royal Society of Edinburgh. Section A Mathematics)
- Warping indexes with envelope transforms for query by humming (ACM SIGMOD Conference)
- Multiple Sequence Alignment (Theory and Mathematical Methods for Bioinformatics)
- Matrix multiplication via arithmetic progressions
Their papers
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (2015) — 325 citations
- On near-uniform URL sampling (2000) — 294 citations