"Lower Bounds for Distributed Maximum-Finding Algorithms."

Jan K. Pachl, Ephraim Korach, Doron Rotem (1984)

> Home

Details and statistics

DOI: 10.1145/1634.1889

access: closed

type: Journal Article

metadata version: 2018-11-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/PachlKR84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/PachlKR84
Jan K. Pachl, Ephraim Korach, Doron Rotem:
Lower Bounds for Distributed Maximum-Finding Algorithms. J. ACM 31(4): 905-918 (1984)

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.