New bounds on optimal binary search trees

New bounds on optimal binary search trees

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.

Bibliographic Details
Main Author:	Harmon, Dion (Dion Kane)
Other Authors:	Erik Demaine.
Format:	Thesis
Language:	eng
Published:	Massachusetts Institute of Technology 2006
Subjects:	Mathematics.
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)

Combining Binary Search Trees
by: Demaine, Erik D., et al.
Published: (2014)

Hardware accelerator for feature matching with binary search tree
by: Thathsara, Miyuru, et al.
Published: (2024)

Competing binary and k-tuple interactions on a Cayley tree of arbitrary order
by: Ganikhodjaev, Nasir, et al.
Published: (2011)

Multi-criteria divisible load scheduling in binary tree network
by: Ghanbari, Shamsollah
Published: (2016)

Modulated phase of a Potts Model with competing binary interactions on a Cayley tree
by: Ganikhodjaev, Nasir, et al.
Published: (2009)

Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds
by: Kim, Beomjoon, et al.
Published: (2022)

Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds
by: Kim, Beomjoon, et al.
Published: (2021)

A Mathematical Study on “Additive Technique” Versus “Branch and Bound Technique” for Solving Binary Programming Problem
by: Sufahani, Suliadi, et al.
Published: (2018)

Optimizing binary trees grown with a sorting algorithm,
by: Martin, William A., et al.
Published: (2009)

The effect of body Image perceptions on subjective wellbeing in adolescent students
by: Goh, Dion Yun Si
Published: (2023)

Behaviors of phase diagrams of Ising model with competing ternary and binary interactions on a Cayley tree of arbitrary order
by: Akin, Hasan, et al.
Published: (2012)

New lower bounds and constructions for binary codes correcting asymmetric errors
by: Fu, Fang-Wei, et al.
Published: (2013)

New bounds on the minimum distance of cyclic codes
by: Ling, San, et al.
Published: (2021)

New bounds for the garden-hose model
by: Klauck, Hartmut, et al.
Published: (2018)

Architecture and optimization for a peer-to-peer content management system
by: Edge, Dion M. (Dion Miguel), 1975-
Published: (2005)

Phase diagrams of an Ising system with competing binary, prolonged ternary and next-nearest interactions on a Cayley tree
by: Ganikhodjaev, Nasir, et al.
Published: (2011)

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences
by: Musthofa, Musthofa, et al.
Published: (2022)

Phase diagram and extreme Gibbs measures of the Ising model on a Cayley tree in the presence of competing binary and ternary interactions
by: Ganikhodjaev, Nasir, et al.
Published: (2011)

Asymptotic improvement of GV bound
by: Yip, Jose Zheng Ho
Published: (2022)

“He looks very real”: media, knowledge, and search-based strategies for deepfake identification
by: Goh, Dion Hoe-Lian
Published: (2024)

Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
by: Das Gupta, Shuvomoy, et al.
Published: (2024)

Distance matrices of trees
by: Collins, Karen L. (Karen Linda)
Published: (2013)

Bounds on extremal functions of forbidden patterns
by: Geneson, Jesse (Jesse T.)
Published: (2015)

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
by: Mohammad Ata, Karimeh Ibrahim, et al.
Published: (2021)

Pattern-avoidance in binary fillings of grid shapes
by: Spiridonov, Alexey
Published: (2010)

Are pay for performance search engines relevant?
by: Goh, Dion Hoe-Lian, et al.
Published: (2010)

Upper bound on list-decoding radius of binary codes
by: Polyanskiy, Yury
Published: (2016)

Upper Bound on List-Decoding Radius of Binary Codes
by: Polyanskiy, Yury
Published: (2019)

Design of interactive learning courseware for binary trees
by: He, Shiyu
Published: (2020)

Counting elliptic curves of bounded Faltings height
by: Hortsch, Ruthi
Published: (2016)

Homogenization and bounds for multiscale problems
by: Ang, Eng Hong
Published: (2020)

Upper Bounds on Number of Steals in Rooted Trees
by: Leiserson, Charles E., et al.
Published: (2016)

Bayesian Detection in Bounded Height Tree Networks
by: Tay, Wee Peng, et al.
Published: (2010)

Computational experiments for local search algorithms for binary and mixed integer optimization
by: Zhou, Jingting, S.M. Massachusetts Institute of Technology
Published: (2011)

A new binary particle swarm optimizer to select a smaller subset of genes for leukaemia cancer classification
by: Mohamad, Mohd. Saberi, et al.
Published: (2008)

On equivalence relations and bounded turing degrees
by: Yu, Hongyuan
Published: (2018)

Improving a bounding result for weakly-scattered theories
by: Goddard, Christina M. (Christina Margaret)
Published: (2006)

On connected sub-tree of Cayley tree of order 2 with fixed nodes
by: Mukhamedov, Farrukh, et al.
Published: (2013)

Probability theory on Galton-Watson trees
by: Perlin, Alex, 1974-
Published: (2005)