{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T01:10:37Z","timestamp":1772068237433,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_12","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Sauerhoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"H. Abelson. Lower bounds on information transfer in distributed computations. In Proc. of 19th IEEE Symp. on Foundations of Computer Science (FOCS), 151\u2013158, 1978.","DOI":"10.1109\/SFCS.1978.22"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-63165-8_177","volume-title":"Proc. of 24th Int. Coll. on Automata, Languages, and Programming (ICALP)","author":"F. Ablayev","year":"1997","unstructured":"F. Ablayev. Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams. In Proc. of 24th Int. Coll. on Automata, Languages, and Programming (ICALP), LNCS 1256, 195\u2013202. Springer, 1997."},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-61440-0_141","volume-title":"Proc. of 23rd Int. Coll. on Automata, Languages, and Programming (ICALP)","author":"F. Ablayev","year":"1996","unstructured":"F. Ablayev and M. Karpinski. On the power of randomized branching programs. In Proc. of 23rd Int. Coll. on Automata, Languages, and Programming (ICALP), LNCS 1099, 348\u2013356. Springer, 1996."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0022-0000(88)90002-5","volume":"37","author":"N. Alon","year":"1988","unstructured":"N. Alon and W. Maass. Meanders and their applications in lower bounds arguments. Journal of Computer and System Sciences, 37:118\u2013129, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs. Journal of Computer and System Sciences, 45:204\u2013232, 1992.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s002240000128","volume":"32","author":"B. Bollig","year":"1999","unstructured":"B. Bollig and I. Wegener. Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams. Theory of Computing Systems, 32:487\u2013503, 1999. (Earlier version in Proc. of 22nd Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS 1295, 159\u2013168. Springer, 1997.)","journal-title":"Theory of Computing Systems"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01200118","volume":"3","author":"R. Canetti","year":"1993","unstructured":"R. Canetti and O. Goldreich. Bounds on tradeoffs between randomness and communication complexity. Computational Complexity, 3:141\u2013167, 1993.","journal-title":"Computational Complexity"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/inco.1993.1034","volume":"104","author":"P. \u010euri\u0161","year":"1993","unstructured":"P. \u010euri\u0161 and Z. Galil. On the power of multiple reads in a chip. Information and Computation, 104:277\u2013287, 1993.","journal-title":"Information and Computation"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"P. \u010euri\u0161, Z. Galil, and G. Schnitger. Lower bounds on communication complexity. In Proc. of 16th Ann. ACM Symp. on Theory of Computing (STOC), 81\u201391, 1984.","DOI":"10.1145\/800057.808668"},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BFb0023453","volume-title":"Proc. of 14th Ann. Symp. on Theoretical Aspects of Computer Science (STACS)","author":"P. \u010euri\u0161","year":"1997","unstructured":"P. \u010euri\u0161, J. Hromkovi\u010d, J. D. P. Rolim, and G. Schnitger. Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. In Proc. of 14th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), LNCS 1200, 117\u2013128. Springer, 1997. To appear in Information and Computation."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1995.1011","volume":"116","author":"R. Fleischer","year":"1995","unstructured":"R. Fleischer, H. Jung, and K. Mehlhorn. A communication-randomness tradeoff for two-processor systems. Information and Computation, 116:155\u2013161, 1995.","journal-title":"Information and Computation"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0020-0190(94)00094-8","volume":"51","author":"J. Gergov","year":"1994","unstructured":"J. Gergov. Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines. Information Processing Letters, 51:265\u2013269, 1994.","journal-title":"Information Processing Letters"},{"key":"12_CR13","volume-title":"EATCS Texts in Theoretical Computer Science","author":"J. Hromkovi\u010d","year":"1997","unstructured":"J. Hromkovi\u010d. Communication Complexity and Parallel Computing. EATCS Texts in Theoretical Computer Science. Springer, Berlin, 1997."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d and G. Schnitger. Nondeterministic communication with a limited number of advice bits. In Proc. of 28th Ann. ACM Symp. on Theory of Computing (STOC), 551\u2013560, 1996.","DOI":"10.1145\/237814.238003"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1051\/ita:1999113","volume":"33","author":"J. Hromkovi\u010d","year":"1999","unstructured":"J. Hromkovi\u010d. Communication complexity and lower bounds on multilective computations. Theoretical Informatics and Applications (RAIRO), 33:193\u2013212, 1999.","journal-title":"Theoretical Informatics and Applications (RAIRO)"},{"key":"12_CR16","unstructured":"J. Jain, J. Bitner, J. A. Abraham, and D. S. Fussell. Functional partitioning for verification and related problems. In T. Knight and J. Savage, editors, Advanced Research in VLSI and Parallel Systems: Proceedings of the 1992 Brown\/MIT Conference, 210\u2013226, 1992."},{"key":"12_CR17","first-page":"22","volume":"5","author":"S. P. Jukna","year":"1987","unstructured":"S. P. Jukna. Lower bounds on communication complexity. Mathematical Logic and Its Applications, 5:22\u201330, 1987.","journal-title":"Mathematical Logic and Its Applications"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90072-A","volume":"91","author":"M. Krause","year":"1991","unstructured":"M. Krause. Lower bounds for depth-restricted branching programs. Information and Computation, 91(1):1\u201314, Mar. 1991.","journal-title":"Information and Computation"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0890-5401(91)90039-5","volume":"94","author":"M. Krause","year":"1991","unstructured":"M. Krause and S. Waack. On oblivious branching programs of linear length. Information and Computation, 94:232\u2013249, 1991.","journal-title":"Information and Computation"},{"key":"12_CR20","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1051\/ita\/1988220404471","volume":"22","author":"K. Kriegel","year":"1988","unstructured":"K. Kriegel and S. Waack. Lower bounds on the complexity of real-time branching programs. Theoretical Informatics and Applications (RAIRO), 22:447\u2013459, 1988.","journal-title":"Theoretical Informatics and Applications (RAIRO)"},{"key":"12_CR21","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997."},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn and E. Schmidt. Las-Vegas is better than determinism in VLSI and distributed computing. In Proc. of 14th Ann. ACM Symp. on Theory of Computing (STOC), 330\u2013337, 1982.","DOI":"10.1145\/800070.802208"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39:67\u201371, 1991.","journal-title":"Information Processing Letters"},{"key":"12_CR24","volume-title":"Complexity Theoretical Results for Randomized Branching Programs","author":"M. Sauerhoff","year":"1999","unstructured":"M. Sauerhoff. Complexity Theoretical Results for Randomized Branching Programs. PhD thesis, Univ. of Dortmund. Shaker, 1999."},{"key":"12_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/3-540-49116-3_46","volume-title":"Proc. of 16th Ann. Symp. on Theoretical Aspects of Computer Science (STACS)","author":"M. Sauerhoff","year":"1999","unstructured":"M. Sauerhoff. On the size of randomized OBDDs and read-once branching programs for k-stable functions. In Proc. of 16th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), LNCS 1563, 488\u2013499. Springer, 1999."},{"key":"12_CR26","unstructured":"M. Sauerhoff. Computing with restricted nondeterminism: The dependence of the OBDD size on the number of nondeterministic variables. To appear in Proc. of FST & TCS."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987.","DOI":"10.1007\/3-540-18170-9_185"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"I. Wegener. Branching Programs and Binary Decision Diagrams\u2014Theory and Applications. Monographs on Discrete and Applied Mathematics. SIAM, 1999. To appear.","DOI":"10.1137\/1.9780898719789"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Some complexity questions related to distributive computing. In Proc. of 11th Ann. ACM Symp. on Theory of Computing (STOC), 209\u2013213, 1979.","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T13:08:46Z","timestamp":1578488926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_12"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}