The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Deletion in binary storage trees.
Deletion in binary storage trees.
On uniquely represented data strauctures
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We introduce a notion of integrated cost of a dictionary, as average cost of sequences of search, insert and delete operations. We express generating functions of these sequences in terms of continued fractions; from this we derive an explicit integral expression of integrated costs for three common representations of dictionaries.