Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
- 1 February 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (1) , 24-44
- https://doi.org/10.1137/s0097539790189733
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Faster uniquely represented dictionariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Lower Bounds for Accessing Binary Search Trees with RotationsSIAM Journal on Computing, 1989
- Making data structures persistentJournal of Computer and System Sciences, 1989
- Rotation distance, triangulations, and hyperbolic geometryJournal of the American Mathematical Society, 1988
- Self-adjusting binary search treesJournal of the ACM, 1985
- New trie data structures which support very fast search operationsJournal of Computer and System Sciences, 1984
- A note on some tree similarity measuresInformation Processing Letters, 1982
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- Implicit data structures for fast search and updateJournal of Computer and System Sciences, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979