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

DOI10.1007/978-3-031-38906-1_43MaRDI QIDQ6139049zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning

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

functionaldata structurespersistencepoint location

Mathematics Subject Classification ID

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

Cites work

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

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)