133 search results - page 7 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
101
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
115
click to vote
PODS
2005
ACM
15 years 11 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
STOC
2004
ACM
15 years 12 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
ECCC
2010
14 years 11 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...