New bounds on optimal binary search trees
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.
Main Author: | Harmon, Dion (Dion Kane) |
---|---|
Other Authors: | Erik Demaine. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/34268 |
Similar Items
-
Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees
by: Bayer, Paul J.
Published: (2023) -
The height of q-Binary Search Trees
by: Michael Drmota, et al.
Published: (2002-01-01) -
New Hopf Structures on Binary Trees
by: Stefan Forcey, et al.
Published: (2009-01-01) -
Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees
by: Charles Knessl
Published: (2003-01-01) -
Anti‐collision algorithm based on slotted random regressive‐style binary search tree in RFID technology
by: Yibo Ai, et al.
Published: (2022-06-01)