On the public citation graph
Skip B-Trees
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45748-8_26openalex-snapshot
Dynamically Fault-Tolerant Content Addressable Networks
inferredcites →https://doi.org/10.1007/3-540-45749-6_30openalex-snapshot
Butterflies and Peer-to-Peer Networks
inferredcites →https://doi.org/10.1007/978-1-4615-0013-1_9openalex-snapshot
The Power of Two Random Choices: A Survey of Techniques and Results
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_9openalex-snapshot
Koorde: A Simple Degree-Optimal Distributed Hash Table
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1016/s0019-9958(84)80035-2openalex-snapshot
Fault tolerance and storage reduction in binary search trees
inferredcites →https://doi.org/10.1109/ipdps.2003.1213125openalex-snapshot
A generic scheme for building overlay networks in adversarial scenarios
inferredcites →https://doi.org/10.1109/sfcs.1996.548517openalex-snapshot
Fault tolerant data structures
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1142/s0129053394000238openalex-snapshot
A DISTRIBUTED, REPLICATED, DATA-BALANCED SEARCH STRUCTURE
inferredcites →https://doi.org/10.1145/1007912.1007919openalex-snapshot
Simple efficient load balancing algorithms for peer-to-peer systems
inferredcites →https://doi.org/10.1145/1011767.1011785openalex-snapshot
Load balancing and locality in range-queriable data structures
inferredcites →https://doi.org/10.1145/1073970.1073990openalex-snapshot
Decentralized algorithms using both local and random probes for P2P load balancing
inferredcites →https://doi.org/10.1145/112600.112609openalex-snapshot
Compact deterministic distributed dictionaries (extended abstract)
inferredcites →https://doi.org/10.1145/42201.42204openalex-snapshot
Concurrent search structure algorithms
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.1145/872035.872053openalex-snapshot
Peer-to-peer systems for prefix search
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-72360-8_45openalex-snapshot
SONMAS: A Structured Overlay Network for Multidimensional Attribute Space
inferred← citeshttps://doi.org/10.1007/978-3-540-76837-1_23openalex-snapshot
Pampoo: An Efficient Skip-Trie Based Query Processing Framework for P2P Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_6openalex-snapshot
Physical Expander in Virtual Tree Overlay
inferred← citeshttps://doi.org/10.1007/978-94-007-1473-1_8openalex-snapshot
Distribution–Efficient Networks
inferred← citeshttps://doi.org/10.1007/s13369-016-2288-yopenalex-snapshot
Fair Priority Scheduling (FPS): A Process Scheduling Algorithm Based on Skip Ring Data Structure
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.08.003openalex-snapshot
Range queries over skip tree graphs
inferred← citeshttps://doi.org/10.1109/ccnc.2017.7983077openalex-snapshot
Autonomous and distributed construction of locality aware skip graph
inferred← citeshttps://doi.org/10.1109/hipc66333.2025.00035openalex-snapshot
Distributed Metadata Querying on HPC Systems
inferred← citeshttps://doi.org/10.1109/ic-nc.2010.59openalex-snapshot
Balance and Proximity-Aware Skip Graph Construction
inferred← citeshttps://doi.org/10.1109/icde.2017.54openalex-snapshot
Parallelizing Skip Lists for In-Memory Multi-Core Database Systems
inferred← citeshttps://doi.org/10.1109/icde.2018.00064openalex-snapshot
A Comprehensive Performance Evaluation of Modern In-Memory Indices
inferred← citeshttps://doi.org/10.1145/2902251.2902276openalex-snapshot
Anti-Persistence on Persistent Storage
inferred← citeshttps://doi.org/10.14778/1453856.1453962openalex-snapshot
A skip-list approach for efficiently processing forecasting queries
inferred← citeshttps://doi.org/10.48550/arxiv.1308.4895openalex-snapshot
Optimizing Key Distribution in Peer to Peer Network Using B-Trees
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.