Space-efficient functional offline-partially-persistent trees with applications to planar point location
From MaRDI portal
Publication:6139049
DOI10.1007/978-3-031-38906-1_43OpenAlexW4385367259MaRDI QIDQ6139049FDOQ6139049
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning, Jens Kristian Refsgaard Schou
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_43
Cites Work
- Symmetric binary B-trees: Data structure and maintenance algorithms
- The design of dynamic data structures
- Title not available (Why is that?)
- Optimal Search in Planar Subdivisions
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Making data structures persistent
- Optimal Point Location in a Monotone Subdivision
- Topological sorting of large networks
- Multidimensional Searching Problems
- Red-black trees in a functional setting
- Purely Functional Data Structures
- Title not available (Why is that?)
- Can programming be liberated from the von Neumann style?
- Amortized Computational Complexity
- Optimal purely functional priority queues
- Title not available (Why is that?)
- Searching and storing similar lists
- Amortized rotation cost in AVL trees
- Confluently Persistent Deques via Data-Structural Bootstrapping
- Confluently Persistent Tries for Efficient Version Control
This page was built for publication: Space-efficient functional offline-partially-persistent trees with applications to planar point location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139049)
