Space-efficient functional offline-partially-persistent trees with applications to planar point location

DOI10.1007/978-3-031-38906-1_43OpenAlexW4385367259MaRDI QIDQ6139049

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

zbMATH Keywords

functionalpersistencedata structurespoint location

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Making data structures persistent
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Topological sorting of large networks
• Confluently Persistent Tries for Efficient Version Control
• Amortized Computational Complexity
• Optimal Point Location in a Monotone Subdivision
• Searching and storing similar lists
• Optimal Search in Planar Subdivisions
• Multidimensional Searching Problems
• Can programming be liberated from the von Neumann style?
• Optimal purely functional priority queues
• Purely Functional Data Structures
• Confluently Persistent Deques via Data-Structural Bootstrapping
• Red-black trees in a functional setting
• Amortized rotation cost in AVL trees

This page was built for publication: Space-efficient functional offline-partially-persistent trees with applications to planar point location