On the study data structures: Binary tournaments with repeated keys
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 466-477
- https://doi.org/10.1007/bfb0036930
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systemsRAIRO. Informatique théorique, 1982
- Quicksort with Equal KeysSIAM Journal on Computing, 1977
- An Analysis of Binary Search Trees Formed from Sequences of Nondistinct KeysJournal of the ACM, 1976