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

Improved Connectivity Condition for Byzantine Fault Tolerance.

A. Hesterberg, A. Lincoln, and J. Lynch. 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.

No persons found for author name Lynch, Jayson

add a person with the name Lynch, Jayson

Other publications of authors with the same name

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. CoRR, (2017)Losing at Checkers is Hard.J. Bosboom, S. Congero, E. Demaine, M. Demaine, and J. Lynch. CoRR, (2018)Improved Connectivity Condition for Byzantine Fault Tolerance.A. Hesterberg, A. Lincoln, and J. Lynch. CoRR, (2015)Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity.A. Lincoln, Q. Liu, J. Lynch, and H. Xu. SPAA, page 213-222. ACM, (2018)Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.Z. Abel, E. Demaine, M. Demaine, S. Eisenstat, J. Lynch, and T. Schardl. JIP, 21 (3): 368-377 (2013)Minimal forcing sets for 1D origami.M. Damian, E. Demaine, M. Dulieu, R. Flatland, H. Hoffman, T. Hull, J. Lynch, and S. Ramaswami. CoRR, (2017)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 fuer Informatik, (2018)Who Needs Crossings? Hardness of Plane Graph Rigidity.Z. Abel, E. Demaine, M. Demaine, S. Eisenstat, J. Lynch, and T. Schardl. Symposium on Computational Geometry, volume 51 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Dissection with the Fewest Pieces is Hard, Even to Approximate.J. Bosboom, E. Demaine, M. Demaine, J. Lynch, P. Manurangsi, M. Rudoy, and A. Yodpinyanee. JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 37-48. Springer, (2015)Energy-Efficient Algorithms.E. Demaine, J. Lynch, G. Mirano, and N. Tyagi. ITCS, page 321-332. ACM, (2016)

PUMA

Disambiguation of "Lynch, Jayson"

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

Improved Connectivity Condition for Byzantine Fault Tolerance.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Lynch, Jayson"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Improved Connectivity Condition for Byzantine Fault Tolerance.

Please choose a person to relate this publication to

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

Improved Connectivity Condition for Byzantine Fault Tolerance.