返回
摘要
En 中文
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.
Keyword:
AVERAGE CASE ANALYSIS
AVL TREES
B-TREES
RECURRENCE EQUATIONS
MATRIX THEORY
SEARCH TREES
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
28
论文数:
2.5K
被引数:
3.5W
机构
暂无机构信息
引用论文
Empowering Hospitalized Patients With Diabetes: Implementation of a Hospital-wide CGM Policy With EHR-Integrated Validation for Dosing Insulin
DIABETES CARE
IF16.6
Hippocampal polyamine levels and transglutaminase activity are paralleling spatial memory retrieval in the C57BL/6J mouse
Hippocampus
IF0

