Frances F. Yao

Available identifiers

zbMath Open yao.frances-fMaRDI QIDQ2369974

List of research outcomes

Publication	Date of Publication	Type
An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules	2017-05-19	Paper
Tighter approximation bounds for minimum CDS in unit disk graphs	2011-12-14	Paper
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks	2009-12-17	Paper
ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS	2009-06-23	Paper
On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs	2009-05-04	Paper
A note on the feasibility of generalised universal composability	2009-03-24	Paper
Approximately optimal trees for group key management with batch updates	2009-03-20	Paper
A note on universal composable zero-knowledge in the common reference string model	2009-03-20	Paper
Algorithms for Minimum m-Connected k-Dominating Set Problem	2009-03-03	Paper
Design and Analysis of Password-Based Key Derivation Functions	2008-12-21	Paper
Lower bounds and new constructions on secure group communication schemes	2008-11-18	Paper
Optimizing deletion cost for secure multicast key management	2008-07-31	Paper
Optimal Tree Structures for Group Key Management with Batch Updates	2008-05-22	Paper
\(k\)-nearest-neighbor clustering and percolation theory	2007-11-28	Paper
Approximately Optimal Trees for Group Key Management with Batch Updates	2007-11-13	Paper
A Note on the Feasibility of Generalized Universal Composability	2007-11-13	Paper
A Note on Universal Composable Zero Knowledge in Common Reference String Model	2007-11-13	Paper
Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem	2007-09-03	Paper
Min-energy voltage allocation for tree-structured tasks	2007-06-21	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules	2006-06-01	Paper
Computing and Combinatorics	2006-01-11	Paper
Topics in Cryptology – CT-RSA 2005	2005-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q4252722	2000-04-26	Paper
Dictionary Look-Up with One Error	1998-06-01	Paper
Approximating Shortest Superstrings	1997-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q4036603	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q3359791	1991-01-01	Paper
THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION	1991-01-01	Paper
A Whirlwind Tour of Computational Geometry	1990-01-01	Paper
Computing Euclidean maximum spanning trees	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3659496	1982-01-01	Paper

Research outcomes over time

This page was built for person: Frances F. Yao