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
[3]
Hilfe
Suche: Author="Yao, Andrew Chi-Chi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight approximation ratio of a general greedy splitting algorithm for the minimum
k
-way cut problem
Mingyu Xiao
,
Leizhen Cai
,
Andrew Chi-Chih Yao
Algorithmica
59
(4), 2011, pp. 510-520
On the quantum query of local search in two and three dimensions
Xiaoming Sun
,
Andrew Chi-Chih Yao
Algorithmica
55
(3), 2009, pp. 576-600
Dynamic price sequence and incentive compatibility
Ning Chen
,
Xiaotie Deng
,
Xiaoming Sun
,
Andrew Chi-Chih Yao
Lecture Notes in Computer Science
3142
, 2004, pp. 320-331
Fisher equilibrium price with a class of concave utility functions
Ning Chen
,
Xiaotie Deng
,
Xiaoming Sun
,
Andrew Chi-Chih Yao
Lecture Notes in Computer Science
3221
, 2004, pp. 169-179
Graph entropy and quantum sorting problems
Andrew Chi-Chih Yao
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 112-117
Classical physics and the church - Turing thesis
Andrew Chi-Chih Yao
Journal of the ACM
50
(1), 2003, pp. 100-105
Interactive proofs for quantum computation
Andrew Chi-Chih Yao
Lecture Notes in Computer Science
2906
, 2003, pp. 1-1
On the power of quantum fingerprinting
Andrew Chi-Chih Yao
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 77-81
Some perspectives on computational complexity
Andrew Chi-Chih Yao
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 600-600
Decision tree complexity and Betti numbers
Andrew Chi-Chih Yao
Journal of Computer and System Sciences
55
(1), 1997, pp. 36-43
Security of quantum protocols against coherent measurements
Andrew Chi-Chih Yao
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 67-75
Algebraic decision trees end Euler characteristics
Andrew Chi-Chi Yao
Theoretical Computer Science
141
(1-2), 1995, pp. 133-150
Near-optimal time-space tradeoff for element distinctness
Andrew Chi-Chih Yao
SIAM Journal on Computing
23
(5), 1994, October, pp. 966-975
A lower bound for the monotone depth of connectivity
Andrew Chi-Chih 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. 302-308
Decision tree complexity and Betti numbers
Andrew Chi-Chih Yao
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 615-624
Towards uncheatable benchmarks
Jin-yi Cai
,
Richard J. Lipton
,
Robert Sedgewick
,
Andrew Chi-Chih Yao
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 2-11
Quantum circuit complexity
Andrew Chi-Chih Yao
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 352-361
Algebraic decision trees and Euler characteristics
Andrew Chi-Chih Yao
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 268-277
Lower bounds to randomized algorithms for graph properties
Andrew Chi-Chih Yao
Journal of Computer and System Sciences
42
, 1991, pp. 267-287
Lower bounds for algebraic computation trees with integer inputs
Andrew Chi-Chih Yao
SIAM Journal on Computing
20
(4), 1991, August, pp. 655-668
Recent progress in circuit and communication complexity
Andrew Chi-Chih Yao
Lecture Notes in Computer Science
529
, 1991, pp. 104
Weighted random assignments with application to hashing
Andrew Chi-Chi Yao
Lecture Notes in Computer Science
557
, 1991, pp. 42-42
On selecting the
k
largest with median tests
Andrew Chi-Chih Yao
Algorithmica
4
, 1989, pp. 293-300
On the complexity of partial order productions
Andrew Chi-Chih Yao
SIAM Journal on Computing
18
, 1989, pp. 679-689
Monotone bipartite graph properties are evasive
Andrew Chi-Chih Yao
SIAM Journal on Computing
17
, 1988, pp. 517-520
Seiten 1
2
>