Back to Results
First PageMeta Content
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

Document Date: 2013-05-08 06:41:05


Open Document

File Size: 176,37 KB

Share Result on Facebook

City

Berlin / Padova / Boston / San Jose / /

Company

Oxford University Press / Vehicular Networks / Cambridge University Press / /

Country

United States / Italy / /

Currency

USD / /

/

Event

Person Communication and Meetings / /

Facility

Brown University / Information Engineering University of Padova Padova / University of Padova / /

IndustryTerm

by-product / mobile ad-hoc networks / wireless epidemic / opportunistic networks / energy consumption / opportunistic forwarding algorithms / sensor networks / ad hoc wireless networks / sparse systems / Energy-efficient computing / transportation scientists / subway networks / static communication networks / analytical tools / social networks / mobile computing devices / mobile social networks / random predator-prey systems / Wireless Networks / mobile systems / /

Movie

From now on / /

Organization

Cambridge University / Information Engineering University of Padova Padova / Brown University / Department of Computer Science / Italy Department / Sparse Mobile Networks Alberto Pettarin Andrea Pietracaprina Geppino Pucci Department / Oxford University / Department of Computer Science Brown University Providence / University of Padova / /

Person

Eli Upfal / Aldo Gini / Andrea Clementi / I. As / Riccardo Silvestri / Jeff Steif / /

Position

first author / General / /

ProvinceOrState

California / /

Technology

mobile computing / opportunistic forwarding algorithms / /

SocialTag