Some Results for Elementary Operations
From MaRDI portal
Publication:3644718
DOI10.1007/978-3-642-03456-5_8zbMath1258.68044OpenAlexW1508391504MaRDI QIDQ3644718
Publication date: 12 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_8
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space-optimal hidden line elimination for rectangles
- Reflected min-Max heaps
- Maintaining order in a generalized linked list
- A log log n data structure for three-sided range queries
- Making data structures persistent
- Space reduction and an extension for a hidden line elimination algorithm
- On the average number of rebalancing operations in weight-balanced trees
- A new data structure for representing sorted lists
- The space-optimal version of a known rectangle enclosure reporting algorithm
- The temporal precedence problem
- A new algorithm for rectangle enclosure reporting
- A simple optimal solution for the temporal precedence problem on pure pointer machines
- A space efficient variant of path copying for partially persistent sorted sets
- The nearest common ancestor in a dynamic tree
- An optimal algorithm for reporting visible rectangles
- Optimal solutions for the temporal precedence problem
- Computing rectangle enclosures
- Algorithms for extracting motifs from biological weighted sequences
- Algorithms for three-dimensional dominance searching in linear space.
- Dynamic interpolation search
- Fast Algorithms for Finding Nearest Common Ancestors
- Improving the performance of multidimensional search using fingers
- On Dominance Reporting in 3D
- Dynamic Interpolation Search Revisited
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- AVL-trees for localized search
- An Amortized Analysis of Insertions into AVL-Trees
- A locally adaptive data compression scheme
- Design and Analysis of a Data Structure for Representing Sorted Lists
- An improved algorithm for the rectangle enclosure problem
- The Rectangle Enclosure and Point-Dominance Problems Revisited
- THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
- Binary Search Trees of Bounded Balance
- Algorithms - ESA 2003
- Algorithms and Computation
- Optimal finger search trees in the pointer machine
