Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
From MaRDI portal
Publication:5725054
DOI10.1145/321105.321108zbMath0116.09410DBLPjournals/jacm/Hibbard62OpenAlexW2097327103WikidataQ56688555 ScholiaQ56688555MaRDI QIDQ5725054
Publication date: 1962
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321105.321108
Related Items (25)
A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION ⋮ Efficient sample sort and the average case analysis of PEsort ⋮ On file structuring for non-uniform access frequencies ⋮ A trivial algorithm whose analysis is not: a continuation ⋮ Expected Costs in Some Classes of Binary Search Trees ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ Analysis of the standard deletion algorithms in exact fit domain binary search trees ⋮ Order preserving extendible hashing and bucket tries ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms ⋮ Sequence search trees: Their analysis using recurrence relations ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ The total path length of split trees ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Deletions in random binary search trees: a story of errors ⋮ Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires ⋮ Optimal binary search trees ⋮ ASA-graphs for efficient data representation and processing ⋮ A method for constructing binary search trees by making insertions at the root ⋮ A trivial algorithm whose analysis isn't ⋮ Randomness Preserving Deletions on Special Binary Search Trees ⋮ Optimum binary search trees ⋮ The properties of random trees ⋮ A note on growing binary trees ⋮ On the average internal path length of m-ary search trees
This page was built for publication: Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
