{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:12:16Z","timestamp":1784301136186,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642043543","type":"print"},{"value":"9783642043550","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_26","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"243-257","source":"Crossref","is-referenced-by-count":25,"title":["What Can Be Observed Locally?"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Markiewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"481","volume-title":"37 th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Ben-Or","year":"2005","unstructured":"Ben-Or, M., Hassidim, A.: Fast quantum byzantine agreement. In: 37 th Annual ACM Symposium on Theory of Computing (STOC), pp. 481\u2013485. ACM Press, New York (2005)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"30301","DOI":"10.1103\/PhysRevA.64.030301","volume":"64","author":"S.C. Benjamin","year":"2001","unstructured":"Benjamin, S.C., Hayden, P.M.: Multiplayer quantum games. Physical Review A\u00a064(3), 030301 (2001)","journal-title":"Physical Review A"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/18.720553","volume":"44","author":"C.H. Bennett","year":"1998","unstructured":"Bennett, C.H., Shor, P.W.: Quantum information theory. IEEE Transactions on Information Theory\u00a044, 2724\u20132742 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1412700.1412717","volume":"39","author":"A. Broadbent","year":"2008","unstructured":"Broadbent, A., Tapp, A.: Can quantum mechanics help distributed computing? ACM SIGACT News - Distributed Computing Column\u00a039(3), 67\u201376 (2008)","journal-title":"ACM SIGACT News - Distributed Computing Column"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: 30 th Annual ACM Symposium on the Theory of Computing (STOC), pp. 63\u201368 (1998)","DOI":"10.1145\/276698.276713"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1103\/PhysRevA.56.1201","volume":"56","author":"R. Cleve","year":"1997","unstructured":"Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Physical Review A\u00a056(2), 1201\u20131204 (1997)","journal-title":"Physical Review A"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00377-8","volume":"287","author":"R. Wolf de","year":"2002","unstructured":"de Wolf, R.: Quantum communication and complexity. Theoretical Computer Science\u00a0287(1), 337\u2013353 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"12337","DOI":"10.1103\/PhysRevA.75.012337","volume":"75","author":"M.V. Nest den","year":"2007","unstructured":"den Nest, M.V., D\u00fcr, W., Vidal, G., Briegel, H.: Classical simulation versus universality in measurement-based quantum computation. Physical Review A\u00a075(1), 012337 (2007)","journal-title":"Physical Review A"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1412700.1412718","volume":"39","author":"V.S. Denchev","year":"2008","unstructured":"Denchev, V.S., Pandurangan, G.: Distributed quantum computing: A new frontier in distributed systems or science fiction? ACM SIGACT News - Distributed Computing Column\u00a039(3), 77\u201395 (2008)","journal-title":"ACM SIGACT News - Distributed Computing Column"},{"key":"26_CR10","first-page":"273","volume-title":"27 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"B. Derbel","year":"2008","unstructured":"Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: On the locality of distributed sparse spanner construction. In: 27 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 273\u2013282. ACM Press, New York (2008)"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"A400","author":"D. Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London\u00a0A400, 97\u2013117 (1985)","journal-title":"Proceedings of the Royal Society of London"},{"issue":"2","key":"26_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.26421\/QIC6.2-3","volume":"6","author":"E. D\u2019Hondt","year":"2006","unstructured":"D\u2019Hondt, E., Panangaden, P.: The computational power of the W and GHZ states. Quantum Information and Computation\u00a06(2), 173\u2013183 (2006)","journal-title":"Quantum Information and Computation"},{"issue":"11","key":"26_CR13","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","volume":"83","author":"J. Eisert","year":"1999","unstructured":"Eisert, J., Wilkens, M., Lewenstein, M.: Quantum games and quantum strategies. Physical Review Letters\u00a083(11), 3077\u20133080 (1999)","journal-title":"Physical Review Letters"},{"key":"26_CR14","first-page":"195","volume-title":"26 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"M. Elkin","year":"2007","unstructured":"Elkin, M.: A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners. In: 26 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 195\u2013204. ACM Press, New York (2007)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-73420-8_22","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2007","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 231\u2013242. Springer, Heidelberg (2007)"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/1146381.1146410","volume-title":"25 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication tasks. In: 25 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 179\u2013187. ACM Press, New York (2006)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Klasing, R., Kosowski, A., Kuszner, \u0141., Navarra, A.: On the complexity of distributed graph coloring with local minimality constraints. Networks (to appear, 2009)","DOI":"10.1002\/net.20293"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-75142-7_37","volume-title":"Distributed Computing","author":"C. Gavoille","year":"2007","unstructured":"Gavoille, C., Klasing, R., Kosowski, A., Navarra, A.: Brief announcement: On the complexity of distributed greedy coloring. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 482\u2013484. Springer, Heidelberg (2007)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Kosowski, A., Markiewicz, M.: What can be observed locally? Round-based models for quantum distributed computing. Technical report, arXiv: quant-ph\/0903.1133 (2009)","DOI":"10.1007\/978-3-642-04355-0_26"},{"key":"26_CR20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-94-017-0849-4_10","volume-title":"Bell\u2019s Theorem, Quantum Theory, and Conceptions of the Universe","author":"D.M. Greenberger","year":"1989","unstructured":"Greenberger, D.M., Horne, M.A., Zeilinger, A.: Going beyond Bell\u2019s Theorem. In: Bell\u2019s Theorem, Quantum Theory, and Conceptions of the Universe, pp. 69\u201372. Kluwer, Dordrecht (1989)"},{"key":"26_CR21","first-page":"445","volume-title":"27th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"L. Helm","year":"2008","unstructured":"Helm, L.: Brief announcement: Quantum distributed consensus. In: 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), p. 445. ACM Press, New York (2008)"},{"key":"26_CR22","volume-title":"Quantum Information. An Overview","author":"G. Jaeger","year":"2007","unstructured":"Jaeger, G.: Quantum Information. An Overview. Springer, Heidelberg (2007)"},{"key":"26_CR23","unstructured":"Kobayashi, H., Matsumoto, K., Tani, S.: Fast exact quantum leader election on anonymous rings. In: 8 th Asian Conference on Quantum Information Science (AQIS), August 2008, pp. 157\u2013158 (2008)"},{"key":"26_CR24","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/1011767.1011811","volume-title":"23 rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"F. Kuhn","year":"2004","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In. In: 23 rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300\u2013309. ACM Press, New York (2004)"},{"key":"26_CR25","first-page":"331","volume-title":"28 th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"N. Linial","year":"1987","unstructured":"Linial, N.: Distributive graph algorithms - Global solutions from local data. In: 28 th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 331\u2013335. IEEE Computer Society Press, Los Alamitos (1987)"},{"issue":"1","key":"26_CR26","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graphs algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR27","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1997","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1997)"},{"issue":"3","key":"26_CR28","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0404036","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: A lower bound on probabilistic algorithms for distributive ring coloring. SIAM Journal on Discrete Mathematics\u00a04(3), 409\u2013412 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"6","key":"26_CR29","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally. SIAM Journal on Computing\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"26_CR30","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1103\/PhysRevLett.83.436","volume":"83","author":"M. Nielsen","year":"1999","unstructured":"Nielsen, M.: Conditions for a class of entanglement transformations. Physical Review Letters\u00a083(2), 436\u2013439 (1999)","journal-title":"Physical Review Letters"},{"key":"26_CR31","volume-title":"Quantum Computation and Quantum Information","author":"M. Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"5","key":"26_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevA.70.050301","volume":"70","author":"M. Owari","year":"2004","unstructured":"Owari, M., Matsumoto, K., Murao, M.: Entanglement convertibility for infinite-dimensional pure bipartite states. Physical Review A\u00a070(5), 1\u20134 (2004)","journal-title":"Physical Review A"},{"key":"26_CR33","unstructured":"Pal, S.P., Singh, S.K., Kumar, S.: Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks. Technical report, arXiv: quant-ph\/0306195v1 (June 2003)"},{"key":"26_CR34","unstructured":"Pan, J.-W., Chen, Z.-B., \u017bukowski, M., Weinfurter, H., Zeilinger, A.: Multi-photon entanglement and interferometry. Technical report, arXiv: quant-ph\/0805.2853v1 (May 2008)"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Peleg","year":"1999","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 30\u201341. Springer, Heidelberg (1999)"},{"key":"26_CR36","doi-asserted-by":"crossref","unstructured":"Raz, R.: Exponential separation of quantum and classical communication complexity. In: 31 st Annual ACM Symposium on the Theory of Computing (STOC), pp. 358\u2013367 (1999)","DOI":"10.1145\/301250.301343"},{"issue":"5","key":"26_CR37","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR38","unstructured":"Singh, S.K., Kumar, S., Pal, S.P.: Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement. Technical report, arXiv: quant-ph\/0306049v2 (January 2004)"},{"issue":"3","key":"26_CR39","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/333623.333628","volume":"30","author":"A. Ta-Shma","year":"1999","unstructured":"Ta-Shma, A.: Classical versus quantum communication complexity. SIGACT News\u00a030(3), 25\u201334 (1999)","journal-title":"SIGACT News"},{"key":"26_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-31856-9_48","volume-title":"STACS 2005","author":"S. Tani","year":"2005","unstructured":"Tani, S., Kobayashi, H., Matsumoto, K.: Exact quantum algorithms for the leader election problem. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 581\u2013592. Springer, Heidelberg (2005)"},{"key":"26_CR41","unstructured":"\u017bukowski, M.: On Bell\u2019s Theorem, quantum communication, and entanglement detection. In: Foundations of Probability and Physics 5 (August 2008)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:49:22Z","timestamp":1633920562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}