Sciweavers

STOC
2006
ACM
107views Algorithms» more  STOC 2006»
14 years 11 months ago
Truthful randomized mechanisms for combinatorial auctions
Shahar Dobzinski, Noam Nisan, Michael Schapira
STOC
2006
ACM
95views Algorithms» more  STOC 2006»
14 years 11 months ago
Conditional hardness for approximate coloring
Irit Dinur, Elchanan Mossel, Oded Regev
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 11 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 11 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
STOC
2006
ACM
57views Algorithms» more  STOC 2006»
14 years 11 months ago
Integrality gaps for sparsest cut and minimum linear arrangement problems
Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 11 months ago
Online trading algorithms and robust option pricing
In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...
Peter DeMarzo, Ilan Kremer, Yishay Mansour
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 11 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 11 months ago
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, Christo...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 11 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 11 months ago
Hardness of cut problems in directed graphs
Julia Chuzhoy, Sanjeev Khanna