STOC   2012 Annual ACM Symposium on Theory of Computing
Wall of Fame | Most Viewed STOC-2012 Paper
272views Algorithms» more  STOC 2012»
9 years 9 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
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.
1Download preprint from source272
2Download preprint from source256
3Download preprint from source251
4Download preprint from source243
5Download preprint from source242
6Download preprint from source236
7Download preprint from source227
8Download preprint from source225
9Download preprint from source222
10Download preprint from source221
11Download preprint from source219
12Download preprint from source217
13Download preprint from source209
14Download preprint from source203
15Download preprint from source201
16Download preprint from source200
17Download preprint from source199
18Download preprint from source197
19Download preprint from source196
20Download preprint from source193
21Download preprint from source192
22Download preprint from source185