The following pages link to Andrew Chi-Chih Yao (Q271589):
Displaying 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Algebraic decision trees and Euler characteristics (Q673780) (← links)
- (Q799114) (redirect page) (← links)
- On the time-space tradeoff for sorting with linear queries (Q799115) (← links)
- Lower bounds to randomized algorithms for graph properties (Q808708) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- (Q1007252) (redirect page) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- (Q1115625) (redirect page) (← links)
- On selecting the k largest with median tests (Q1115626) (← links)
- A note on a conjecture of Kam and Ullman concerning statistical databases (Q1133904) (← links)
- A note on the analysis of extendible hashing (Q1146528) (← links)
- Efficient searching using partial ordering (Q1151264) (← links)
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (Q1218265) (← links)
- On a problem of Katona on minimal separating systems (Q1225619) (← links)
- An almost optimal algorithm for unbounded searching (Q1229581) (← links)
- On random 2-3 trees (Q1243733) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- (Q1313711) (redirect page) (← links)
- A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests (Q1313712) (← links)
- (Q1367533) (redirect page) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus (Q1416118) (← links)
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) (Q1606968) (← links)
- On revenue monotonicity in combinatorial auctions (Q1617635) (← links)
- (Q1900893) (redirect page) (← links)
- Minimean optimal key arrangements in hash tables (Q1900894) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- A circuit-based proof of Toda's theorem (Q2366565) (← links)
- Oblivious and adaptive strategies for the majority and plurality problems (Q2384785) (← links)
- Computationally-Fair Group and Identity-Based Key-Exchange (Q2898034) (← links)
- Storing a sparse table (Q3049828) (← links)
- Quantum bit escrow (Q3192045) (← links)
- On Fault-Tolerant Networks for Sorting (Q3221416) (← links)
- Classical physics and the Church--Turing Thesis (Q3455558) (← links)
- Deniable Internet Key Exchange (Q3575056) (← links)
- Graph entropy and quantum sorting problems (Q3580995) (← links)
- On the power of quantum fingerprinting (Q3581289) (← links)
- Concurrent Knowledge Extraction in the Public-Key Model (Q3587420) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
- Some Perspectives on Complexity-Based Cryptography (Q3600364) (← links)
- A note on the feasibility of generalised universal composability (Q3616225) (← links)
- (Q3626604) (← links)
- (Q3657300) (← links)
- (Q3664859) (← links)
- On the Expected Performance of Path Compression Algorithms (Q3677175) (← links)
- On the Complexity of Maintaining Partial Sums (Q3678702) (← links)
- (Q3696515) (← links)
