External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract)

Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari. On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). In Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa, editors, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings. Volume 8327 of Lecture Notes in Computer Science, pages 235-245, Springer, 2014. [doi]

Authors

Allyx Fontaine

This author has not been identified. Look up 'Allyx Fontaine' in Google

Yves Métivier

This author has not been identified. Look up 'Yves Métivier' in Google

John Michael Robson

This author has not been identified. Look up 'John Michael Robson' in Google

Akka Zemmari

This author has not been identified. Look up 'Akka Zemmari' in Google
runs on