Metraipolis › archive › dc_ff996c4b209c

Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems — Europe PMC PMID:36359705

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/36359705
DOI
10.3390/e24111611
License (as archived)
solo-consultazione
Archived
2026-10-08T02:27:21.013Z
SHA-256 of the archived text
2af7ccfc62d9921f25c635f906c8728d953ec092ce9cba39b083cf7336fe8f62
Stable URL of this page
https://metraipolis.com/documento/dc_ff996c4b209c

How to cite

Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems — Europe PMC PMID:36359705 — Europe PMC (en), https://europepmc.org/article/MED/36359705 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_ff996c4b209c (Metraipolis archive dc_ff996c4b209c, sha256 2af7ccfc62d9921f25c635f906c8728d953ec092ce9cba39b083cf7336fe8f62)
BibTeX
@misc{dcff996c4b209c,
  title = {Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems — Europe PMC PMID:36359705},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/36359705},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_ff996c4b209c; sha256 2af7ccfc62d9921f25c635f906c8728d953ec092ce9cba39b083cf7336fe8f62},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/36359705. Agents can read the archived copy with the MCP tool read_document.