Следене
Andrea Lincoln
Заглавие
Позовавания
Позовавания
Година
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
1272018
Deterministic time-space tradeoffs for k-sum
A Lincoln, VV Williams, JR Wang, RR Williams
arXiv preprint arXiv:1605.07285, 2016
432016
Public-key cryptography in the fine-grained setting
R LaVigne, A Lincoln, V Vassilevska Williams
Annual International Cryptology Conference, 605-635, 2019
392019
Monochromatic triangles, intermediate matrix products, and convolutions
A Lincoln, A Polak, VV Williams
arXiv preprint arXiv:2009.14479, 2020
312020
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
292020
Conditional hardness for sensitivity problems
M Henzinger, A Lincoln, S Neumann, VV Williams
arXiv preprint arXiv:1703.01638, 2017
282017
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
192016
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
162017
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
142022
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
132022
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
92023
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
92020
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
92017
Faster Random -CNF Satisfiability
A Lincoln, A Yedidia
arXiv preprint arXiv:1903.10618, 2019
82019
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
72020
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
72018
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
32015
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
22017
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
22011
Quasipolynomiality of the Smallest Missing Induced Subgraph
D Eppstein, A Lincoln, VV Williams
arXiv preprint arXiv:2306.11185, 2023
12023
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20