"The Time Complexity of Consensus Under Oblivious Message Adversaries."

Kyrill Winkler et al. (2024)

> Home

Details and statistics

DOI: 10.1007/S00453-024-01209-4

access: open

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/WinklerPGSS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/WinklerPGSS24
Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica 86(6): 1830-1861 (2024)

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.