Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 Bauwens__2023
%A Bauwens\ast, Bruno
%A Zimand, Marius
%D 2023
%I Association for Computing Machinery (ACM)
%J Journal of the ACM
%K acm compression proof software
%N 2
%P 1--33
%R 10.1145/3575807
%T Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time
%U https://doi.org/10.1145%2F3575807
%V 70
@article{Bauwens__2023,
added-at = {2023-03-31T22:23:24.000+0200},
author = {Bauwens{\ast}, Bruno and Zimand, Marius},
biburl = {https://www.bibsonomy.org/bibtex/2d4aea806df9c510272f289d06c0b7f57/nathanclayton},
description = {Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time | Journal of the ACM},
doi = {10.1145/3575807},
interhash = {968685420d304dc6bf56328194a6edcb},
intrahash = {d4aea806df9c510272f289d06c0b7f57},
journal = {Journal of the {ACM}},
keywords = {acm compression proof software},
month = mar,
number = 2,
pages = {1--33},
publisher = {Association for Computing Machinery ({ACM})},
timestamp = {2023-03-31T22:23:24.000+0200},
title = {Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time},
url = {https://doi.org/10.1145%2F3575807},
volume = 70,
year = 2023
}
