The following pages link to Frances F. Yao (Q2369974):
Displaying 33 items.
- (Q652527) (redirect page) (← links)
- Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Optimizing deletion cost for secure multicast key management (Q935143) (← links)
- Lower bounds and new constructions on secure group communication schemes (Q955028) (← links)
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← links)
- Approximately optimal trees for group key management with batch updates (Q1007240) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039) (← links)
- Min-energy voltage allocation for tree-structured tasks (Q2369975) (← links)
- \(k\)-nearest-neighbor clustering and percolation theory (Q2461550) (← links)
- An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules (Q2988837) (← links)
- A Whirlwind Tour of Computational Geometry (Q3197359) (← links)
- THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION (Q3212323) (← links)
- (Q3359791) (← links)
- Optimal Tree Structures for Group Key Management with Batch Updates (Q3503233) (← links)
- Design and Analysis of Password-Based Key Derivation Functions (Q3547850) (← links)
- Algorithms for Minimum m-Connected k-Dominating Set Problem (Q3611970) (← links)
- A note on the feasibility of generalised universal composability (Q3616225) (← links)
- ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS (Q3634202) (← links)
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks (Q3652256) (← links)
- (Q3659496) (← links)
- (Q4036603) (← links)
- (Q4252722) (← links)
- Approximating Shortest Superstrings (Q4337677) (← links)
- Dictionary Look-Up with One Error (Q4366881) (← links)
- Approximately Optimal Trees for Group Key Management with Batch Updates (Q5425441) (← links)
- A Note on Universal Composable Zero Knowledge in Common Reference String Model (Q5425457) (← links)
- A Note on the Feasibility of Generalized Universal Composability (Q5425458) (← links)
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules (Q5470707) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492897) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710835) (← links)
- Computing and Combinatorics (Q5716946) (← links)