131 search results - page 18 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
100
click to vote
SIROCCO
2004
15 years 1 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
100
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
191
click to vote
ICDT
2009
ACM
16 years 11 days ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
111
Voted
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...