STOC 2012 - PDF Preprint Papers

STOC 2012 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2012 Paper

click to vote

STOC
2012
ACM

272views Algorithms» more STOC 2012»

The cell probe complexity of dynamic range counting

11 years 7 months ago

Download www.madalgo.au.dk

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	272	The cell probe complexity of dynamic range counting	claim
2	256	Competitive contagion in networks	claim
3	251	Minimax option pricing meets black-scholes in the limit	claim
4	243	Budget feasible mechanism design: from prior-free to bayesian	claim
5	242	Separating multilinear branching programs and formulas	claim
6	236	On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption	claim
7	227	Approximation algorithms and hardness of integral concurrent flow	claim
8	225	An algorithmic characterization of multi-dimensional mechanisms	claim
9	222	An analysis of one-dimensional schelling segregation	claim
10	221	From query complexity to computational complexity	claim
11	219	Prior-free auctions with ordered bidders	claim
12	217	Tight lower bounds for the online labeling problem	claim
13	209	Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces	claim
14	203	Fast matrix rank algorithms and applications	claim
15	201	From irreducible representations to locally decodable codes	claim
16	200	The freezing threshold for k-colourings of a random graph	claim
17	199	Routing in undirected graphs with constant congestion	claim
18	197	Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates	claim
19	196	Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space	claim
20	193	A new point of NP-hardness for unique games	claim
21	192	Nearly optimal sparse fourier transform	claim
22	185	Subspace evasive sets	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers