MFCS 1986
Developing Implicit Data Structures
Abstract
Abstract We present a new, and basically simple, algorithm for maintaining a structure supporting insert, delete and search in O(log 2 n ) with no storage requirements other than that of the data itself.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Symposium on Mathematical Foundations of Computer Science
- Archive span
- 1973-2025
- Indexed papers
- 3045
- Paper id
- 74856374705458980