Self-adjusting binary search trees
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Optimal state-space lumping in Markov chains
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Sequential access in splay trees takes linear time
- The pairing heap: A new form of self-adjusting heap
- Computing on a free tree via complexity-preserving mappings
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On top-down splaying
- Randomized algorithms for metrical task systems
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Self-adjusting multi-way search trees
- Splaying a search tree in preorder takes linear time
- An introduction to randomized algorithms
- Finding minimum-cost flows by double scaling
- Three priority queue applications revisited
- Maintaining bridge-connected and biconnected components on-line
- A time-efficient, linar-space local similarity algorithm
- On the deque conjecture for the splay algorithm
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- A systematic analysis of splaying
- Unfair problems and randomized algorithms for metrical task systems
- A new algorithm for Jordan sorting: Its average-case analysis
- Manipulating multiple stacks with ordered-heap
- A new representation of binary search trees
- A workbench for computational geometry
- The list update problem and the retrieval of sets
- Linear-time construction of treaps and Cartesian trees
- Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches
- On bicriterion minimal spanning trees: An approximation
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Sharing video on demand
- Heaps and heapsort on secondary storage
- Randomized splay trees: Theoretical and experimental results.
- Sorting signed permutations by reversals, revisited
- A tight amortized bound for path reversal
- Approximation algorithms for the shortest common superstring problem
- On the sequential access theorem and deque conjecture for splay trees
- On list update and work function algorithms.
- Incremental convex planarity testing
- Improving time bounds on maximum generalised flow computations by contracting the network
- Approximate regular expression pattern matching with concave gap penalties
- An exact formula for the move-to-front rule for self-organizing lists
- Randomized search trees
- A priority queue with the time-finger property
- I/O efficient dynamic data structures for longest prefix queries
- Revisiting priority queues for image analysis
- Faster algorithms for stable allocation problems
- Diameter estimates for graph associahedra
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- Demand-aware network designs of bounded degree
- When a dollar makes a BWT
- Towards a real time algorithm for parameterized longest common prefix computation
- The CB tree: a practical concurrent self-adjusting search tree
- Finger search in grammar-compressed strings
- Linking and cutting spanning trees
- Self-adjusting grid networks to minimize expected path length
- Parameterized analysis of paging and list update algorithms
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- A unified access bound on comparison-based dynamic dictionaries
- A direct algorithm for restricted rotation distance
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- On the hierarchy of distribution-sensitive properties for data structures
- Arboral satisfaction: recognition and LP approximation
- A study on splay trees
- Better analysis of binary search tree on decomposable sequences
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
- Layered working-set trees
- Local properties of geometric graphs
- A note on the parametric maximum flow problem and some related reoptimization issues
- Adaptive sorting: an information theoretic perspective
- The cost of offline binary search tree algorithms and the complexity of the request sequence
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- Efficient algorithms for online decision problems
- The inverse Voronoi problem in graphs. II: Trees
- On list update with locality of reference
- Self-adjusting trees in preactice for large text collections
- Alternatives to splay trees with O( n) worst-case access times
- The impact of communication patterns on distributed self-adjusting binary search tree
- Incremental computing with abstract data structures
- Automatic functional correctness proofs for functional search trees
- De-amortizing binary search trees
- Inorder traversal of splay trees
- A history of distribution-sensitive data structures
- A survey on priority queues
- In pursuit of the dynamic optimality conjecture
- Succinct representations of ordinal trees
- Self-adjusting grid networks to minimize expected path length
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- A self-adjusting data structure for multidimensional point sets
- Amortized complexity verified
- Path balance heuristic for self-adjusting binary search trees
- A linear potential function for pairing heaps
- The violation heap: a relaxed Fibonacci-like heap
- Categorified Reeb graphs
- scientific article; zbMATH DE number 437541 (Why is no real title available?)
- A Distribution-Sensitive Dictionary with Low Space Overhead
- Rank-Sensitive Priority Queues
- Skip-Splay: Toward Achieving the Unified Bound in the BST Model
- scientific article; zbMATH DE number 3883620 (Why is no real title available?)
- scientific article; zbMATH DE number 3845369 (Why is no real title available?)
- Self-Organizing Heuristics for Implicit Data Structures
This page was built for publication: Self-adjusting binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768416)
