Data structures and network algorithms
Data structures and network algorithms
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Planar point location using persistent search trees
Communications of the ACM
Hash functions for priority queues
Information and Control
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Probabilistic analysis of algorithms
Probabilistic analysis of algorithms
A balanced search tree with O(1) worst case update time
Acta Informatica
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Introduction to algorithms
More efficient bottom-up tree pattern matching
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
A constant update time finger search tree
ICCI'90 Proceedings of the international conference on Advances in computing and information
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Pattern matching in dynamic texts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Partially persistent data structures of bounded degree with constant update time
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Time and Space Efficient Multi-method Dispatching
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Exponentially Decreasing Number of Operations in Balanced Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Three-Dimensional Layers of Maxima
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Purely functional worst case constant time catenable sorted lists
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Near real-time suffix tree construction via the fringe marked ancestor problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
Distance histogram computation based on spatiotemporal uniformity in scientific data
Proceedings of the 15th International Conference on Extending Database Technology
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.00 |