Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.