Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
From MaRDI portal
Recommendations
Cited in
(14)- An improved scheme for set equality testing and updating
- EXPtime tableaux for ALC
- Dynamic and internal longest common substring
- Representing sets with constant time equality testing
- Equality testing for complex objects based on hashing
- scientific article; zbMATH DE number 1003252 (Why is no real title available?)
- Longest common substring made fully dynamic
- Representation transformations of ordered lists
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- A textbook solution for dynamic strings
- Minimizing tardy processing time on a single machine in near-linear time
- Minimizing tardy processing time on a single machine in near-linear time
- A textbook solution for dynamic strings
- B-treaps revised: write efficient randomized block search trees with high load
This page was built for publication: Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286226)