Searching rigid data structures

DOI10.1007/BFB0030864MaRDI QIDQ6085739zbMATH OpenFDO

Authors Svante Carlsson, Jingsen Chen

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0030864

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Searching ordered structures
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Self-Organizing Heuristics for Implicit Data Structures
• An implicit data structure for searching a multikey table in logarithmic time
• An efficient implicit data structure for relation testing and searching in partially ordered sets

Cites work

• A data structure for manipulating priority queues
• A decomposition theorem for partially ordered sets
• Efficient searching using partial ordering
• scientific article; zbMATH DE number 3711361 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Implementation and Analysis of Binomial Queue Algorithms
• Implicit data structures for fast search and update
• Min-max heaps and generalized priority queues
• Searching ordered structures

Cited in

(2)

• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Static data structure lower bounds imply rigidity

This page was built for publication: Searching rigid data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085739)