Andrea Lincoln

According to our database, Andrea Lincoln authored at least 24 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Quasipolynomiality of the Smallest Missing Induced Subgraph.

David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams

J. Graph Algorithms Appl., 2023

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.

Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye

CoRR, 2023

2022

How Compression and Approximation Affect Efficiency in String Distance Measures.

Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Delegation for Search Problems.

Justin Holmgren, Andrea Lincoln, Ron D. Rothblum

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

The Complexity of Average-Case Dynamic Subgraph Counting.

Monika Henzinger, Andrea Lincoln, Barna Saha

Electron. Colloquium Comput. Complex., 2021

Dynamic Boolean Formula Evaluation.

Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis.

Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Monochromatic Triangles, Intermediate Matrix Products, and Convolutions.

Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs.

Andrea Lincoln, Nikhil Vyas

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Faster Random k-CNF Satisfiability.

Andrea Lincoln, Adam Yedidia

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

New Techniques for Proving Fine-Grained Average-Case Hardness.

Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Public-Key Cryptography in the Fine-Grained Setting.

Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams

IACR Cryptol. ePrint Arch., 2019

2018

Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity.

Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Tight Hardness for Shortest Cycles and Paths in Sparse Graphs.

Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.

Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...

Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu

J. Inf. Process., 2017

Conditional Hardness for Sensitivity Problems.

Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Deterministic Time-Space Tradeoffs for k-SUM.

Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams

CoRR, 2016

The one-out-of-k retrieval problem and linear network coding.

Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, Muriel Médard

Adv. Math. Commun., 2016

Cache-Adaptive Analysis.

Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Deterministic Time-Space Trade-Offs for k-SUM.

Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Improved Connectivity Condition for Byzantine Fault Tolerance.

Adam Hesterberg, Andrea Lincoln, Jayson Lynch

CoRR, 2015

2011

Fault Tolerance of Node Failure in a Stochastic Localization Algorithm for Wireless Sensor Networks.

Andrea Lincoln, Ying Wei Lin

Int. J. Comput. Their Appl., 2011

2010

Fault Tolerance of Node Failures in a Stochastic Localization Algorithm for Wireless Sensor Networks.

Andrea Lincoln, Ying Wei Lin

Proceedings of the ISCA 23rd International Conference on Computer Applications in Industry and Engineering, 2010