First Page | Document Content | |
---|---|---|
Date: 2013-05-08 06:41:05Probability and statistics Chernoff bound Random walk Randomized algorithm Network theory Combinatorics Probability theory Statistics Probabilistic complexity theory | Tight Bounds on Information Dissemination ∗ in Sparse Mobile Networks Alberto Pettarin Andrea PietracaprinaAdd to Reading ListSource URL: www.albertopettarin.itDownload Document from Source WebsiteFile Size: 176,37 KBShare Document on Facebook |
PDF DocumentDocID: 1x4cn - View Document | |
PDF DocumentDocID: 1vLnJ - View Document | |
(第15回国際放散虫研究集会) October 20 – November 1, 2017 Second Circular (2nd edition) (First edition)DocID: 1vmfT - View Document | |
The 15th Meeting of the International Association of Radiolarists Niigata University JapanDocID: 1v3E5 - View Document | |
Capacity of the range of random walk on Zd Amine Asselah ∗ Bruno Schapira†DocID: 1uWqU - View Document |