Skip lists: a probabilistic alternative to balanced trees

Authors:
William Pugh
Affiliations:
Univ. of Maryland, College Park
Venue:
Communications of the ACM
Year:
1990

Citing 10
Cited 205

Self-adjusting binary search trees

Journal of the ACM (JACM)
Incremental computation via function caching

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies

Information Processing Letters
Analysis of the expected search cost in skip lists

SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
A skip list cookbook

A skip list cookbook
Concurrent maintenance of skip lists

Concurrent maintenance of skip lists
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Anatomy of LISP

Anatomy of LISP
Data Structures and Algorithms

Data Structures and Algorithms

A compendium of key search references

ACM SIGIR Forum
Randomized multidimensional search trees (extended abstract): dynamic sampling

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic point location in arrangements of hyperplanes

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Deterministic skip lists

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A survey of adaptive sorting algorithms

ACM Computing Surveys (CSUR)
Abstract description of pointer data structures: an approach for improving the analysis and optimization of imperative programs

ACM Letters on Programming Languages and Systems (LOPLAS)
The point-range tree: a data structure for indexing intervals

CSC '93 Proceedings of the 1993 ACM conference on Computer science
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
An algorithm for approximate closest-point queries

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Expected I-cache miss rates via the gap model

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Lock-free linked lists using compare-and-swap

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Routing on longest-matching prefixes

IEEE/ACM Transactions on Networking (TON)
Static and dynamic partitioning of pointers as links and threads

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Fixed-dimensional linear programming queries made easy

Proceedings of the twelfth annual symposium on Computational geometry
A comparative study of parallel and sequential priority queue algorithms

ACM Transactions on Modeling and Computer Simulation (TOMACS)
A testbed for parallel simulation performance prediction

WSC '96 Proceedings of the 28th conference on Winter simulation
Shape types

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Randomized binary search trees

Journal of the ACM (JACM)
On indexed data broadcast

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering

Proceedings of the fourteenth annual symposium on Computational geometry
Fast set operations using treaps

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Weight-biased leftist trees and modified skip lists

Journal of Experimental Algorithmics (JEA)
Winnowing sequences from a database search

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Using randomization in the teaching of data structures and algorithms

SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Effective jump-pointer prefetching for linked data structures

ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Scalable concurrent priority queue algorithms

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Compressing Java class files

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Approximate nearest neighbor queries in fixed dimensions

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Skip strips: maintaining triangle strips for view-dependent rendering

VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Dealing with server corruption in weakly consistent replicated data systems

Wireless Networks
Intensive Data Management in Parallel Systems: A Survey

Distributed and Parallel Databases
Kinetic connectivity for unit disks

Proceedings of the sixteenth annual symposium on Computational geometry
Efficient minimum spanning tree construction without Delaunay triangulation

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Using space-time grid for efficient management of moving objects

Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Biased dictionaries with fast insert/deletes

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Software caching vs. prefetching

Proceedings of the 3rd international symposium on Memory management
An efficient routing database

Proceedings of the 39th annual Design Automation Conference
On varying perspectives of problem decomposition

SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Viceroy: a scalable and dynamic emulation of the butterfly

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Randomized splay trees: theoretical and experimental results

Information Processing Letters
Dynamic Scene Occlusion Culling

IEEE Transactions on Visualization and Computer Graphics
The Design and Implementation of the Ariel Active Database Rule System

IEEE Transactions on Knowledge and Data Engineering
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Scalable Sweeping-Based Spatial Join

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Randomized K-Dimensional Binary Search Trees

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Biased Skip Lists

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Traffic Sensitive Active Queue Management for Improved Multimedia Streaming

QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Performance Comparable Design of Efficient Synchronization Protocols for Distributed Simulation

MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Biased Skip Lists for Highly Skewed Access Patterns

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Randomized Meldable Priority Queues

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Secure History Preservation Through Timeline Entanglement

Proceedings of the 11th USENIX Security Symposium
Persistent Authenticated Dictionaries and Their Applications

ISC '01 Proceedings of the 4th International Conference on Information Security
Vampire 1.1 (System Description)

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Authenticating distributed data using Web services and XML signatures

Proceedings of the 2002 ACM workshop on XML security
Combinatorics of geometrically distributed random variables: run statistics

Theoretical Computer Science - Latin American theoretical informatics
Event-driven simulation of spiking neurons with stochastic dynamics

Neural Computation
Fast and Sensitive Alignment of Large Genomic Sequences

CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Range and kNN query processing for moving objects in grid model

Mobile Networks and Applications
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions

Journal of Experimental Algorithmics (JEA)
Visualization of oil reservoirs over a large range of scales as a catalyst for multi-disciplinary integration

VIS '93 Proceedings of the 4th conference on Visualization '93
Efficient matching for state-persistent publish/subscribe systems

CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
Scalable and lock-free concurrent dictionaries

Proceedings of the 2004 ACM symposium on Applied computing
Online Amnesic Approximation of Streaming Time Series

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lock-free linked lists and skip lists

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Adaptive sampling for geometric problems over data streams

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The skip quadtree: a simple dynamic data structure for multidimensional data

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Fast and lock-free concurrent priority queues for multi-thread systems

Journal of Parallel and Distributed Computing
Skip-webs: efficient distributed data structures for multi-dimensional data sets

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Hierarchical Splatting of Scattered Data

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
A Peer-to-Peer Formula Interest Expression Propagation Model for Distributed Virtual Environments

DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
TSAR: a two tier sensor storage architecture using interval skip graphs

Proceedings of the 3rd international conference on Embedded networked sensor systems
Efficient instance retrieval with standard and relational path indexing

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
CHRONOS: an authenticated dictionary based on skip lists for timestamping systems

Proceedings of the 2005 workshop on Secure web services
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices

Information Processing and Management: an International Journal
The binomial transform and the analysis of skip lists

Theoretical Computer Science
A flexible framework for implementing software transactional memory

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
A data structure for a sequence of string accesses in external memory

ACM Transactions on Algorithms (TALG)
Deterministic jumplists

Nordic Journal of Computing
The number of distinct values in a geometrically distributed sample

European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Spatial join techniques

ACM Transactions on Database Systems (TODS)
The design and implementation of VAMPIRE

AI Communications - CASC
Survey of research towards robust peer-to-peer networks: search methods

Computer Networks: The International Journal of Computer and Telecommunications Networking
Event-driven simulation scheme for spiking neural networks using lookup tables to characterize neuronal dynamics

Neural Computation
Exploring the duality between skip lists and binary search trees

ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Jonah: experience implementing PKIX reference freeware

SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
KHEPERA: a system for rapid implementation of domain specific languages

DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Skip graphs

ACM Transactions on Algorithms (TALG)
Local properties of geometric graphs

Computational Geometry: Theory and Applications
A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

Pattern Recognition
Adaptive sampling for geometric problems over data streams

Computational Geometry: Theory and Applications
Range queries on structured overlay networks

Computer Communications
Range queries over skip tree graphs

Computer Communications
On placing skips optimally in expectation

WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Dynamic optimality for skip lists and B-trees

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Low latency wireless ad hoc networking: power and bandwidth challenges and a solution

IEEE/ACM Transactions on Networking (TON)
Skippy: a new snapshot indexing method for time travel in the storage manager

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A Practical Approach to Word Level Model Checking of Industrial Netlists

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Online maintenance of very large random samples on flash storage

Proceedings of the VLDB Endowment
A skip-list approach for efficiently processing forecasting queries

Proceedings of the VLDB Endowment
Efficient integrity checking of untrusted network storage

Proceedings of the 4th ACM international workshop on Storage security and survivability
Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Tiara: A Self-stabilizing Deterministic Skip List

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Randomness Preserving Deletions on Special Binary Search Trees

Electronic Notes in Theoretical Computer Science (ENTCS)
Soft lists: a native index structure for NOR-flash-based embedded devices

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
The case of the fake Picasso: preventing history forgery with secure provenance

FAST '09 Proccedings of the 7th conference on File and storage technologies
A New Digital Notary System

Advanced Internet Based Systems and Applications
B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases
GAMPS: compressing multi sensor data by grouping and amplitude scaling

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
PUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
On efficient posting list intersection with multicore processors

Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Approximation algorithms for data placement on parallel disks

ACM Transactions on Algorithms (TALG)
Energy efficient sensor data logging with amnesic flash storage

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Word level bitwidth reduction for unbounded hardware model checking

Formal Methods in System Design
Preventing history forgery with secure provenance

ACM Transactions on Storage (TOS)
Operating System Transactions

Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Dynamic provable data possession

Proceedings of the 16th ACM conference on Computer and communications security
A practical concurrent binary search tree

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
A Library for Self-Adjusting Computation

Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient instance retrieval with standard and relational path indexing

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Online maintenance of very large random samples on flash storage

The VLDB Journal — The International Journal on Very Large Data Bases
FastAD: an authenticated directory for billions of objects

ACM SIGOPS Operating Systems Review
Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures
A new randomized data structure for the 11/2-dimensional range query problem

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
A simple optimistic skiplist algorithm

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Search data structures for skewed strings

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Distributed paged hash tables

VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Fractal Merkle tree representation and traversal

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Replica-aware, multi-dimensional range queries in Distributed Hash Tables

Computer Communications
On the cost of persistence and authentication in skip lists

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Time and space efficient algorithms for two-party authenticated data structures

ICICS'07 Proceedings of the 9th international conference on Information and communications security
Pampoo: an efficient skip-trie based query processing framework for P2P systems

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Skip ring topology in fast failure detection service

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
An effective longest prefix matching algorithm for speeding up query routing in skip graphs

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Flat combining and the synchronization-parallelism tradeoff

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A dynamic data structure for approximate range searching

Proceedings of the twenty-sixth annual symposium on Computational geometry
Data structures with unpredictable timing

ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Enabling content-based publish/subscribe services in cooperative P2P networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Defect prediction from static code features: current results, limitations, new approaches

Automated Software Engineering
Note: Random binary search tree with equal elements

Theoretical Computer Science
Mergeable dictionaries

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Basic data structures

Algorithms and theory of computation handbook
Randomized algorithms

Algorithms and theory of computation handbook
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)
Brief announcement: hierarchical neighbor graphs: a sparse connected structure for Euclidean point sets

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Efficient answering of set containment queries for skewed item distributions

Proceedings of the 14th International Conference on Extending Database Technology
A new and effective hierarchical overlay structure for Peer-to-Peer networks

Computer Communications
Fast lists intersection with Bloom filter using graphics processing units

Proceedings of the 2011 ACM Symposium on Applied Computing
A theory of skiplists with applications to the verification of concurrent datatypes

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Skip lift: a probabilistic alternative to red-black trees

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Column-oriented storage techniques for MapReduce

Proceedings of the VLDB Endowment
Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations

Proceedings of the 36th international symposium on Symbolic and algebraic computation
SkipBlock: self-indexing for block-based inverted list

ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
Efficient parallel lists intersection and index compression algorithms using graphics processing units

Proceedings of the VLDB Endowment
Flow-sensitive type recovery in linear-log time

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Corona: a stabilizing deterministic message-passing skip list

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Efficient data race detection for distributed memory parallel programs

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
LinkNet: a new approach for searching in a large peer-to-peer system

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Computational bounds on hierarchical data processing with applications to information security

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Scaling the kowari metastore

WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
Developments in data structure research during the first 25 years of FSTTCS

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Concurrent tries with efficient non-blocking snapshots

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Field constraint analysis

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Lookup table powered neural event-driven simulator

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Tiara: A self-stabilizing deterministic skip list and skip graph

Theoretical Computer Science
Skip b-trees

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Improving sender anonymity in a structured overlay with imprecise routing

PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
A new timestamping scheme based on skip lists

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Poketree: a dynamically competitive data structure with good worst-case performance

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Using ownership to reason about inherent parallelism in object-oriented programs

CC'10/ETAPS'10 Proceedings of the 19th joint European conference on Theory and Practice of Software, international conference on Compiler Construction
Compressed perfect embedded skip lists for quick inverted-index lookups

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Distributed vision-aided cooperative localization and navigation based on three-view geometry

Robotics and Autonomous Systems
Automating network and service configuration using NETCONF and YANG

LISA'11 Proceedings of the 25th international conference on Large Installation System Administration
Skip lift: A probabilistic alternative to red-black trees

Journal of Discrete Algorithms
Automated verification of shape, size and bag properties via user-defined predicates in separation logic

Science of Computer Programming
A non-blocking internal binary search tree

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A hierarchical approach to improve performance of unstructured peer-to-peer system

International Journal of Communication Networks and Distributed Systems
Simple dynamic load balancing mechanism for structured P2P network and its evaluation

International Journal of Grid and Utility Computing
Toward revocation data handling efficiency in VANETs

Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications

Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Unifying synchronization and events in a multicore OS

Proceedings of the Asia-Pacific Workshop on Systems
Thread-Safe priority queues in haskell based on skiplists

TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Unifying synchronization and events in a multicore OS

APSys'12 Proceedings of the Third ACM SIGOPS Asia-Pacific conference on Systems
Fast local searches and updates in bounded universes

Computational Geometry: Theory and Applications
Shape analysis with structural invariant checkers

SAS'07 Proceedings of the 14th international conference on Static Analysis
A structured overlay for multi-dimensional range queries

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A self-adjusting data structure for multidimensional point sets

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
CBTree: a practical concurrent self-adjusting search tree

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Brief announcement: a contention-friendly, non-blocking skip list

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Application of a "staggered walk" algorithm for generating large-scale morphological neuronal networks

Computational Intelligence and Neuroscience
HybridStore: an efficient data management system for hybrid flash-based sensor devices

EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
Attempt to reduce the computational complexity in multi-objective differential evolution algorithms

Proceedings of the 15th annual conference on Genetic and evolutionary computation
The SkipTrie: low-depth concurrent search without rebalancing

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Efficient dynamic provable possession of remote data via balanced update trees

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Randomized skip lists-based private authentication for large-scale RFID systems

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Opportunities and pitfalls of multi-core scaling using hardware transaction memory

Proceedings of the 4th Asia-Pacific Workshop on Systems
Fully automated shape analysis based on forest automata

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Enhancing concurrency in distributed transactional memory through commutativity

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Authenticated data structures, generically

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Corona: A stabilizing deterministic message-passing skip list

Theoretical Computer Science

Quantified Score

Hi-index	48.22

Visualization

Abstract

Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.