| Tight hardness for shortest cycles and paths in sparse graphs A Lincoln, VV Williams, R Williams Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 103 | 2018 |
| Deterministic Time-Space Tradeoffs for k-SUM A Lincoln, VV Williams, JR Wang, RR Williams arXiv preprint arXiv:1605.07285, 2016 | 37 | 2016 |
| Public-key cryptography in the fine-grained setting R LaVigne, A Lincoln, V Vassilevska Williams Annual International Cryptology Conference, 605-635, 2019 | 27 | 2019 |
| Conditional hardness for sensitivity problems M Henzinger, A Lincoln, S Neumann, VV Williams arXiv preprint arXiv:1703.01638, 2017 | 25 | 2017 |
| New techniques for proving fine-grained average-case hardness M Dalirrooyfard, A Lincoln, VV Williams 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 22 | 2020 |
| Monochromatic triangles, intermediate matrix products, and convolutions A Lincoln, A Polak, VV Williams arXiv preprint arXiv:2009.14479, 2020 | 22 | 2020 |
| Cache-adaptive analysis MA Bender, ED Demaine, R Ebrahimi, JT Fineman, R Johnson, A Lincoln, ... Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016 | 18 | 2016 |
| Fine-grained I/O complexity via reductions: New lower bounds, faster algorithms, and a time hierarchy ED Demaine, A Lincoln, QC Liu, J Lynch, VV Williams arXiv preprint arXiv:1711.07960, 2017 | 13 | 2017 |
| The complexity of average-case dynamic subgraph counting M Henzinger, A Lincoln, B Saha Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 10 | 2022 |
| Closing the gap between cache-oblivious and cache-adaptive analysis MA Bender, RA Chowdhury, R Das, R Johnson, W Kuszmaul, A Lincoln, ... Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 9 | 2020 |
| How compression and approximation affect efficiency in string distance measures A Ganesh, T Kociumaka, A Lincoln, B Saha Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 7 | 2022 |
| Faster Random -CNF Satisfiability A Lincoln, A Yedidia arXiv preprint arXiv:1903.10618, 2019 | 7 | 2019 |
| Cache-adaptive exploration: Experimental results and scan-hiding for adaptivity A Lincoln, QC Liu, J Lynch, H Xu Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 7 | 2018 |
| Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,... ED Demaine, ML Demaine, S Eisenstat, A Hesterberg, A Lincoln, J Lynch, ... Journal of Information Processing 25, 515-527, 2017 | 7 | 2017 |
| Algorithms and lower bounds for cycles and walks: Small space and sparse graphs A Lincoln, N Vyas 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 4 | 2020 |
| The one-out-of-k retrieval problem and Linear Network Coding G Bianchi, L Bracciale, K Censor-Hillel, A Lincoln, M Médard Coding Theory and Applications: 4th International Castle Meeting, Palmela …, 2015 | 3 | 2015 |
| Fault Tolerance of Node Failures in a Stochastic Localization Algorithm for Wireless Sensor Networks. AI Lincoln, YW Lin International Journal for Computers & Their Applications 18 (4), 2011 | 2 | 2011 |
| Analysis of recursive cache-adaptive algorithms A Lincoln Massachusetts Institute of Technology, 2015 | 1 | 2015 |
| On the Complexity of Algorithms with Predictions for Dynamic Graph Problems M Henzinger, A Lincoln, B Saha, MP Seybold, C Ye arXiv preprint arXiv:2307.16771, 2023 | | 2023 |
| Quasipolynomiality of the Smallest Missing Induced Subgraph D Eppstein, A Lincoln, VV Williams arXiv preprint arXiv:2306.11185, 2023 | | 2023 |
Virginia Vassilevska WilliamsMITVerified email at mit.edu
