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
125 2018 Deterministic time-space tradeoffs for k-sum A Lincoln, VV Williams, JR Wang, RR Williams
arXiv preprint arXiv:1605.07285, 2016
42 2016 Public-key cryptography in the fine-grained setting R LaVigne, A Lincoln, V Vassilevska Williams
Annual International Cryptology Conference, 605-635, 2019
37 2019 Monochromatic triangles, intermediate matrix products, and convolutions A Lincoln, A Polak, VV Williams
arXiv preprint arXiv:2009.14479, 2020
30 2020 Conditional hardness for sensitivity problems M Henzinger, A Lincoln, S Neumann, VV Williams
arXiv preprint arXiv:1703.01638, 2017
28 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
25 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
19 2016 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
14 2022 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
14 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
13 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 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
9 2017 Faster Random A Lincoln, A Yedidia
arXiv preprint arXiv:1903.10618, 2019
8 2019 On the complexity of algorithms with predictions for dynamic graph problems M Henzinger, B Saha, MP Seybold, C Ye
arXiv preprint arXiv:2307.16771, 2023
7 2023 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 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
6 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 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
2 2017 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 Quasipolynomiality of the Smallest Missing Induced Subgraph D Eppstein, A Lincoln, VV Williams
arXiv preprint arXiv:2306.11185, 2023
1 2023 
Virginia Vassilevska WilliamsMITEmail verificata su mit.edu
