Some average measures in m-ary search trees
Information Processing Letters
The algebraic eigenvalue problem
The algebraic eigenvalue problem
Expected behaviour of B+-trees under random insertions
Acta Informatica
Modeling splits in file structures
Acta Informatica
Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An adaptive overflow technique for B-trees (extended abstract)
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
A dynamic storage allocation algorithm suitable for file structures
Information Systems
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Performance analysis of file organizations that use multi-bucket data leaves
Information Processing Letters
Fringe analysis for Extquick: an in situ distributive external sorting algorithm
Information and Computation
Average case analysis of algorithms using matrix recurrences
ICCI'90 Proceedings of the international conference on Advances in computing and information
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Height balance distribution of search trees
Information Processing Letters
Unbalanced multiway trees improved by partial expansions
Acta Informatica
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
ACM Transactions on Database Systems (TODS)
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
Approaches to Concurrency in B-Trees
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Efficient Text Searching of Regular Expressions (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
The fringe analysis of search trees
The fringe analysis of search trees
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
IEEE Transactions on Knowledge and Data Engineering
Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees
Theoretical Computer Science
| Hi-index | 0.00 |
Fringe analysis is a technique used to study the average behavior of search trees. In this paper we survey the main results regarding this technique, and we improve a previous asymptotic theorem. At the same time, we present new developments and applications of the theory that allow improvements in several bounds on the behavior of search trees. Our examples cover binary search trees, AVL-trees, 2–3 trees, and B-trees.