An implicit data structure for searching a multikey table in logarithmic time
From MaRDI portal
Recommendations
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- scientific article; zbMATH DE number 2079398
- An efficient implicit data structure for relation testing and searching in partially ordered sets
- scientific article; zbMATH DE number 140496
- A tradeoff between search and update time for the implicit dictionary problem
- scientific article; zbMATH DE number 3956454
- On the optimal time/space tradeoff for hash tables
- Implicit \(B\)-trees: A new data structure for the dictionary problem
Cites work
- A tradeoff between search and update time for the implicit dictionary problem
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- Implicit data structures for fast search and update
- Multidimensional binary search trees used for associative searching
- On Edge Coloring Bipartite Graphs
- On Representatives of Subsets
- Partial match retrieval in implicit data structures
- Storing a sparse table
- Using euler partitions to edge color bipartite multigraphs
Cited in
(9)- scientific article; zbMATH DE number 3990869 (Why is no real title available?)
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- A bounded-space tree traversal algorithm
- Modified binary searching for static tables
- Searching rigid data structures
- Implicit data structures for linear hashing schemes
- On-the-fly array initialization in less space
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- scientific article; zbMATH DE number 1629858 (Why is no real title available?)
This page was built for publication: An implicit data structure for searching a multikey table in logarithmic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186547)
