<--- Back to Details
First PageDocument Content
Probability and statistics / Chernoff bound / Random walk / Randomized algorithm / Network theory / Combinatorics / Probability theory / Statistics / Probabilistic complexity theory
Date: 2013-05-08 06:41:05
Probability 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 Pietracaprina

Add to Reading List

Source URL: www.albertopettarin.it

Download Document from Source Website

File Size: 176,37 KB

Share Document on Facebook

Similar Documents

PDF Document

DocID: 1x4cn - View Document

PDF Document

DocID: 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 Japan

DocID: 1v3E5 - View Document

Capacity of the range of random walk on Zd Amine Asselah ∗ Bruno Schapira†

DocID: 1uWqU - View Document