.png){kind=icon}
Return
FRINGE ANALYSIS REVISITED
.png){kind=icon}
OA
AI
DOI：10.1145/214037.214103.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
AVERAGE CASE ANALYSIS
AVL TREES
B-TREES
RECURRENCE EQUATIONS
MATRIX THEORY
SEARCH TREES
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
28
Papers:
2.5K
Citations:
3.5W
Organization
No organization information available
Cited Papers
ShareSaveEmpowering Hospitalized Patients With Diabetes: Implementation of a Hospital-wide CGM Policy With EHR-Integrated Validation for Dosing Insulin.png)
DIABETES CARE
DIABETES CAREIF16.6
PREAI
ShareSaveHippocampal polyamine levels and transglutaminase activity are paralleling spatial memory retrieval in the C57BL/6J mouseHippocampus
HippocampusIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more