{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:08Z","timestamp":1742596808438,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_43","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:11:09Z","timestamp":1330258269000},"page":"517-526","source":"Crossref","is-referenced-by-count":0,"title":["On the communication complexity of parallel computation"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[]},{"given":"Nicholas","family":"Tr\u00e2n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"A. V. Aho, J. D. Ullman, and M. Yannakakis, On notions of information transfer in VLSI circuits, in Proc. 15th Symp. on Theory of Computing, ACM, 1983, pp. 133\u2013138.","DOI":"10.1145\/800061.808742"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity theory (preliminary version), in Proc. 27th Ann. Symp. on Foundations of Computer Science, IEEE, 1986, pp. 337\u2013347.","DOI":"10.1109\/SFCS.1986.15"},{"key":"43_CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. K. Kozen, and J. Stockmeyer, Alternation, J. ACM, 28 (1981), pp. 114\u2013133.","journal-title":"J. ACM"},{"key":"43_CR4","unstructured":"W. D. Hillis, The Connection Machine, PhD thesis, Massachusetts Institute of Technology, 1985."},{"key":"43_CR5","volume-title":"tech. report","author":"J. Hromkovic","year":"1989","unstructured":"J. Hromkovic, J. Karhum\u00e4ki, B. Rovan, and A. Slobodov\u00e1, On the power of synchronization in parallel computations, tech. report, Comenius University, Bratislava, Czechoslovakia, 1989."},{"key":"43_CR6","unstructured":"J. Hromkovic, How to organize the communication among parallel processes in alternating computations. Manuscript, January 1986."},{"key":"43_CR7","volume-title":"tech. report","author":"J. Hromkovi\u010d","year":"1989","unstructured":"J. Hromkovi\u010d, B. Rovan, and A. Slobodov\u00e1, Deterministic versus nondeterministic space in terms of synchronized alternating machines, tech. report, Comenius University, Bratislava, Czechoslovakia, 1989."},{"key":"43_CR8","first-page":"126","volume-title":"Lecture Notes in Computer Science 623","author":"O. H. Ibarra","year":"1992","unstructured":"O. H. Ibarra and N. Q. Tran, New results concerning synchronized finite automata, in Proc. 19th ICALP, Vienna 1992, Lecture Notes in Computer Science 623, Springer-Verlag, 1992, pp. 126\u2013137."},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(92)90351-F","volume":"99","author":"O. H. Ibarra","year":"1992","unstructured":"-, On space-bounded synchronized alternating Turing machines, Theoretical Computer Science, 99 (1992), pp. 243\u2013264.","journal-title":"Theoretical Computer Science"},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(88)90122-3","volume":"61","author":"K. N. King","year":"1988","unstructured":"K. N. King, Alternating multihead finite automata, Theoretical Computer Science, 61 (1988), pp. 149\u2013174.","journal-title":"Theoretical Computer Science"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao, Some complexity questions related to distributed computing, in Proc. 11th Symp. on Theory of Computing, ACM, 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:00:54Z","timestamp":1742594454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}