Frances F. Yao

From MaRDI portal
Person:2369974

Available identifiers

zbMath Open yao.frances-fMaRDI QIDQ2369974

List of research outcomes

PublicationDate of PublicationType
An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules2017-05-19Paper
Tighter approximation bounds for minimum CDS in unit disk graphs2011-12-14Paper
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks2009-12-17Paper
ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS2009-06-23Paper
On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs2009-05-04Paper
A note on the feasibility of generalised universal composability2009-03-24Paper
Approximately optimal trees for group key management with batch updates2009-03-20Paper
A note on universal composable zero-knowledge in the common reference string model2009-03-20Paper
Algorithms for Minimum m-Connected k-Dominating Set Problem2009-03-03Paper
Design and Analysis of Password-Based Key Derivation Functions2008-12-21Paper
Lower bounds and new constructions on secure group communication schemes2008-11-18Paper
Optimizing deletion cost for secure multicast key management2008-07-31Paper
Optimal Tree Structures for Group Key Management with Batch Updates2008-05-22Paper
\(k\)-nearest-neighbor clustering and percolation theory2007-11-28Paper
Approximately Optimal Trees for Group Key Management with Batch Updates2007-11-13Paper
A Note on Universal Composable Zero Knowledge in Common Reference String Model2007-11-13Paper
A Note on the Feasibility of Generalized Universal Composability2007-11-13Paper
Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem2007-09-03Paper
Min-energy voltage allocation for tree-structured tasks2007-06-21Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules2006-06-01Paper
Computing and Combinatorics2006-01-11Paper
Topics in Cryptology – CT-RSA 20052005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q42527222000-04-26Paper
Dictionary Look-Up with One Error1998-06-01Paper
Approximating Shortest Superstrings1997-05-26Paper
https://portal.mardi4nfdi.de/entity/Q40366031993-05-18Paper
THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33597911991-01-01Paper
Computing Euclidean maximum spanning trees1990-01-01Paper
A Whirlwind Tour of Computational Geometry1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36594961982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Frances F. Yao