Data structures and network algorithms
Data structures and network algorithms
Planar point location using persistent search trees
Communications of the ACM
Tree rebalancing in optimal time and space
Communications of the ACM
Concurrency control in database structures with relaxed balance
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
On-the-fly optimization of data structures
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Relaxed multi-way trees with group updates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A new method for updating and rebalancing tree-type main memory dictionaries
Nordic Journal of Computing
Search Trees with Relaxed Balance and Near-Optimal Height
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Complexity of Layered Binary Search Trees with Relaxed Balance
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Automatic fine-grain locking using shape properties
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
A speculation-friendly binary search tree
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Concurrent operations of O2-tree on shared memory multicore architectures
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
A contention-friendly binary search tree
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |