A skip list cookbookJuly 1990
- Author:
- William Pugh
Abstract
No abstract available.
Cited By
Raju P, Kadekodi R, Chidambaram V and Abraham I PebblesDB Proceedings of the 26th Symposium on Operating Systems Principles, (497-514)- Esiner E and Datta A (2016). Auditable versioned data storage outsourcing, Future Generation Computer Systems, 55:C, (17-28), Online publication date: 1-Feb-2016.
- (2016). An efficient method to evaluate intersections on big data sets, Theoretical Computer Science, 647:C, (1-21), Online publication date: 27-Sep-2016.
- Burton B Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations Proceedings of the 36th international symposium on Symbolic and algebraic computation, (59-66)
- Ding B and König A (2011). Fast set intersection in memory, Proceedings of the VLDB Endowment, 4:4, (255-266), Online publication date: 1-Jan-2011.
- Bethea D and Reiter M Data structures with unpredictable timing Proceedings of the 14th European conference on Research in computer security, (456-471)
- Dice D and Shavit N Understanding Tradeoffs in Software Transactional Memory Proceedings of the International Symposium on Code Generation and Optimization, (21-33)
- Dean B and Jones Z Exploring the duality between skip lists and binary search trees Proceedings of the 45th annual southeast regional conference, (395-399)
- Chiniforooshan E, Farzan A and Mirzazadeh M Worst case optimal union-intersection expression evaluation Proceedings of the 32nd international conference on Automata, Languages and Programming, (179-190)
- Boldi P and Vigna S Compressed perfect embedded skip lists for quick inverted-index lookups Proceedings of the 12th international conference on String Processing and Information Retrieval, (25-28)
- Blelloch G, Maggs B and Woo S Space-efficient finger search on degree-balanced search trees Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (374-383)
- Bozanis P A new randomized data structure for the 11/2-dimensional range query problem Proceedings of the 8th Panhellenic conference on Informatics, (440-452)
- Blelloch G and Reid-Miller M Fast set operations using treaps Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, (16-26)
- Kirschenhofer P, Martínez C and Prodinger H (1995). Analysis of an optimized search algorithm for skip lists, Theoretical Computer Science, 144:1, (199-220), Online publication date: 26-Jun-1995.
- Chaabouni M and Chung S The point-range tree Proceedings of the 1993 ACM conference on Computer science, (453-460)
- Pugh W (1990). Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, 33:6, (668-676), Online publication date: 1-Jun-1990.
Index Terms
- A skip list cookbook