Sciweavers

STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 11 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 11 months ago
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets
Peter Auer, Philip M. Long, Aravind Srinivasan
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 11 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 11 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
STOC
1997
ACM
82views Algorithms» more  STOC 1997»
13 years 11 months ago
Reducing the Complexity of Reductions
Manindra Agrawal, Eric Allender, Russell Impagliaz...
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
13 years 11 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
13 years 11 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers