On dynamic bit-probe complexity

Theoretical Computer Science

Volumn 380, Issue 1-2, 2007, Pages 127-142

  Pa ̌traşcu, Mihai ^a   Tarniţa ̌, Corina E ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Bit probe complexity; Cell probe complexity; Lower bounds

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS; PROBLEM SOLVING;

BIT PROBE COMPLEXITY; CELL PROBE COMPLEXITY; LOWER BOUNDS;

DATA STRUCTURES;

EID: 34248531127     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.058     Document Type: Article

References (11)

1. Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Marked ancestor problems, in: Proc. 39th IEEE Symposium on Foundations of Computer Science, FOCS, 1998, pp. 534-543
2. Arge L. The buffer tree: A technique for designing batched external data structures. Algorithmica 37 1 (2003) 1-24 See also WADS'95
3. Frandsen G.S., Miltersen P.B., and Skyum S. Dynamic word problems. Journal of the ACM 44 2 (1997) 257-271 See also FOCS'93
4. Fredman M.L. The complexity of maintaining an array and computing its partial sums. Journal of the ACM 29 1 (1982) 250-260
5. Michael L. Fredman, Michael E. Saks, The cell probe complexity of dynamic data structures, in: Proc. 21st ACM Symposium on Theory of Computing, STOC, 1989, pp. 345-354
6. Krohn K., and Rhodes J. Algebraic theory of machines I. Prime decomposition theorem for finite semigroups and machines. Transactions of the American Mathematical Society 116 (1965) 450-464
7. Peter Bro Miltersen, Cell probe complexity - a survey, in: 19th Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 1999. Advances in Data Structures Workshop
8. Christian Worm Mortensen, Rasmus Pagh, Mihai Pa ̌traşcu, On dynamic range reporting in one dimension, in: Proc. 37th ACM Symposium on Theory of Computing, STOC, 2005, pp. 104-111
9. Miltersen P.B., Subramanian S., Vitter J.S., and Tamassia R. Complexity models for incremental computation. Theoretical Computer Science 130 1 (1994) 203-236 See also STACS'93
10. Pa ̌traşcu M., and Demaine E.D. Logarithmic lower bounds in the cell-probe model. SIAM Journal on Computing 35 4 (2006) 932-963 See also SODA'04 and STOC'04
11. Mikkel Thorup, Near-optimal fully-dynamic graph connectivity, in: Proc. 32nd ACM Symposium on Theory of Computing STOC, 2000, pp. 343-350