@inproceedings{3bada5600475410ba3ac8799a9d74cac,

title = "Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing systems",

abstract = "We consider the following natural problem: n failure-prone servers, communicating synchronously through message passing, must assign themselves one-to-one to n distinct items. Existing literature suggests two possible approaches to this problem. First, model it as an instance of tight renaming in synchronous message-passing systems; for deterministic solutions, a tight bound of",

keywords = "Randomized algorithms, Renaming problem, Synchronous message-passing model",

author = "Dan Alistarh and Oksana Denysyuk and Lu{\'i}s Rodrigues and Nir Shavit",

year = "2014",

doi = "10.1145/2611462.2611499",

language = "אנגלית",

isbn = "9781450329446",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "232--241",

booktitle = "PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing",

note = "2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 ; Conference date: 15-07-2014 Through 18-07-2014",

}