Faster deterministic gossiping in directed ad hoc radio networks

L Gąsieniec, T Radzik, Q Xin - … Theory, Humlebæk, Denmark, July 8-10 …, 2004 - Springer
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n 4/3 log 4 …
被引用次数：55 相关文章

[引用][C] Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gasieniec, T Radzik, Q Xin - Algorithm Theory-SWAT 2004, 9th …, 2004 - kclpure.kcl.ac.uk
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks — King's College London
Skip to main navigation Skip to search Skip to main content King's College London Home …
[PDF] academia.edu

[PDF][PDF] Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gasieniec, T Radzik, Q Xin - Algorithm Theory–SWAT 2004 - academia.edu
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n4/3 log4 n) …

Faster deterministic gossiping in directed ad hoc radio networks

L Ga̧sieniec, T Radzik, Q Xin - Lecture Notes in …, 2004 - augusta.elsevierpure.com
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n 4/3 log 4 …

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gasieniec, T Radzik, Q Xin - Algorithm Theory-SWAT 2004: 9th …, 2004 - books.google.com
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n4/3 log4 n) …

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gąsieniec, T Radzik, Q Xin - Algorithm Theory-SWAT 2004 - infona.pl
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n 4/3log4 n) …

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gasieniec, T Radzik, Q Xin - Algorithm Theory–SWAT 2004 - Springer
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n 4/3 log 4 …
[PDF] uib.no

[PDF][PDF] Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gasieniec, T Radzik, Q Xin - ii.uib.no
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n4/3 log 4 …

[引用][C] Faster deterministic gossiping in directed ad hoc radio networks

L GASIENIEC, T RADZIK… - Lecture notes in computer …, 2004 - pascal-francis.inist.fr
Faster deterministic gossiping in directed ad hoc radio networks CNRS Inist Pascal-Francis
CNRS Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
[PDF] researchgate.net

[PDF][PDF] Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

L Gasieniec, T Radzik, Q Xin - researchgate.net
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n4/3 log 4 …