A concurrent implementation of skip graphs

DOI10.1016/J.ENDM.2009.11.043MaRDI QIDQ2840547zbMATH OpenOpenAlexFDO

Authors Hammurabi Mendes, Cristina G. Fernandes

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.043

zbMATH Keywords

analysis of algorithmsrandomized algorithmsconcurrencyalgorithms and data structuresskip graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 2079362
• Skip graphs
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• scientific article; zbMATH DE number 2006660
• scientific article; zbMATH DE number 140487

Cites work

• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• A Simple Optimistic Skiplist Algorithm
• Lock-free linked lists using compare-and-swap
• Skip graphs
• The mutual exclusion problem

Cited in

(4)

• Skip graphs
• Wait-free concurrent graph objects with dynamic traversals
• NUMASK: high performance scalable skip list for NUMA
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)

This page was built for publication: A concurrent implementation of skip graphs

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