15 citations · 73 across the 25 of their papers we have counts for
24 papers · 1 filter
Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
Reza Hosseini Dolatabadi, Mordedcai J. Golin, Arian Zamani
The problem of constructing optimal AIFV codes is a special case of that of constructing minimum cost Markov Chains. This paper provides the first complete proof of correctness for…
A (Weakly) Polynomial Algorithm for AIVF Coding
Reza Hosseini Dolatabadi, Mordecai J. Golin, Arian Zamani
It is possible to improve upon Tunstall coding using a collection of multiple parse trees. The best such results so far are Iwata and Yamamoto's maximum cost AIVF codes. The most e…
Fully Dynamic -Center in Low Dimensions via Approximate Furthest Neighbors
Jinxiang Gan, Mordecai Jay Golin
Let be a set of points in some metric space. The approximate furthest neighbor problem is, given a second point set to find a point that is a approximate…
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons
Marek Chrobak, Mordecai Golin, J. Ian Munro +1
Search trees are commonly used to implement access operations to a set of stored keys. If this set is static and the probabilities of membership queries are known in advance, then…
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons
Marek Chrobak, Mordecai Golin, J. Ian Munro +1
We present a simple -time algorithm for computing optimal search trees with two-way comparisons. The only previous solution to this problem, by Anderson et al., has the sam…
Speeding up the AIFV- dynamic programs by two orders of magnitude using Range Minimum Queries
Mordecai Golin, Elfarouk Harb
AIFV- codes are a new method for constructing lossless codes for memoryless sources that provide better worst-case redundancy than Huffman codes. They do this by using two code…