Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Andrew Chi-Chih Yao - MaRDI portal

Andrew Chi-Chih Yao

From MaRDI portal
(Redirected from Person:1007252)
Person:271589

Available identifiers

zbMath Open yao.andrew-chi-chihWikidataQ62888 ScholiaQ62888MaRDI QIDQ271589

List of research outcomes

PublicationDate of PublicationType
A Quantized Analogue of the Markov–Krein Correspondence2023-04-05Paper
Densities for Elliptic Curves over Global Function Fields2023-01-26Paper
Limits of Probability Measures With General Coefficients2021-09-28Paper
A Quantized Analogue of the Markov-Krein Correspondence2020-11-21Paper
On revenue monotonicity in combinatorial auctions2018-11-08Paper
An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications2017-10-05Paper
Decision tree complexity and Betti numbers2016-09-01Paper
Concurrent knowledge extraction in public-key models2016-04-07Paper
Classical physics and the Church--Turing Thesis2015-12-07Paper
Quantum bit escrow2014-09-26Paper
On revenue maximization for selling multiple independently distributed items2014-07-25Paper
Graph coloring applied to secure computation in non-abelian groups2013-01-04Paper
Computationally-Fair Group and Identity-Based Key-Exchange2012-07-16Paper
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem2011-03-30Paper
Concurrent Knowledge Extraction in the Public-Key Model2010-09-07Paper
On the power of quantum fingerprinting2010-08-16Paper
Graph entropy and quantum sorting problems2010-08-15Paper
Deniable Internet Key Exchange2010-07-06Paper
On the quantum query complexity of local search in two and three dimensions2009-08-31Paper
https://portal.mardi4nfdi.de/entity/Q36266042009-05-22Paper
A note on the feasibility of generalised universal composability2009-03-24Paper
A note on universal composable zero-knowledge in the common reference string model2009-03-20Paper
Graph Design for Secure Multiparty Computation over Non-Abelian Groups2009-02-10Paper
Some Perspectives on Complexity-Based Cryptography2009-02-10Paper
A Note on Universal Composable Zero Knowledge in Common Reference String Model2007-11-13Paper
A Note on the Feasibility of Generalized Universal Composability2007-11-13Paper
Oblivious and adaptive strategies for the majority and plurality problems2007-10-10Paper
Theory and Applications of Models of Computation2007-04-30Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Computing and Combinatorics2006-01-11Paper
Automata, Languages and Programming2005-08-24Paper
Algorithms – ESA 20042005-08-18Paper
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus2003-12-14Paper
\(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q42303492002-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45270432001-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42340521999-07-26Paper
An exponential lower bound on the size of algebraic decision trees for MAX1999-02-02Paper
Dictionary Look-Up with One Error1998-06-01Paper
Decision tree complexity and Betti numbers1997-10-28Paper
On the shrinkage exponent for read-once formulae1997-09-29Paper
Algebraic decision trees and Euler characteristics1997-02-28Paper
On Computing Algebraic Functions Using Logarithms and Exponentials1996-03-18Paper
Minimean optimal key arrangements in hash tables1995-10-25Paper
Near-Optimal Time-Space Tradeoff for Element Distinctness1995-08-27Paper
A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests1994-03-22Paper
A circuit-based proof of Toda's theorem1993-08-30Paper
https://portal.mardi4nfdi.de/entity/Q40365611993-05-18Paper
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains1992-06-25Paper
Lower bounds to randomized algorithms for graph properties1991-01-01Paper
ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS1990-01-01Paper
On selecting the k largest with median tests1989-01-01Paper
On the Complexity of Partial Order Productions1989-01-01Paper
Monotone Bipartite Graph Properties are Evasive1988-01-01Paper
On Fault-Tolerant Networks for Sorting1985-01-01Paper
On the Expected Performance of Path Compression Algorithms1985-01-01Paper
On the Complexity of Maintaining Partial Sums1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36965151985-01-01Paper
On optimal arrangements of keys with double hashing1985-01-01Paper
Uniform hashing is optimal1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36573001983-01-01Paper
On the security of public key protocols1983-01-01Paper
On the time-space tradeoff for sorting with linear queries1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36648591982-01-01Paper
Lower bounds for algebraic decision trees1982-01-01Paper
The Complexity of Finding Cycles in Periodic Functions1982-01-01Paper
On Parallel Computation for the Knapsack Problem1982-01-01Paper
On the Average-Case Complexity of Selecting the kth Best1982-01-01Paper
On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems1982-01-01Paper
Rearrangeable Networks with Limited Depth1982-01-01Paper
Efficient searching using partial ordering1981-01-01Paper
An Analysis of a Memory Allocation Scheme for Implementing Stacks1981-01-01Paper
Should Tables Be Sorted?1981-01-01Paper
A Lower Bound to Finding Convex Hulls1981-01-01Paper
A note on the analysis of extendible hashing1980-01-01Paper
External Hashing Schemes for Collections of Data Structures1980-01-01Paper
New Algorithms for Bin Packing1980-01-01Paper
An analysis of (h, k, 1)-Shellsort1980-01-01Paper
Optimal Expected-Time Algorithms for Closest Point Problems1980-01-01Paper
Bounds on Selection Networks1980-01-01Paper
On the Polyhedral Decision Problem1980-01-01Paper
Information Bounds Are Weak in the Shortest Distance Problem1980-01-01Paper
A note on a conjecture of Kam and Ullman concerning statistical databases1979-01-01Paper
Storing a sparse table1979-01-01Paper
The Complexity of Pattern Matching for a Random String1979-01-01Paper
On random 2-3 trees1978-01-01Paper
k + 1 Heads Are Better than k1978-01-01Paper
On the Loop Switching Addressing Problem1978-01-01Paper
On a problem of Katona on minimal separating systems1976-01-01Paper
An almost optimal algorithm for unbounded searching1976-01-01Paper
Resource constrained scheduling as generalized bin packing1976-01-01Paper
On the Evaluation of Powers1976-01-01Paper
Lower Bounds on Merging Networks1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41312331976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403691976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41783851976-01-01Paper
An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40576241975-01-01Paper
Analysis of the subtractive algorithm for greatest common divisors1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41315451975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andrew Chi-Chih Yao