Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/imc/LegoutUM06
%A Legout, Arnaud
%A Urvoy-Keller, Guillaume
%A Michiardi, Pietro
%B Internet Measurement Conference
%D 2006
%E Almeida, Jussara M.
%E Almeida, Virgílio A. F.
%E Barford, Paul
%I ACM
%K dblp
%P 203-216
%T Rarest first and choke algorithms are enough.
%U http://dblp.uni-trier.de/db/conf/imc/imc2006.html#LegoutUM06
%@ 1-59593-561-4
@inproceedings{conf/imc/LegoutUM06,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Legout, Arnaud and Urvoy-Keller, Guillaume and Michiardi, Pietro},
biburl = {https://www.bibsonomy.org/bibtex/2c3a856201e5748c37e71e7208cc20d95/dblp},
booktitle = {Internet Measurement Conference},
crossref = {conf/imc/2006},
editor = {Almeida, Jussara M. and Almeida, Virgílio A. F. and Barford, Paul},
ee = {https://doi.org/10.1145/1177080.1177106},
interhash = {76834e5040ae54256fb2502120c41cdf},
intrahash = {c3a856201e5748c37e71e7208cc20d95},
isbn = {1-59593-561-4},
keywords = {dblp},
pages = {203-216},
publisher = {ACM},
timestamp = {2018-11-07T14:46:25.000+0100},
title = {Rarest first and choke algorithms are enough.},
url = {http://dblp.uni-trier.de/db/conf/imc/imc2006.html#LegoutUM06},
year = 2006
}