Lecture Notes in Computer Science - Distributed Computing
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662534250, 9783662534267

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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

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 ◽

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 ◽

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 ◽

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 ◽

Author(s):

Ioannis Lamprou ◽

Russell Martin ◽

Sven Schewe

Keyword(s):

Wireless Communication

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 ◽

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

Certified Universal Gathering in $$\mathbb {R} ^2$$ for Oblivious Mobile Robots

Lecture Notes in Computer Science - Distributed Computing ◽

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

2016 ◽

pp. 187-200 ◽

Author(s):

Pierre Courtieu ◽

Lionel Rieg ◽

Sébastien Tixeuil ◽

Xavier Urbain

Keyword(s):

Download Full-text

Depth of a Random Binary Search Tree with Concurrent Insertions

Lecture Notes in Computer Science - Distributed Computing ◽

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

2016 ◽

pp. 371-384

Author(s):

James Aspnes ◽

Eric Ruppert

Keyword(s):

Search Tree ◽

Binary Search ◽

Binary Search Tree

Download Full-text

On Composition and Implementation of Sequential Consistency

Lecture Notes in Computer Science - Distributed Computing ◽

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

2016 ◽

pp. 284-297 ◽

Author(s):

Matthieu Perrin ◽

Matoula Petrolia ◽

Achour Mostéfaoui ◽

Claude Jard

Keyword(s):

Sequential Consistency

Download Full-text