596 citations · 3k across the 50 of their papers we have counts for
3 papers · 2 filters
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…
Distributed algorithms for covering, packing and maximum weighted matching
Christos Koufogiannakis, Neal E. Young
This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Coveri…