*sublabel_EDS*

*custom_text_above_search_result**custom_text_above_search_result_EDS*

*Showing* 141 - 160 *of* 40*number_thousands_separator*260

141

Improved Byzantine Agreement under an Adaptive Adversary
Fabien Dufoulon ; Gopal Pandurangan
Proceedings of the ACM Symposium on Principles of Distributed Computing. :173-180

FOS: Computer and inform... Computer Science - Distr... Computer Science - Data... Data Structures and Algo... Distributed, Parallel, a...
*Academic Journal*
142

*This result is not displayed to guests*

144

*This result is not displayed to guests*

145

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
Tom-Lukas Breitkopf ; Julien Dallot ; Antoine El-Hayek ; et al.
Proceedings of the ACM Symposium on Principles of Distributed Computing. :549-552

FOS: Computer and inform... Computer Science - Distr... Distributed, Parallel, a...
*Academic Journal*
146

*This result is not displayed to guests*

148

*This result is not displayed to guests*

149

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs
Linda Cook ; Eun Jung Kim ; Tomáš Masařík
Proceedings of the ACM Symposium on Principles of Distributed Computing. :110-120

FOS: Computer and inform... Computer Science - Distr... Discrete Mathematics (cs... Computer Science - Data... 68R10 Data Structures and Algo...
*Academic Journal*
150

Probabilistic Byzantine Fault Tolerance (Extended Version)
Avelãs, Diogo ; Heydari, Hasan ; Alchieri, Eduardo ; et al.

Computer Science - Distr...
*Report*
152

*This result is not displayed to guests*

153

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
Alkida Balliu ; Pierre Fraigniaud ; Dennis Olivetti ; et al.
Proceedings of the ACM Symposium on Principles of Distributed Computing. :417-427

FOS: Computer and inform... Computer Science - Distr... Distributed, Parallel, a...
*Academic Journal*
155

*This result is not displayed to guests*

156

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
Marthe Bonamy ; Cyril Gavoille ; Timothe Picavet ; et al.
Proceedings of the ACM Symposium on Principles of Distributed Computing. :77-87

FOS: Computer and inform... Computer Science - Distr... Discrete Mathematics (cs... Distributed, Parallel, a... Computer Science - Discr...
*Academic Journal*
158

Clock Distribution with Gradient TRIX
Shreyas Srinivas ; Christoph Lenzen
Proceedings of the ACM Symposium on Principles of Distributed Computing. :499-509

FOS: Computer and inform... Computer Science - Distr... 0202 electrical engineer... 0102 computer and inform... 02 engineering and techn... Distributed, Parallel, a...
*Academic Journal*
159

Deterministic near-optimal distributed listing of cliques
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science ; Censor-Hillel, Keren ; Leitersdorf, Dean ; et al.
Springer Berlin Heidelberg

*Electronic Resource*

*Filter*