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, Andrew C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Concurrent knowledge extraction in the public-key model
Andrew C. Yao
,
Moti Yung
,
Yunlei Zhao
Lecture Notes in Computer Science
6198
, 2010, pp. 702-714
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
On the communication complexity of co-linearity problems
Andrew C. Yao
Lecture Notes in Computer Science
3618
, 2005, pp. 57-57
Quantum bit escrow
Dorit Aharonov
,
Amnon Ta-Shma
,
Umesh V. Vazirani
,
Andrew C. Yao
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 705-714
NQP_{C}=co-C_=P
Tomoyuki Yamakami
,
Andrew C. Yao
Information Processing Letters
71
(2), 1999, pp. 63-69
Dictionary look-up with one error
Andrew C. Yao
,
Frances F. Yao
Journal of Algorithms
25
(1), 1997, pp. 194-202
Hypergraphs and decision trees
Andrew C. Yao
Lecture Notes in Computer Science
1197
, 1997, pp. 1-1
Dictionary look-up with small errors
Andrew C. Yao
,
Frances F. Yao
Lecture Notes in Computer Science
937
, 1995, pp. 387-394
A randomized algorithm for finding maximum with
O((\log n)^2)
polynomial tests
Hing F. Ting
,
Andrew C. Yao
Information Processing Letters
49
, 1994, pp. 39-43
A circuit-based proof of Toda's theorem
Ravi Kannan
,
H. Venkateswaran
,
V. Vinay
,
Andrew C. Yao
Information and Computation
104
(2), 1993, June, pp. 271-276
Linear decision trees: Volume estimates and topological bounds
Anders Björner
,
László Lovász
,
Andrew C.C. Yao
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 170-177
On evaluating Boolean fuctions with unreliable tests
Claire Kenyon
,
Andrew C. Yao
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 1-10
On the improbability of reaching Byzantine agreements
Ronald L. Graham
,
Andrew C. Yao
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 467-478
Circuits and local computation
Andrew C. Yao
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 186-196
Rearrangeable networks with limited depth
Nicholas Pippenger
,
Andrew C.-C. Yao
SIAM Journal on Algebraic Discrete Methods
3
(4), 1982, December, pp. 411-417
Lower bounds for algebraic decision trees
J. Michael Steele
,
Andrew C. Yao
Journal of Algorithms
3
, 1982, pp. 1-8