Andrei A. Muchnik, Nikolai K. Vereshchagin. Shannon Entropy vs. Kolmogorov Complexity. In Dima Grigoriev, John Harrison, Edward A. Hirsch, editors, Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings. Volume 3967 of Lecture Notes in Computer Science, pages 281-291, Springer, 2006. [doi]
@inproceedings{MuchnikV06,
title = {Shannon Entropy vs. Kolmogorov Complexity},
author = {Andrei A. Muchnik and Nikolai K. Vereshchagin},
year = {2006},
doi = {10.1007/11753728_29},
url = {http://dx.doi.org/10.1007/11753728_29},
tags = {Kolmogorov complexity},
researchr = {https://researchr.org/publication/MuchnikV06},
cites = {0},
citedby = {0},
pages = {281-291},
booktitle = {Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings},
editor = {Dima Grigoriev and John Harrison and Edward A. Hirsch},
volume = {3967},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-34166-8},
}