Andrea Lincoln

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 32

Top Topics

Boolean Formula

Fault Tolerance

Top Venues

Publications

David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams
Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. 27 (5) (2023)
David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams
Quasipolynomiality of the Smallest Missing Induced Subgraph. CoRR (2023)
Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. CoRR (2023)
Justin Holmgren, Andrea Lincoln, Ron D. Rothblum
Delegation for Search Problems. ICALP (2022)
Monika Henzinger, Andrea Lincoln, Barna Saha
The Complexity of Average-Case Dynamic Subgraph Counting. SODA (2022)
Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha
How Compression and Approximation Affect Efficiency in String Distance Measures. SODA (2022)
Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha
How Compression and Approximation Affect Efficiency in String Distance Measures. CoRR (2021)
Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro
Dynamic Boolean Formula Evaluation. ISAAC (2021)
Monika Henzinger, Andrea Lincoln, Barna Saha
The Complexity of Average-Case Dynamic Subgraph Counting. Electron. Colloquium Comput. Complex. 28 (2021)
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. CoRR (2020)
Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA (2020)
Andrea Lincoln, Adam Yedidia
Faster Random k-CNF Satisfiability. ICALP (2020)
Andrea Lincoln, Nikhil Vyas
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs. ITCS (2020)
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
New Techniques for Proving Fine-Grained Average-Case Hardness. FOCS (2020)
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
New Techniques for Proving Fine-Grained Average-Case Hardness. CoRR (2020)
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. ITCS (2020)
Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams
Public-Key Cryptography in the Fine-Grained Setting. IACR Cryptol. ePrint Arch. 2019 (2019)
Andrea Lincoln, Adam Yedidia
Faster Random k-CNF Satisfiability. CoRR (2019)
Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams
Public-Key Cryptography in the Fine-Grained Setting. CRYPTO (3) (2019)
Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. SODA (2018)
Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS (2018)
Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA (2018)
Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. CoRR (2017)
Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams
Conditional Hardness for Sensitivity Problems. ITCS (2017)
Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy. CoRR (2017)
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... J. Inf. Process. 25 (2017)
Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams
Conditional Hardness for Sensitivity Problems. CoRR (2017)
Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley
Cache-Adaptive Analysis. SPAA (2016)
Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, Muriel Médard
The one-out-of-k retrieval problem and linear network coding. Adv. Math. Commun. 10 (1) (2016)
Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams
Deterministic Time-Space Trade-Offs for k-SUM. ICALP (2016)
Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams
Deterministic Time-Space Tradeoffs for k-SUM. CoRR (2016)
Adam Hesterberg, Andrea Lincoln, Jayson Lynch
Improved Connectivity Condition for Byzantine Fault Tolerance. CoRR (2015)
Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, Muriel Médard
The One-Out-of-k Retrieval Problem and Linear Network Coding. ICMCTA (2014)
Andrea Lincoln, Ying Wei Lin
Fault Tolerance of Node Failure in a Stochastic Localization Algorithm for Wireless Sensor Networks. Int. J. Comput. Their Appl. 18 (4) (2011)
Andrea Lincoln, Ying Wei Lin
Fault Tolerance of Node Failures in a Stochastic Localization Algorithm for Wireless Sensor Networks. CAINE (2010)