596 citations · 3k across the 50 of their papers we have counts for
51 papers
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…
Competitive Data-Structure Dynamization
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young +1
Data-structure dynamization is a general approach for making static data structures dynamic. It is used extensively in geometric settings and in the guise of so-called merge (or co…
Algorithmic approaches to selecting control clones in DNA array hybridization experiments
Qi Fu, Elizabeth Bent, James Borneman +2
We study the problem of selecting control clones in DNA array hybridization experiments. The problem arises in the OFRG method for analyzing microbial communities. The OFRG method…