Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

RANDOM
2001
Springer

favoriteEmaildiscussreport

143views Theoretical Computer Science» more RANDOM 2001»

On Computing Ad-hoc Selective Families

13 years 8 months ago

On Computing Ad-hoc Selective Families

Download www.dia.unisa.it

Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo

Real-time Traffic

RANDOM 2001 | Theoretical Computer Science |

claim paper

Related Content

» A Family of EncounterBased Broadcast Protocols for Mobile AdHoc Networks

» Selection of Repetition Codes for MAC in Vehicular Ad Hoc Networks

» Limited flooding protocol for mobile ad hoc networks

» Path set selection in mobile ad hoc networks

» Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

» Foundations of Security for Hash Chains in Ad Hoc Networks

» Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson

» Parameterized Verification of Ad Hoc Networks

» Defending against cache consistency attacks in wireless ad hoc networks

» On the Connectivity of BluetoothBased Ad Hoc Networks

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	RANDOM
Authors	Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri

Comments (0)