A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jan K. Pachl, Ephraim Korach, Doron Rotem. A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 5-7 May 1982, San Francisco, California, USA. pages 378-382, ACM, 1982.

This author has not been identified. Look up 'Jan K. Pachl' in GoogleThis author has not been identified. Look up 'Ephraim Korach' in GoogleThis author has not been identified. Look up 'Doron Rotem' in Google

runs on WebDSL