default search action
Andrea Lincoln
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i14]Paul F. Christiano, Jacob Hilton, Andrea Lincoln, Eric Neyman, Mark Xu:
Towards a Law of Iterated Expectations for Heuristic Estimators. CoRR abs/2410.01290 (2024) - 2023
- [j4]David Eppstein, Andrea Lincoln
, Virginia Vassilevska Williams:
Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. 27(5): 329-339 (2023) - [i13]David Eppstein, Andrea Lincoln
Quasipolynomiality of the Smallest Missing Induced Subgraph. CoRR abs/2306.11185 (2023) - [i12]Monika Henzinger, Andrea Lincoln
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. CoRR abs/2307.16771 (2023) - 2022
- [c18]Justin Holmgren
Delegation for Search Problems. ICALP 2022: 73:1-73:18 - [c17]Monika Henzinger, Andrea Lincoln
The Complexity of Average-Case Dynamic Subgraph Counting. SODA 2022: 459-498 - [c16]Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln
How Compression and Approximation Affect Efficiency in String Distance Measures. SODA 2022: 2867-2919 - 2021
- [c15]Rathish Das, Andrea Lincoln
Dynamic Boolean Formula Evaluation. ISAAC 2021: 61:1-61:19 - [i11]Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha:
How Compression and Approximation Affect Efficiency in String Distance Measures. CoRR abs/2112.05836 (2021) - [i10]Monika Henzinger, Andrea Lincoln
The Complexity of Average-Case Dynamic Subgraph Counting. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c14]Mina Dalirrooyfard, Andrea Lincoln
New Techniques for Proving Fine-Grained Average-Case Hardness. FOCS 2020: 774-785 - [c13]Andrea Lincoln
Faster Random k-CNF Satisfiability. ICALP 2020: 78:1-78:12 - [c12]Andrea Lincoln
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs. ITCS 2020: 11:1-11:17 - [c11]Andrea Lincoln
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. ITCS 2020: 53:1-53:18 - [c10]Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA 2020: 63-73 - [i9]Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams:
New Techniques for Proving Fine-Grained Average-Case Hardness. CoRR abs/2008.06591 (2020) - [i8]Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams:
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. CoRR abs/2009.14479 (2020)
2010 – 2019
- 2019
- [c9]Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams:
Public-Key Cryptography in the Fine-Grained Setting. CRYPTO (3) 2019: 605-635 - [i7]Andrea Lincoln, Adam Yedidia:
Faster Random k-CNF Satisfiability. CoRR abs/1903.10618 (2019) - [i6]Rio LaVigne, Andrea Lincoln
Public-Key Cryptography in the Fine-Grained Setting. IACR Cryptol. ePrint Arch. 2019: 625 (2019) - 2018
- [c8]Erik D. Demaine, Andrea Lincoln
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS 2018: 34:1-34:23 - [c7]Andrea Lincoln
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. SODA 2018: 1236-1252 - [c6]Andrea Lincoln
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA 2018: 213-222 - 2017
- [j3]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ... J. Inf. Process. 25: 515-527 (2017) - [c5]Monika Henzinger, Andrea Lincoln
Conditional Hardness for Sensitivity Problems. ITCS 2017: 26:1-26:31 - [i5]Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams:
Conditional Hardness for Sensitivity Problems. CoRR abs/1703.01638 (2017) - [i4]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 abs/1711.07960 (2017) - [i3]Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams:
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. CoRR abs/1712.08147 (2017) - 2016
- [j2]Giuseppe Bianchi, Lorenzo Bracciale
The one-out-of-k retrieval problem and linear network coding. Adv. Math. Commun. 10(1): 95-112 (2016) - [c4]Andrea Lincoln
Deterministic Time-Space Trade-Offs for k-SUM. ICALP 2016: 58:1-58:14 - [c3]Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln
Cache-Adaptive Analysis. SPAA 2016: 135-144 - [i2]Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams:
Deterministic Time-Space Tradeoffs for k-SUM. CoRR abs/1605.07285 (2016) - 2015
- [i1]Adam Hesterberg, Andrea Lincoln, Jayson Lynch:
Improved Connectivity Condition for Byzantine Fault Tolerance. CoRR abs/1503.02774 (2015) - 2014
- [c2]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: 61-75 - 2011
- [j1]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): 227-233 (2011) - 2010
- [c1]Andrea Lincoln, Ying Wei Lin:
Fault Tolerance of Node Failures in a Stochastic Localization Algorithm for Wireless Sensor Networks. CAINE 2010: 264-168
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: