Yao, Frances Foong - Department of Computer Science, City University of Hong Kong

Advanced Search

Yao, Frances Foong - Department of Computer Science, City University of Hong Kong

Theoretical Computer Science 407 (2008) 511523 Contents lists available at ScienceDirect
Theoretical Computer Science 381 (2007) 241247 www.elsevier.com/locate/tcs
Approximate Capacity Subregions of Uniform Multihop Wireless Networks
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Maximum Independent Set of Links under Physical Interference Model
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 57, NO. 5, MAY 2009 1433 Asymptotic Critical Transmission Radii for Greedy
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
Theoretical Computer Science 401 (2008) 5261 Contents lists available at ScienceDirect
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor
A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks
Discrete and continuous min-energy schedules for variable voltage processors
http://journals.cambridge.org Downloaded: 04 Apr 2011 IP address: 144.214.120.252 Math. Struct. in Comp. Science (2009), vol. 19, pp. 193205. c 2009 Cambridge University Press
Improved Asymptotic Bounds on Critical Transmission Radius for Greedy Forward Routing in Wireless Ad Hoc
J Comb Optim (2008) 16: 99106 DOI 10.1007/s10878-007-9124-y
Asymptotic Critical Transmission Radius for Greedy Forward Routing in Wireless Ad Hoc Networks
On The Longest RNG Edge of Wireless Ad Hoc Peng-Jun Wan, Lixin Wang, Frances Yao and Chih-Wei Yi
Theoretical Computer Science 410 (2009) 10991108 Contents lists available at ScienceDirect
Design and Analysis of Password-Based Key Derivation Functions
Theoretical Computer Science 410 (2009) 10131021 Contents lists available at ScienceDirect