The following pages link to Andrew Chi-Chih Yao (Q271589):
Displaying 50 items.
- On optimal arrangements of keys with double hashing (Q3723740) (← links)
- Uniform hashing is optimal (Q3768413) (← links)
- Monotone Bipartite Graph Properties are Evasive (Q3792707) (← links)
- On the Complexity of Partial Order Productions (Q3835027) (← links)
- The Complexity of Pattern Matching for a Random String (Q3854624) (← links)
- External Hashing Schemes for Collections of Data Structures (Q3862431) (← links)
- New Algorithms for Bin Packing (Q3873560) (← links)
- An analysis of (h, k, 1)-Shellsort (Q3880290) (← links)
- Optimal Expected-Time Algorithms for Closest Point Problems (Q3883531) (← links)
- Bounds on Selection Networks (Q3890124) (← links)
- On the Polyhedral Decision Problem (Q3893331) (← links)
- An Analysis of a Memory Allocation Scheme for Implementing Stacks (Q3907054) (← links)
- Should Tables Be Sorted? (Q3912073) (← links)
- A Lower Bound to Finding Convex Hulls (Q3922189) (← links)
- Information Bounds Are Weak in the Shortest Distance Problem (Q3930655) (← links)
- Lower bounds for algebraic decision trees (Q3933758) (← links)
- The Complexity of Finding Cycles in Periodic Functions (Q3936192) (← links)
- On Parallel Computation for the Knapsack Problem (Q3942393) (← links)
- On the Average-Case Complexity of Selecting the <i>k</i>th Best (Q3947142) (← links)
- On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems (Q3954830) (← links)
- Rearrangeable Networks with Limited Depth (Q3956854) (← links)
- On the security of public key protocols (Q3968876) (← links)
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains (Q3978174) (← links)
- (Q4036561) (← links)
- (Q4057624) (← links)
- Analysis of the subtractive algorithm for greatest common divisors (Q4074953) (← links)
- On the Evaluation of Powers (Q4091445) (← links)
- Lower Bounds on Merging Networks (Q4102737) (← links)
- (Q4131233) (← links)
- (Q4131545) (← links)
- (Q4140369) (← links)
- <i>k</i> + 1 Heads Are Better than <i>k</i> (Q4148951) (← links)
- On the Loop Switching Addressing Problem (Q4167595) (← links)
- (Q4178385) (← links)
- (Q4230349) (← links)
- (Q4234052) (← links)
- Near-Optimal Time-Space Tradeoff for Element Distinctness (Q4312417) (← links)
- Dictionary Look-Up with One Error (Q4366881) (← links)
- (Q4527043) (← links)
- On Computing Algebraic Functions Using Logarithms and Exponentials (Q4834378) (← links)
- On revenue maximization for selling multiple independently distributed items (Q5171012) (← links)
- ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS (Q5202960) (← links)
- An <i>n</i>-to-1 Bidder Reduction for Multi-item Auctions and its Applications (Q5363023) (← links)
- A Note on Universal Composable Zero Knowledge in Common Reference String Model (Q5425457) (← links)
- A Note on the Feasibility of Generalized Universal Composability (Q5425458) (← links)
- Algorithms – ESA 2004 (Q5464576) (← links)
- Automata, Languages and Programming (Q5466472) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492846) (← links)
- Computing and Combinatorics (Q5716950) (← links)
- A Quantized Analogue of the Markov–Krein Correspondence (Q5886611) (← links)
