Sciweavers

Share
JACM
2006
72views more  JACM 2006»
9 years 10 months ago
Dependent rounding and its applications to approximation algorithms
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasara...
JACM
2006
92views more  JACM 2006»
9 years 10 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie
JACM
2006
134views more  JACM 2006»
9 years 10 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
JACM
2006
93views more  JACM 2006»
9 years 10 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
JACM
2006
98views more  JACM 2006»
9 years 10 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
JACM
2006
112views more  JACM 2006»
9 years 10 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
JACM
2006
99views more  JACM 2006»
9 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JACM
2006
146views more  JACM 2006»
9 years 10 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
JACM
2006
69views more  JACM 2006»
9 years 10 months ago
Hidden word statistics
Philippe Flajolet, Wojciech Szpankowski, Brigitte ...
books