![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/isit/GadouleauR11
@inproceedings{DBLP:conf/isit/GadouleauR11, author = {Maximilien Gadouleau and S{\o}ren Riis}, editor = {Alexander Kuleshov and Vladimir M. Blinovsky and Anthony Ephremides}, title = {Max-flow min-cut theorem for R{\'{e}}nyi entropy in communication networks}, booktitle = {2011 {IEEE} International Symposium on Information Theory Proceedings, {ISIT} 2011, St. Petersburg, Russia, July 31 - August 5, 2011}, pages = {603--607}, publisher = {{IEEE}}, year = {2011}, url = {https://doi.org/10.1109/ISIT.2011.6034200}, doi = {10.1109/ISIT.2011.6034200}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/GadouleauR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.