메뉴 건너뛰기




Volumn 36, Issue 1, 2003, Pages 93-96

An O(n1.5) deterministic gossiping algorithm for radio networks

Author keywords

Deterministic algorithm; Gossiping; Radio network

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; RADIO BROADCASTING; TOPOLOGY;

EID: 0345656721     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-1010-5     Document Type: Article
Times cited : (35)

References (5)
  • 1
    • 0037205804 scopus 로고    scopus 로고
    • On adaptive deterministic gossiping in ad hoc radio networks
    • L. Gasieniec and A. Lingas, On adaptive deterministic gossiping in ad hoc radio networks, Inform. Process. Lett., 2 (2002), 89-93.
    • (2002) Inform. Process. Lett. , vol.2 , pp. 89-93
    • Gasieniec, L.1    Lingas, A.2
  • 4
    • 0037962389 scopus 로고    scopus 로고
    • Explicit constructions of selectors and related combinatorial structures with applications
    • P. Indyk, Explicit constructions of selectors and related combinatorial structures with applications, in Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 697-703.
    • Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002 , pp. 697-703
    • Indyk, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.