Skip-webs

DOI10.1145/1073814.1073827zbMath1314.68105OpenAlexW2052020735MaRDI QIDQ5177225

David Eppstein, Lars Arge, Michael T. Goodrich

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073827

zbMATH Keywords

quadtreestriespeer-to-peer networksdistributed data structuresoctreesskip liststrapezoidal maps

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

\(D^2\)-tree: a new overlay with deterministic bounds

This page was built for publication: Skip-webs