Sciweavers

STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 2 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
128
Voted
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
13 years 2 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
13 years 2 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
243views Algorithms» more  STOC 2012»
13 years 2 months ago
Budget feasible mechanism design: from prior-free to bayesian
Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
13 years 2 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 ...
Algorithms
Top of PageReset Settings