Sciweavers

FOCS
2005
IEEE
13 years 9 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
FOCS
2005
IEEE
13 years 9 months ago
Approximation Algorithms for Scheduling on Multiple Machines
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
FOCS
2005
IEEE
13 years 9 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
FOCS
2005
IEEE
13 years 9 months ago
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
Jon M. Kleinberg
FOCS
2005
IEEE
13 years 9 months ago
Nonembeddability theorems via Fourier analysis
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 ...
Subhash Khot, Assaf Naor
FOCS
2005
IEEE
13 years 9 months ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ...
Anna R. Karlin, David Kempe, Tami Tamir
FOCS
2005
IEEE
13 years 9 months ago
Agnostically Learning Halfspaces
Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour...
FOCS
2005
IEEE
13 years 9 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
FOCS
2005
IEEE
13 years 9 months ago
On the Impossibility of Obfuscation with Auxiliary Input
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
Shafi Goldwasser, Yael Tauman Kalai
FOCS
2005
IEEE
13 years 9 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit