A Distributed and Oblivious Heap

DOI10.1007/978-3-642-02930-1_47MaRDI QIDQ5321687zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The forgiving tree, a self-healing distributed data structure
• Algorithms – ESA 2005
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Soft heaps simplified
• Snap-Stabilizing Optimal Binary Search Tree

Cited in

(10)

• A deterministic worst-case message complexity optimal solution for resource discovery
• Distributed agreement in dynamic peer-to-peer networks
• Towards worst-case churn resistant peer-to-peer systems
• Bankrupting Sybil despite churn
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• Re-Chord: a self-stabilizing chord overlay network
• \(D^2\)-tree: a new overlay with deterministic bounds
• Resource Burning for Permissionless Systems (Invited Paper)
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Towards robust and efficient computation in dynamic peer-to-peer networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321687)