{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:11Z","timestamp":1725516791309},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_19","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"180-190","source":"Crossref","is-referenced-by-count":0,"title":["Multi-party Quantum Communication Complexity with Routed Messages"],"prefix":"10.1007","author":[{"given":"Seiichiro","family":"Tani","sequence":"first","affiliation":[]},{"given":"Masaki","family":"Nakanishi","sequence":"additional","affiliation":[]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4086\/toc.2005.v001a004","volume":"1","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S., Ambainis, A.: Quantum Search of Spatial Regions. Theory of Computing\u00a01, 47\u201379 (2005)","journal-title":"Theory of Computing"},{"issue":"4-5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight Bounds on Quantum Searching. Fortschritte Der Physik\u00a046(4-5), 493\u2013505 (1998)","journal-title":"Fortschritte Der Physik"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum Amplitude Amplification and Estimation. In: Lomonaco Jr., S.J., Brandt, H.E. (eds.) Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Math. Series, vol.305, pp. 53\u201374. AMS (2003)","DOI":"10.1090\/conm\/305\/05215"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/276698.276713","volume-title":"Proc. of 30th Annual ACM Symposium on Theory of Computing (STOC 1998)","author":"H. Buhrman","year":"1998","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. Classical Communication and Computation. In: Proc. of 30th Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 63\u201368. ACM, New York (1998)"},{"issue":"16","key":"19_CR5","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum Fingerprinting. Phys. Rev. Lett.\u00a087(16), 167902 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2000598","volume":"300","author":"P. Frankl","year":"1987","unstructured":"Frankl, P., R\u00f6dl, V.: Forbidden Intersections. Trans. Amer. Math. Soc.\u00a0300(1), 259\u2013286 (1987)","journal-title":"Trans. Amer. Math. Soc."},{"key":"19_CR7","first-page":"516","volume-title":"Proc. of 39th Annual ACM Symposium on Theory of Computing","author":"D. Gavinsky","year":"2007","unstructured":"Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential Separations for One-Way Quantum Communication Complexity, with Applications to Cryptography. In: Proc. of 39th Annual ACM Symposium on Theory of Computing, pp. 516\u2013525. ACM, New York (2007)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/237814.237866","volume-title":"Proc. of 28th Annual ACM Symposium on Theory of Computing (STOC 1996)","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A Fast Quantum Mechanical Algorithm for Database Search. In: Proc. of 28th Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 212\u2013219. ACM, New York (1996)"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The Probabilistic Communication Complexity of Set Intersection. SIAM Journal on Discrete Mathematics\u00a05(4), 545\u2013557 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00224-003-1113-7","volume":"37","author":"H. Klauck","year":"2004","unstructured":"Klauck, H.: On Quantum and Approximate Privacy. Theory of Computing Systems\u00a037, 221\u2013246 (2004)","journal-title":"Theory of Computing Systems"},{"key":"19_CR11","unstructured":"Kremer, I.: Quantum Communication. Master\u2019s thesis, Computer Science Department, The Hebrew University (1995)"},{"key":"19_CR12","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"19_CR13","volume-title":"Introduction to Algorithms","author":"C.E. Leiserson","year":"2001","unstructured":"Leiserson, C.E., Rivest, R.L., Stein, C., Cormen, T.H.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"Newman, I.: Private vs. Common Random Bits in Communication Complexity. Information Processing Letters\u00a039, 67\u201371 (1991)","journal-title":"Information Processing Letters"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1145\/301250.301343","volume-title":"Proc. of 31st Annual ACM Symposium on Theory of Computing (STOC 1999)","author":"R. Raz","year":"1999","unstructured":"Raz, R.: Exponential Separation of Quantum and Classical Communication Complexity. In: Proc. of 31st Annual ACM Symposium on Theory of Computing (STOC 1999), pp. 358\u2013367. ACM, New York (1999)"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1070\/IM2003v067n01ABEH000422","volume":"67","author":"A.A. Razborov","year":"2003","unstructured":"Razborov, A.A.: Quantum Communication Complexity of Symmetric Predicates. Izvestiya Mathematics\u00a067(1), 145\u2013159 (2003)","journal-title":"Izvestiya Mathematics"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/31846.32978","volume":"34","author":"P. Tiwari","year":"1987","unstructured":"Tiwari, P.: Lower Bounds on Communication Complexity in Distributed Computer Networks. Journal of the ACM\u00a034(4), 921\u2013938 (1987)","journal-title":"Journal of the ACM"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some Complexity Questions Related to Distributed Domputing. In: Proc. of 11th Annual ACM Symposium on Theory of Computing, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"19_CR19","first-page":"352","volume-title":"34th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1993)","author":"A.C.-C. Yao","year":"1993","unstructured":"Yao, A.C.-C.: Quantum Circuit Complexity. In: 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1993), pp. 352\u2013361. IEEE, New York (1993)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:02:12Z","timestamp":1605744132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}