A Variant of the Arrow Distributed Directory with Low Average Complexity

David Peleg, Eilon Reshef. A Variant of the Arrow Distributed Directory with Low Average Complexity. In Jirí Wiedermann, Peter van Emde Boas, Mogens Nielsen, editors, Automata, Languages and Programming, 26th International Colloquium, ICALP 99, Prague, Czech Republic, July 11-15, 1999, Proceedings. Volume 1644 of Lecture Notes in Computer Science, pages 615-624, Springer, 1999. [doi]

@inproceedings{PelegR99,
  title = {A Variant of the Arrow Distributed Directory with Low Average Complexity},
  author = {David Peleg and Eilon Reshef},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1644/16440615.htm},
  researchr = {https://researchr.org/publication/PelegR99},
  cites = {0},
  citedby = {0},
  pages = {615-624},
  booktitle = {Automata, Languages and Programming, 26th International Colloquium, ICALP 99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
  editor = {Jirí Wiedermann and Peter van Emde Boas and Mogens Nielsen},
  volume = {1644},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66224-3},
}