( en | de | ru )

 

Disambiguation of "Yao, F. Frances"

Author of the publication

copydeleteadd this publication to your clipboard
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks.

, , , and . MobiHoc, page 25-36. ACM, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yao Yao

Frances Allen

Frances Buttelmann

Frances McGinnity

Daniela Frances

 

Other publications of authors with the same name

Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks., , , , and . INFOCOM, IEEE, (2006)Discrete and continuous min-energy schedules for variable voltage processors., , and . Proc. Natl. Acad. Sci. USA, 103 (11): 3983-3987 (2006)A Note on Universal Composable Zero Knowledge in Common Reference String Model., , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 462-473. Springer, (2007)k-Nearest-Neighbor Clustering and Percolation Theory., and . Algorithmica, 49 (3): 192-211 (2007)Optimal Binary Space Partitions for Orthogonal Objects., and . J. Algorithms, 13 (1): 99-113 (1992)Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs., , and . Algorithmica, 61 (4): 1000-1021 (2011)On the Optimality of Linear Merge., and . SIAM J. Comput., 9 (1): 85-90 (1980)A 3-Space Partition and Its Applications (Extended Abstract). STOC, page 258-263. ACM, (1983)Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 699-709. Springer, (2009)Nearest Neighbors Revisited.. ISA, volume 557 of Lecture Notes in Computer Science, page 283. Springer, (1991)