Self-adjusting binary search trees
Journal of the ACM (JACM)
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of Parallel and Distributed Computing
Parallel approximation algorithms for bin packing
Information and Computation
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Optimal merging and sorting on the EREW PRAM
Information Processing Letters
Sublinear merging and natural merge sort
SIGAL '90 Proceedings of the international symposium on Algorithms
A skip list cookbook
Algorithms in C
Time-Space Optimal Parallel Merging and Sorting
IEEE Transactions on Computers
Maintaining dynamic ordered sets on processor networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Maintaining B-trees on an EREW PRAM
Journal of Parallel and Distributed Computing
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Fully dynamic search trees for an extension of the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Parallel Dictionaries in 2-3 Trees
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Space-Efficient Parallel Merging
PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe
Undo facilities for the extended z-buffer in NC machining simulation
Computers in Industry
The chilling descent: making the transition to a conventional curriculum
Proceedings of the 2008 international workshop on Functional and declarative programming in education
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Fast set intersection in memory
Proceedings of the VLDB Endowment
Sal/Svm: an assembly language and virtual machine for computing with non-enumerated sets
Virtual Machines and Intermediate Languages
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
Faster upper bounding of intersection sizes
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |