Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani. Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. In Srikanta Tirthapura, Lorenzo Alvisi, editors, Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. pages 334-335, ACM, 2009. [doi]
@inproceedings{KobayashiMT09,
title = {Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks},
author = {Hirotada Kobayashi and Keiji Matsumoto and Seiichiro Tani},
year = {2009},
doi = {10.1145/1582716.1582796},
url = {http://doi.acm.org/10.1145/1582716.1582796},
researchr = {https://researchr.org/publication/KobayashiMT09},
cites = {0},
citedby = {0},
pages = {334-335},
booktitle = {Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009},
editor = {Srikanta Tirthapura and Lorenzo Alvisi},
publisher = {ACM},
isbn = {978-1-60558-396-9},
}