15 citations · 73 across the 25 of their papers we have counts for
30 papers
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…
The Markov-Chain Polytope with Applications
Mordecai J. Golin, Albert John Lalim Patupat
This paper addresses the problem of finding a minimum-cost -state Markov chain in a large set of chains. The chains studied have a reward associated with…
Fair -Center: a Coreset Approach in Low Dimensions
Jinxiang Gan, Mordecai Golin, Zonghan Yang +1
Center-based clustering techniques are fundamental in some areas of machine learning such as data summarization. Generic -center algorithms can produce biased cluster representa…
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…