Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

E. Demaine, A. Lincoln, Q. Liu, J. Lynch, and V. Williams. ITCS, volume 94 of LIPIcs, page 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ulrich Lincoln

Tania Lincoln

Bryan Lincoln

Tania Lincoln

Other publications of authors with the same name

How Compression and Approximation Affect Efficiency in String Distance Measures.A. Ganesh, T. Kociumaka, A. Lincoln, and B. Saha. CoRR, (2021)Deterministic Time-Space Trade-Offs for k-SUM.A. Lincoln, V. Williams, J. Wang, and R. Williams. ICALP, volume 55 of LIPIcs, page 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quasipolynomiality of the Smallest Missing Induced Subgraph.D. Eppstein, A. Lincoln, and V. Williams. CoRR, (2023)The one-out-of-k retrieval problem and linear network coding.G. Bianchi, L. Bracciale, K. Censor-Hillel, A. Lincoln, and M. Médard. Adv. Math. Commun., 10 (1): 95-112 (2016)Delegation for Search Problems.J. Holmgren, A. Lincoln, and R. Rothblum. ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Faster Random k-CNF Satisfiability.A. Lincoln, and A. Yedidia. ICALP, volume 168 of LIPIcs, page 78:1-78:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Faster Random k-CNF Satisfiability.A. Lincoln, and A. Yedidia. CoRR, (2019)Monochromatic Triangles, Intermediate Matrix Products, and Convolutions.A. Lincoln, A. Polak, and V. Williams. CoRR, (2020)Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs.A. Lincoln, and N. Vyas. ITCS, volume 151 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.E. Demaine, A. Lincoln, Q. Liu, J. Lynch, and V. Williams. ITCS, volume 94 of LIPIcs, page 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

BibSonomy

Disambiguation of "Lincoln, Andrea"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Ulrich Lincoln

Tania Lincoln

Tania Lincoln

Bryan Lincoln

Tania Lincoln

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Lincoln, Andrea"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.

Please choose a person to relate this publication to

Ulrich Lincoln

Tania Lincoln

Tania Lincoln

Bryan Lincoln

Tania Lincoln

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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