Corona: a stabilizing deterministic message-passing skip list
From MaRDI portal
Publication:392011
DOI10.1016/J.TCS.2012.08.029zbMATH Open1358.68026OpenAlexW2009821304MaRDI QIDQ392011FDOQ392011
Christian Scheideler, Mikhail Nesterenko, Rizal Mohd Nor
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.029
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-stabilizing systems in spite of distributed control
- Unreliable failure detectors for reliable distributed systems
- Viceroy
- HyperTree for self-stabilizing peer-to-peer systems
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
- A Self-stabilizing and Local Delaunay Graph Construction
- Tiara: a self-stabilizing deterministic skip list and skip graph
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Linearization: Locally Self-Stabilizing Sorting in Graphs
- Principles of Distributed Systems
Cited In (5)
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Towards a universal approach for the finite departure problem in overlay networks
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
- Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure
- On the Complexity of Local Graph Transformations
Uses Software
This page was built for publication: Corona: a stabilizing deterministic message-passing skip list
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392011)
