A Distributed and Oblivious Heap

DOI10.1007/978-3-642-02930-1_47zbMath1248.68174OpenAlexW1565963762MaRDI QIDQ5321687

Stefan Schmid, Christian Scheideler

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_47

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (10)

D 3-Tree: A Dynamic Deterministic Decentralized Structure ⋮ Towards worst-case churn resistant peer-to-peer systems ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Bankrupting Sybil despite churn ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ \(D^2\)-tree: a new overlay with deterministic bounds ⋮ SKIP ⁺ ⋮ Unnamed Item ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: A Distributed and Oblivious Heap