ON SIMULTANEOUS RESOURCE BOUNDS.

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1979, Pages 307-311

  Pippenger, Nicholas ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EID: 0018729222     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1979.29     Document Type: Conference Paper

References (13)

1. Κ. E. Batcher Sorting Networks and Their Applications SJCC 32 307 314 1968
2. A. B. Borodin On Relating Time and Space to Size and Depth SIAM J. Comp. 6 733 744 1977
3. S. A. Cook Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space STOC 11 338 345 1979
4. F. C. Hennie R. F. Stearns Two-Tape Simulation of Multitape Turing Machines J.ACM 13 533 546 1966
5. R. F. Ladner M. J. Fischer Parallel Prefix Computation ICPP 218 223 ICPP 1977
6. Y.. P. Ofman On the Algorithmic Complexity of Discrete Functions Sov. Phys. Dokl. 7 589 591 1963
7. N. J. Pippenger Fast Simulation of Combinational Logic Networks by Machines without Random-Access Storage Allerton Conf. on Comm. Contr. and Comp. 15 25 33 Allerton Conf. on Comm. Contr. and Comp. 1977
8. N. J. Pippenger M. J. Fischer Relations among Complexity Measures J.ACM 26 361 381 1979
9. W. L. Ruzzo Tree-Size Bounded Alternation STOC 11 352 359 1979
10. W. L. Ruzzo On Uniform Circuit Complexity these proceedings these proceedings
11. C. P. Schnorr The Network Complexity and the Turing Machine Complexity of Finite Functions Acta Inf. 7 95 107 1976
12. H. S. Stone Parallel Processing with the Perfect Shuffle IEEE Trans. on Comp. 20 153 161 1971