Sciweavers

STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 12 months ago
Approximation techniques for utilitarian mechanism design
Patrick Briest, Piotr Krysta, Berthold Vöckin...
STOC
2005
ACM
85views Algorithms» more  STOC 2005»
14 years 12 months ago
Tree-walking automata do not recognize all regular languages
Mikolaj Bojanczyk, Thomas Colcombet
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 12 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
STOC
2005
ACM
97views Algorithms» more  STOC 2005»
14 years 12 months ago
Fast quantum byzantine agreement
Michael Ben-Or, Avinatan Hassidim
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 12 months ago
Computing the first Betti number and the connected components of semi-algebraic sets
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi...
Saugata Basu, Richard Pollack, Marie-Franço...
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 12 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 12 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 12 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
STOC
2005
ACM
118views Algorithms» more  STOC 2005»
14 years 12 months ago
Euclidean distortion and the sparsest cut
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
Sanjeev Arora, James R. Lee, Assaf Naor