
A Simple Algorithm for Optimal Search Trees with TwoWay Comparisons
We present a simple O(n^4)time algorithm for computing optimal search t...
read it

On the Cost of Unsuccessful Searches in Search Trees with Twoway Comparisons
Search trees are commonly used to implement access operations to a set o...
read it

Speeding up the AIFV2 dynamic programs by two orders of magnitude using Range Minimum Queries
AIFV2 codes are a new method for constructing lossless codes for memory...
read it

Polynomial Time Algorithms for Constructing Optimal Binary AIFV2 Codes
Huffman Codes are optimal Instantaneous FixedtoVariable (FV) codes in ...
read it

Minmax Regret for sink location on paths with general capacities
In dynamic flow networks, every vertex starts with items (flow) that nee...
read it

On Huang and Wong's Algorithm for Generalized Binary Split Trees
Huang and Wong [5] proposed a polynomialtime dynamicprogramming algori...
read it

Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions
The Maximal points in a set S are those that aren't dominated by any o...
read it

Dynamic Trees with AlmostOptimal Access Cost
An optimal binary search tree for an access sequence on elements is a st...
read it
Mordecai Golin
is this you? claim profile