Self-adjusting binary search trees
Journal of the ACM (JACM)
Introduction to algorithms
Inside Windows NT
A comparison of tree-balancing algorithms
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
An empirical evaluation of algorithms for dynamically maintaining binary search trees
ACM '80 Proceedings of the ACM 1980 annual conference
Improving height-balance in search trees: center versus root, radius versus height
ECC'09 Proceedings of the 3rd international conference on European computing conference
Efficient license validation in MPML DRM architecture
Proceedings of the nineth ACM workshop on Digital rights management
A practical concurrent binary search tree
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
An efficient access control method for multimedia social networks
Proceedings of second ACM SIGMM workshop on Social media
vIOMMU: efficient IOMMU emulation
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Comparative performance evaluation of the AVL and red-black trees
Proceedings of the Fifth Balkan Conference in Informatics
Practical concurrent binary search trees via logical ordering
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |