Sciweavers

FOCS
1998
IEEE
13 years 12 months ago
Approximating a Finite Metric by a Small Number of Tree Metrics
Moses Charikar, Chandra Chekuri, Ashish Goel, Sudi...
FOCS
1998
IEEE
13 years 12 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin
FOCS
1998
IEEE
13 years 12 months ago
Pattern Matching for Spatial Point Sets
David E. Cardoze, Leonard J. Schulman
FOCS
1998
IEEE
13 years 12 months ago
Oblivious Transfer with a Memory-Bounded Receiver
Christian Cachin, Claude Crépeau, Julien Ma...
FOCS
1998
IEEE
13 years 12 months ago
Information Retrieval on the Web
Andrei Z. Broder, Monika Rauch Henzinger
FOCS
1998
IEEE
13 years 12 months ago
On Learning Monotone Boolean Functions
Avrim Blum, Carl Burch, John Langford
FOCS
1998
IEEE
13 years 12 months ago
Time-Space Tradeoffs for Branching Programs
Paul Beame, Michael E. Saks, Jayram S. Thathachar
FOCS
1998
IEEE
13 years 12 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 12 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...