BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × France
1 × Greece
1 × Spain
14 × USA
2 × Canada
Collaborated with:
S.Kannan R.L.Graham F.F.Yao M.Yung Y.Zhao A.A.Razborov A.Wigderson A.Björner L.Lovász S.Goldwasser S.Micali D.Avis R.L.Rivest N.Chen X.Deng X.Sun D.Aharonov A.Ta-Shma U.V.Vazirani
Talks about:
comput (6) quantum (3) program (3) problem (3) complex (3) checker (2) queri (2) decis (2) coher (2) bound (2)

Person: Andrew Chi-Chih Yao

DBLP DBLP: Yao:Andrew_Chi=Chih

Contributed to:

ICALP (1) 20102010
ICALP 20042004
STOC 20042004
STOC 20012001
STOC 20002000
STOC 19971997
STOC 19951995
STOC 19941994
STOC 19921992
ICALP 19911991
STOC 19901990
STOC 19891989
STOC 19851985
STOC 19831983
STOC 19821982
STOC 19811981
STOC 19791979
STOC 19771977
STOC 19761976
STOC 19751975

Wrote 22 papers:

ICALP-v1-2010-YaoYZ #concurrent
Concurrent Knowledge Extraction in the Public-Key Model (ACCY, MY, YZ), pp. 702–714.
ICALP-2004-ChenDSY #sequence
Dynamic Price Sequence and Incentive Compatibility (NC, XD, XS, ACCY), pp. 320–331.
STOC-2004-Yao #graph #problem #quantum #sorting
Graph entropy and quantum sorting problems (ACCY), pp. 112–117.
STOC-2001-Yao #complexity
Some perspective on computational complexity (ACCY), p. 600.
STOC-2000-AharonovTVY #quantum
Quantum bit escrow (DA, ATS, UVV, ACCY), pp. 705–714.
STOC-1997-RazborovWY #branch #calculus #proving #source code
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
STOC-1995-Yao #metric #protocol #quantum #security
Security of quantum protocols against coherent measurements (ACCY), pp. 67–75.
STOC-1994-Yao #complexity
Decision tree complexity and Betti numbers (ACCY), pp. 615–624.
STOC-1992-BjornerLY #bound #linear
Linear Decision Trees: Volume Estimates and Topological Bounds (AB, LL, ACCY), pp. 170–177.
ICALP-1991-KannanY #generative #probability
Program Checkers for Probability Generation (SK, ACCY), pp. 163–173.
Coherent Functions and Program Checkers (ACCY), pp. 84–94.
STOC-1989-GrahamY #on the
On the Improbability of Reaching Byzantine Agreements (RLG, ACCY), pp. 467–478.
Circuits and Local Computation (ACCY), pp. 186–196.
STOC-1985-YaoY #approach #geometry #query
A General Approach to d-Dimensional Geometric Queries (ACCY, FFY), pp. 163–168.
Strong Signature Schemes (SG, SM, ACCY), pp. 431–439.
STOC-1982-Yao #query #trade-off
Space-Time Tradeoff for Answering Range Queries (ACCY), pp. 128–136.
STOC-1981-Yao #on the #parallel #problem
On the Parallel Computation for the Knapsack Problem (ACCY), pp. 123–127.
The Entropic Limitations on VLSI Computations (ACCY), pp. 308–311.
STOC-1979-Yao #complexity
Some Complexity Questions Related to Distributive Computing (ACCY), pp. 209–213.
STOC-1977-YaoAR #bound #problem
An Ω(n² log n) Lower Bound to the Shortest Paths Problem (ACCY, DA, RLR), pp. 11–17.
STOC-1976-Yao #algorithm #behaviour #on the #set
On the Average Behavior of Set Merging Algorithms (ACCY), pp. 192–195.
STOC-1975-Yao #on the #polynomial
On Computing the Minima of Quadratic Forms (ACCY), pp. 23–26.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.