An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Regular Article: Efficient rebalancing of chromatic search trees
Proceedings of the 30th IEEE symposium on Foundations of computer science
Deleting Keys of B-trees in Parallel
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Data Structures for Maintaining Set Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Search Trees with Relaxed Balance and Near-Optimal Height
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A New Method for Balancing Binary Search Trees
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Complexity of Layered Binary Search Trees with Relaxed Balance
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Complexity of Rebalancing a Binary Serach Tree
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Three-Dimensional Layers of Maxima
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Group Updates for Red-Black Trees
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
State Space Construction and Steady--State Solution of GSPNs on a Shared--Memory Multiprocessor
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
Binary Search in a Multiprocessing Environment
IEEE Transactions on Computers
An Efficient Implementation of Search Trees on [lg N + 1] Processors
IEEE Transactions on Computers
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An O(n2.75) algorithm for incremental topological ordering
ACM Transactions on Algorithms (TALG)
Approximate colored range and point enclosure queries
Journal of Discrete Algorithms
Effective splaying with restricted rotations
International Journal of Computer Mathematics
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Online reorganization of databases
ACM Computing Surveys (CSUR)
A Distribution-Sensitive Dictionary with Low Space Overhead
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
ACM Transactions on Algorithms (TALG)
A practical concurrent binary search tree
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
An Empirical Study of Structural Constraint Solving Techniques
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Deletion without Rebalancing in Multiway Search Trees
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Purely functional 1-2 brother trees
Journal of Functional Programming
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Matchete: paths through the pattern matching jungle
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Efficient cache design for solid-state drives
Proceedings of the 7th ACM international conference on Computing frontiers
Parallelization of bulk operations for STL dictionaries
Euro-Par'07 Proceedings of the 2007 conference on Parallel processing
Extending INET framework for directional and asymmetrical wireless communications
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Non-blocking binary search trees
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
The performance of the Haskell containers package
Proceedings of the third ACM Haskell symposium on Haskell
Deletion without rebalancing in balanced binary trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
Skip lift: a probabilistic alternative to red-black trees
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Human-centered visualization environments
Human-centered visualization environments
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
Automatic fine-grain locking using shape properties
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
A distribution-sensitive dictionary with low space overhead
Journal of Discrete Algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Approximate colored range queries
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A speculation-friendly binary search tree
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
An O(log log n)-competitive binary search tree with optimal worst-case access times
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Non-blocking k-ary search trees
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Formalized verification of snapshotable trees: separation and sharing
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Skip lift: A probabilistic alternative to red-black trees
Journal of Discrete Algorithms
Reduced split/merge propagation in a modified B-link tree design
Journal of Computational Methods in Sciences and Engineering
SIAM Journal on Computing
Incrementally maintaining run-length encoded attributes in column stores
Proceedings of the 16th International Database Engineering & Applications Sysmposium
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Adams' trees revisited: correctness proof and efficient implementation
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Breaking the MapReduce stage barrier
Cluster Computing
Fibonacci BSTs: A new balancing method for binary search trees
Theoretical Computer Science
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints
Engineering Applications of Artificial Intelligence
A contention-friendly binary search tree
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Deletion without rebalancing in multiway search trees
ACM Transactions on Database Systems (TODS)
A general technique for non-blocking trees
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
An efficient and secure approach for a cloud collaborative editing
Journal of Network and Computer Applications
A Parallel Data Distribution Management Algorithm
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
Compressive sensing and adaptive direct sampling in hyperspectral imaging
Digital Signal Processing
| Hi-index | 0.01 |
In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.