54 citations · 165 across the 36 of their papers we have counts for
36 papers · 1 filter
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
Mateusz Basiak, Marcin Bienkowski, Martin Böhm +4
We consider the List Update problem where the cost of each swap is assumed to be 1. This is in contrast to the ``standard'' model, in which an algorithm is allowed to swap the requ…
Structural Properties of Search Trees with 2-way Comparisons
Sunny Atalig, Marek Chrobak, Erfan Mousavian +2
Optimal 3-way comparison search trees (3WCST's) can be computed using standard dynamic programming in time O(n^3), and this can be further improved to O(n^2) by taking advantage of…
Classification via Two-Way Comparisons
Marek Chrobak, Neal E. Young
Given a weighted, ordered query set and a partition of into classes, we study the problem of computing a minimum-cost decision tree that, given any query in , uses e…
Online Paging with Heterogeneous Cache Slots
Marek Chrobak, Samuel Haney, Mehraneh Liaee +4
It is natural to generalize the online -Server problem by allowing each request to specify not only a point , but also a subset of servers that may serve it. For uniform…
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…