The analysis of heuristics for search trees
- 1 March 1993
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 30 (3) , 233-248
- https://doi.org/10.1007/bf01179372
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fringe analysis for Extquick: Anin situ distributive external sorting algorithmInformation and Computation, 1991
- Improving time and space efficiency in generalized binary search treesActa Informatica, 1987
- The analysis of a fringe heuristic for binary search treesJournal of Algorithms, 1985
- Fault tolerance and storage reduction in binary search treesInformation and Control, 1984
- Non-negative Matrices and Markov ChainsPublished by Springer Nature ,1981
- Advanced CombinatoricsPublished by Springer Nature ,1974
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966
- On the field of combinatory analysisAmerican Mathematical Society Translations: Series 2, 1962
- The Theory of Matrices. By F R. Gantmacher. Two volumes, pp. 374 and 276. 1959. (Translated from the Russian by K. A. Hirsch; Chelsea Publishing Company, New York)The Mathematical Gazette, 1961