"On the Communication Complexity of Strong Time-Optimal Distributed Algorithms."

Stefan Dobrev, Peter Ruzicka (1998)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2004-01-14

- no documents available
- export record
  dblp key:
  - journals/njc/DobrevR98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/njc/DobrevR98
Stefan Dobrev, Peter Ruzicka:
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. Nord. J. Comput. 5(2): 87-104 (1998)

a service of

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.