An efficient implicit data structure for relation testing and searching in partially ordered sets
From MaRDI portal
Publication:2366649
DOI10.1007/BF01990341zbMath0771.68063WikidataQ59256054 ScholiaQ59256054MaRDI QIDQ2366649
Maurizio Talamo, Giorgio Gambosi, Marco Protasi
Publication date: 30 August 1993
Published in: BIT (Search for Journal in Brave)
Cites Work
- Unnamed Item
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Partial match retrieval in implicit data structures
- On locally presented posets
- A tradeoff between search and update time for the implicit dictionary problem
- Implicit data structures for fast search and update
- A pointer-free data structure for merging heaps and min-max heaps
- Min-max heaps and generalized priority queues
- Implicit Data Structures for the Dictionary Problem
- Implicat Representation of Graphs
- Partially Ordered Sets