Reversal complexity revisited

Theoretical Computer Science

Volumn 401, Issue 1-3, 2008, Pages 191-205

  Hernich, André ^a   Schweikardt, Nicole ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Hierarchies of complexity classes; Reversal bounded and space bounded Turing machines

Indexed keywords

COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; DATA PROCESSING; ELECTRIC POWER GENERATION; MATHEMATICAL MODELS; MICROFLUIDICS; NUMERICAL METHODS; PAPER; QUERY PROCESSING; SETTLING TANKS; SORTING; TECHNOLOGY; TURING MACHINES;

(ALGORITHMIC) COMPLEXITY; (SPM) CLASSES; CIRCUIT COMPLEXITY; COMPLEXITY CLASSES; COMPUTATION MODELS; ELSEVIER (CO); EXTERNAL MEMORIES; INTERNAL MEMORY; LOWER BOUNDS; PAPER ADDRESSES; QUERY EVALUATION; RANDOM ACCESS; RESOURCE BOUNDED; SET EQUALITY; STRUCTURAL COMPLEXITY;

DATA STORAGE EQUIPMENT;

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

References (24)

1. Balcázar J.L., Díaz J., and Gabarró J. Structural Complexity II (1990), Springer-Verlag
2. Balcázar J.L., Díaz J., and Gabarró J. Structural Complexity I. 2nd ed. (1995), Springer-Verlag
3. Beame P., Jayram T.S., and Rudra A. Lower bounds for randomized read/write stream algorithms. Proc. STOC'07 (2007), ACM 689-698
4. Chen J., and Yap C.-K. Reversal complexity. SIAM Journal on Computing 20 4 (1991) 622-638
5. A. Durand, C. Lautemann, M. More, Counting results in weak formalisms, Technical Report 1998-14, Université de Caen, France, 1998
6. Fagin R., Klawe M., Pippenger N., and Stockmeyer L. Bounded depth, polynomial size circuits for symmetric functions. Theoretical Computer Science 36 (1985) 239-250
7. Grohe M., Hernich A., and Schweikardt N. Randomized computations on large data sets: Tight lower bounds. Proc. PODS'06 (2006), ACM Press 243-252
8. Grohe M., Koch C., and Schweikardt N. The complexity of querying external memory and streaming data. Proc. FCT'05. Lecture Notes in Computer Science vol. 3623 (2005) 1-16
9. Grohe M., Koch C., and Schweikardt N. Tight lower bounds for query processing on streaming and external memory data. Theoretical Computer Science 380 1-2 (2007) 199-217
10. Grohe M., and Schweikardt N. Lower bounds for sorting with few random accesses to external memory. Proc. PODS'05 (2005), ACM Press 238-249
11. Immerman N. Expressibility and parallel complexity. SIAM Journal on Computing 18 (1989) 625-638
12. Immerman N. Descriptive Complexity (1998), Springer-Verlag
13. Liśkiewicz M. On the relationship between deterministic time and deterministic reversal. Information Processing Letters 45 3 (1993) 143-146
14. In: Meyer U., Sanders P., and Sibeyn J.F. (Eds). Algorithms for Memory Hierarchies. Lecture Notes in Computer Science vol. 2625 (2003), Springer-Verlag
15. Nisan N., and Wigderson A. Rounds in communication complexity revisited. SIAM Journal on Computing 22 1 (1993) 211-219
16. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
17. Parberry I. An improved simulation of space and reversal bounded deterministic turing machines by width and depth bounded uniform circuits. Information Processing Letters 24 6 (1987) 363-367
18. Parberry I. A note on nondeterminism in small, fast parallel computers. IEEE Transactions on Computers 38 5 (1989) 766-767
19. N. Pippenger, On simultaneous resource bounds, in: Proc. FOCS'79, 1979, pp. 307-311
20. Savitch W.J. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and Systems Sciences 4 (1970) 177-192
21. Schweikardt N. Machine models and lower bounds for query processing. Proc. PODS'07 (2005), ACM Press 41-52
22. Vitter J.F. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33 (2001) 209-271
23. Wagner K., and Wechsung G. Computational Complexity (1986), VEB Deutscher Verlag der Wissenschaften
24. Yao A.C.C. Some complexity questions related to distributive computing. Proc. STOC'79 (1979), ACM Press 209-213