A Concurrent Implementation of Skip Graphs (Q2840547): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.11.043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963531767 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Skip graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The mutual exclusion problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Optimistic Skiplist Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4028906 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lock-free linked lists using compare-and-swap / rank | |||
Normal rank | |||
Latest revision as of 15:19, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Concurrent Implementation of Skip Graphs |
scientific article |
Statements
A Concurrent Implementation of Skip Graphs (English)
0 references
19 July 2013
0 references
algorithms and data structures
0 references
analysis of algorithms
0 references
concurrency
0 references
skip graphs
0 references
randomized algorithms
0 references
