PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lincoln, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Connectivity Condition for Byzantine Fault Tolerance.

, , and . CoRR, (2015)

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.

Dr. Andrea Thom University of Stuttgart

Andrea Loi University of Stuttgart

Andrea Talmann University of Stuttgart

Jun. -Prof. Dr. Andrea Iannelli University of Stuttgart

Dr. Andrea Zappe University of Stuttgart

 

Other publications of authors with the same name

Faster Random k-CNF Satisfiability., and . CoRR, (2019)Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy., , , , and . ITCS, volume 94 of LIPIcs, page 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs., and . ITCS, volume 151 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Monochromatic Triangles, Intermediate Matrix Products, and Convolutions., , and . ITCS, volume 151 of LIPIcs, page 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Deterministic Time-Space Trade-Offs for k-SUM., , , and . ICALP, volume 55 of LIPIcs, page 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)The one-out-of-k retrieval problem and linear network coding., , , , and . Adv. in Math. of Comm., 10 (1): 95-112 (2016)Conditional Hardness for Sensitivity Problems., , , and . ITCS, volume 67 of LIPIcs, page 26:1-26:31. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ..., , , , , , and . JIP, (2017)Fault Tolerance of Node Failure in a Stochastic Localization Algorithm for Wireless Sensor Networks., and . I. J. Comput. Appl., 18 (4): 227-233 (2011)Public-Key Cryptography in the Fine-Grained Setting., , and . CRYPTO (3), volume 11694 of Lecture Notes in Computer Science, page 605-635. Springer, (2019)