"On Communication Complexity of Fixed Point Computation."

Anat Ganor, Karthik C. S., Dömötör Pálvölgyi (2021)

> Home

Details and statistics

DOI: 10.1145/3485004

access: closed

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/teco/GanorSP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/teco/GanorSP21
Anat Ganor, Karthik C. S., Dömötör Pálvölgyi:
On Communication Complexity of Fixed Point Computation. ACM Trans. Economics and Comput. 9(4): 25:1-25:27 (2021)

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.