Skip graphs

DOI10.1145/1290672.1290674MaRDI QIDQ4962676zbMATH OpenOpenAlexFDO

Authors James Aspnes, Gauri Shah

Publication date 5 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

overlay networkspeer-to-peerskip lists

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2079362
• A concurrent implementation of skip graphs
• Algorithms and Computation
• Tiara: a self-stabilizing deterministic skip list and skip graph
• On the search path length of random binary skip graphs

Cited in

(11)

• Distributed computation and reconfiguration in actively dynamic networks
• A concurrent implementation of skip graphs
• Tiara: a self-stabilizing deterministic skip list and skip graph
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• Re-Chord: a self-stabilizing chord overlay network
• Towards a universal approach for the finite departure problem in overlay networks
• Sometimes Reliable Spanners of Almost Linear Size.
• Algorithms and Computation
• Fault-tolerant graph realizations in the congested clique
• The complexity of growing a graph
• The complexity of growing a graph

This page was built for publication: Skip graphs

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