Sciweavers

FOCS
1998
IEEE
13 years 9 months ago
On Learning Monotone Boolean Functions
Avrim Blum, Carl Burch, John Langford
FOCS
1998
IEEE
13 years 9 months ago
Time-Space Tradeoffs for Branching Programs
Paul Beame, Michael E. Saks, Jayram S. Thathachar
FOCS
1998
IEEE
13 years 9 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
FOCS
1998
IEEE
13 years 9 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm...
FOCS
1998
IEEE
13 years 9 months ago
Marked Ancestor Problems
Stephen Alstrup, Thore Husfeldt, Theis Rauhe
FOCS
1998
IEEE
13 years 9 months ago
Parametric and Kinetic Minimum Spanning Trees
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
FOCS
1998
IEEE
13 years 9 months ago
Concurrent Reachability Games
Luca de Alfaro, Thomas A. Henzinger, Orna Kupferma...
FOCS
1998
IEEE
13 years 9 months ago
Delayed Information and Action in On-line Algorithms
Susanne Albers, Moses Charikar, Michael Mitzenmach...