Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
9 years 4 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
9 years 4 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright
STOC
2012
ACM
243views Algorithms» more  STOC 2012»
9 years 4 months ago
Budget feasible mechanism design: from prior-free to bayesian
Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu
STOC
2012
ACM
203views Algorithms» more  STOC 2012»
9 years 4 months ago
Fast matrix rank algorithms and applications
Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
9 years 4 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
9 years 4 months ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
9 years 4 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
9 years 4 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
books