Lecture Notes in Computer Science - Distributed Computing
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662534250, 9783662534267

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Asynchronous Computability Theorems for t-Resilient Systems

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_31 ◽

2016 ◽

pp. 428-441 ◽

Cited By ~ 4

Author(s):

Vikram Saraph ◽

Maurice Herlihy ◽

Eli Gafni

Download Full-text

Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_3 ◽

2016 ◽

pp. 29-42 ◽

Cited By ~ 13

Author(s):

Amir Abboud ◽

Keren Censor-Hillel ◽

Seri Khoury

Keyword(s):

Lower Bounds ◽

Sparse Networks

Download Full-text

How to Discreetly Spread a Rumor in a Crowd

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_26 ◽

2016 ◽

pp. 357-370 ◽

Cited By ~ 5

Author(s):

Mohsen Ghaffari ◽

Calvin Newport

Download Full-text

Fast Two-Robot Disk Evacuation with Wireless Communication

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_1 ◽

2016 ◽

pp. 1-15 ◽

Cited By ~ 5

Author(s):

Ioannis Lamprou ◽

Russell Martin ◽

Sven Schewe

Keyword(s):

Wireless Communication

Download Full-text

k-Abortable Objects: Progress Under High Contention

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_22 ◽

2016 ◽

pp. 298-312

Author(s):

Naama Ben-David ◽

David Yu Cheng Chan ◽

Vassos Hadzilacos ◽

Sam Toueg

Download Full-text

Upper Bounds for Boundless Tagging with Bounded Objects

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_32 ◽

2016 ◽

pp. 442-457 ◽

Cited By ~ 1

Author(s):

Zahra Aghazadeh ◽

Philipp Woelfel

Keyword(s):

Upper Bounds

Download Full-text

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_12 ◽

2016 ◽

pp. 158-172 ◽

Cited By ~ 6

Author(s):

Bernhard Haeupler ◽

Taisuke Izumi ◽

Goran Zuzic

Download Full-text

Priority Mutual Exclusion: Specification and Algorithm

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_28 ◽

2016 ◽

pp. 385-398

Author(s):

Chien-Chung Huang ◽

Prasad Jayanti

Keyword(s):

Mutual Exclusion

Download Full-text

Optimal Consistent Network Updates in Polynomial Time

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_9 ◽

2016 ◽

pp. 114-128 ◽

Cited By ~ 3

Author(s):

Pavol Černý ◽

Nate Foster ◽

Nilesh Jagnik ◽

Jedidiah McClurg

Keyword(s):

Polynomial Time ◽

Network Updates

Download Full-text

Lower Bound on the Step Complexity of Anonymous Binary Consensus

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-662-53426-7_19 ◽

2016 ◽

pp. 257-268

Author(s):

Hagit Attiya ◽

Ohad Ben-Baruch ◽

Danny Hendler

Keyword(s):

Lower Bound ◽

Binary Consensus ◽

Step Complexity

Download Full-text

Lecture Notes in Computer Science - Distributed ComputingLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Asynchronous Computability Theorems for t-Resilient Systems

Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks

How to Discreetly Spread a Rumor in a Crowd

Fast Two-Robot Disk Evacuation with Wireless Communication

k-Abortable Objects: Progress Under High Contention

Upper Bounds for Boundless Tagging with Bounded Objects

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs

Priority Mutual Exclusion: Specification and Algorithm

Optimal Consistent Network Updates in Polynomial Time

Lower Bound on the Step Complexity of Anonymous Binary Consensus

Lecture Notes in Computer Science - Distributed Computing
Latest Publications