"On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic ..."

Allyx Fontaine et al. (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-04298-5_21

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/FontaineMRZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/FontaineMRZ14
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). SOFSEM 2014: 235-245

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.