Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Yao, Frances"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tighter approximation bounds for minimum CDS in unit disk graphs
Minming Li
,
Peng-Jun Wan
,
Frances Yao
Algorithmica
61
(4), 2011, pp. 1000-1021
Approximately optimal trees for group key management with batch updates
Minming Li
,
Ze Feng
,
Nan Zang
,
Ronald L. Graham
,
Frances F. Yao
Theoretical Computer Science
410
(11), 2009, pp. 1013-1021
Tighter approximation bounds for minimum CDS in wireless ad hoc networks
Minming Li
,
Peng-Jun Wan
,
Frances Yao
Lecture Notes in Computer Science
5878
, 2009, pp. 699-709
A note on universal composable zero-knowledge in the common reference string model
Andrew C.C. Yao
,
Frances F. Yao
,
Yunlei Zhao
Theoretical Computer Science
410
(11), 2009, pp. 1099-1108
Optimizing deletion cost for secure multicast key management
Zhi-Zhong Chen
,
Ze Feng
,
Minming Li
,
Frances Yao
Theoretical Computer Science
401
(1-3), 2008, pp. 52-61
Lower bounds and new constructions on secure group communication schemes
Scott C.-H. Huang
,
Frances Yao
,
Minming Li
,
Weili Wu
Theoretical Computer Science
407
(1-3), 2008, pp. 511-523
Optimal tree structures for group key management with batch updates
Ronald L. Graham
,
Minming Li
,
Frances F. Yao
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 532-547
Algorithms for minimum
m
-connected
k
-tuple dominating set problem
Weiping Shang
,
Pengjun Wan
,
Frances Yao
,
Xiaodong Hu
Theoretical Computer Science
381
(1-3), 2007, pp. 241-247
k
-nearest-neighbor clustering and percolation theory
Shang-Hua Teng
,
Frances F. Yao
Algorithmica
49
(3), 2007, pp. 192-211
Algorithmic problems in scheduling jobs on variable-speed processors
Frances F. Yao
Lecture Notes in Computer Science
4580
, 2007, pp. 3-3
Min-energy voltage allocation for tree-structured tasks
Minming Li
,
Becky Jie Liu
,
Frances F. Yao
Lecture Notes in Computer Science
3595
, 2005, pp. 283-296
An efficient algorithm for computing optimal discrete voltage schedules
Minming Li
,
Frances F. Yao
Lecture Notes in Computer Science
3618
, 2005, pp. 652-663
An efficient algorithm for computing optimal discrete voltage schedules
Minming Li
,
Frances F. Yao
SIAM Journal on Computing
35
(3), 2005-2006, pp. 658-671
Algorithmic problems in wireless ad hoc networks
Frances F. Yao
Lecture Notes in Computer Science
3827
, 2005, pp. 1-1
Graphical illustration of some examples related to the article ''Iterated random functions'' by Diaconis and Freedman
Peter Borwein
,
Simon A. Levin
,
George Papanicolaou
,
Daniel N. Rockmore
,
J.A. Sethian
,
Steven H. Strogatz
,
Lloyd N. Trefethen
,
Frances Yao
SIAM Review
41
(1), 1999, pp. 77-82
Approximating shortest superstrings
Shang-Hua Teng
,
Frances F. Yao
SIAM Journal on Computing
26
(2), 1997, pp. 410-417
Dictionary look-up with one error
Andrew C. Yao
,
Frances F. Yao
Journal of Algorithms
25
(1), 1997, pp. 194-202
A scheduling model for reduced CPU energy
Frances Yao
,
Alan Demers
,
Scott Shenker
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 374-382
Dictionary look-up with small errors
Andrew C. Yao
,
Frances F. Yao
Lecture Notes in Computer Science
937
, 1995, pp. 387-394
Multi-index hashing for information retrieval
Dan Greene
,
Michal Parnas
,
Frances Yao
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 722-731
Approximating shortest superstrings
Shang-Hua Teng
,
Frances Yao
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 158-165
Neighborhood graphs and geometric embedding
Frances Yao
Lecture Notes in Computer Science
519
, 1991, pp. 201-201
Nearest neighbors revisited
Frances Yao
Lecture Notes in Computer Science
557
, 1991, pp. 283-283
Computing Euclidean maximum spanning trees
Clyde Monma
,
Michael Paterson
,
Subhash Suri
,
Frances Yao
Algorithmica
5
, 1990, pp. 407-419
Speed-up in dynamic programming
Frances F. Yao
SIAM Journal on Algebraic Discrete Methods
3
(4), 1982, December, pp. 532-540
Seiten 1
2
>