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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Hirotada Kobayashi' in GoogleThis author has not been identified. Look up 'Keiji Matsumoto' in GoogleThis author has not been identified. Look up 'Seiichiro Tani' in Google

runs on WebDSL