Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
The point-range tree: a data structure for indexing intervals
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Fast set operations using treaps
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exploring the duality between skip lists and binary search trees
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Understanding Tradeoffs in Software Transactional Memory
Proceedings of the International Symposium on Code Generation and Optimization
Data structures with unpredictable timing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Fast set intersection in memory
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
Worst case optimal union-intersection expression evaluation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Compressed perfect embedded skip lists for quick inverted-index lookups
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.03 |