"Communication Efficient Algorithms for Bounding and Approximating the ..."

Amit Shahar, Yuval Alfassi, Daniel Keren (2022)

> Home

Details and statistics

DOI: 10.3390/E24111611

access: open

type: Journal Article

metadata version: 2022-11-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entropy/ShaharAK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/ShaharAK22
Amit Shahar, Yuval Alfassi, Daniel Keren:
Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems. Entropy 24(11): 1611 (2022)

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.