The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew Chi-Chih Yao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew Chi-Chih Yao
    On Random 2-3 Trees. [Citation Graph (38, 0)][DBLP]
    Acta Inf., 1978, v:9, n:, pp:159-170 [Journal]
  2. Andrew Chi-Chih Yao
    On the Complexity of Maintaining Partial Sums. [Citation Graph (7, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:277-288 [Journal]
  3. Robert Endre Tarjan, Andrew Chi-Chih Yao
    Storing a Sparse Table. [Citation Graph (6, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:11, pp:606-611 [Journal]
  4. Andrew Chi-Chih Yao
    Should Tables Be Sorted? [Citation Graph (4, 0)][DBLP]
    J. ACM, 1981, v:28, n:3, pp:615-628 [Journal]
  5. Andrew Chi-Chih Yao
    A Note on the Analysis of Extendible Hashing. [Citation Graph (3, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:2, pp:84-86 [Journal]
  6. Andrew Chi-Chih Yao, F. Frances Yao
    The Complexity of Searching an Ordered Random Table (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    FOCS, 1976, pp:173-177 [Conf]
  7. Andrew Chi-Chih Yao, F. Frances Yao
    A General Approach to d-Dimensional Geometric Queries (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1985, pp:163-168 [Conf]
  8. Andrew Chi-Chih Yao
    A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases. [Citation Graph (2, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:1, pp:48-50 [Journal]
  9. Jon Louis Bentley, Bruce W. Weide, Andrew Chi-Chih Yao
    Optimal Expected-Time Algorithms for Closest Point Problems. [Citation Graph (2, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:4, pp:563-580 [Journal]
  10. Andrew Chi-Chih Yao
    Some Complexity Questions Related to Distributive Computing (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1979, pp:209-213 [Conf]
  11. Andrew Chi-Chih Yao
    Space-Time Tradeoff for Answering Range Queries (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1982, pp:128-136 [Conf]
  12. Andrew Chi-Chih Yao
    An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:21-23 [Journal]
  13. Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao
    Towards Uncheatable benchmarks. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:2-11 [Conf]
  14. Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
    Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:286-293 [Conf]
  15. Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
    Oblivious and Adaptive Strategies for the Majority and Plurality Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:329-338 [Conf]
  16. Andrew Chi-Chih Yao, F. Frances Yao
    Dictionary Loop-Up with Small Errors. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:387-394 [Conf]
  17. Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao
    On Signatures and Authentication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:211-215 [Conf]
  18. Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
    Fisher Equilibrium Price with a Class of Concave Utility Functions. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:169-179 [Conf]
  19. Andrew Chi-Chih Yao
    Recent Progress in Circuit and Communication Complexity (Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:104- [Conf]
  20. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao
    Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:270-278 [Conf]
  21. Danny Dolev, Andrew Chi-Chih Yao
    On the Security of Public Key Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:350-357 [Conf]
  22. Dominic Mayers, Andrew Chi-Chih Yao
    Quantum Cryptography with Imperfect Apparatus. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:503-509 [Conf]
  23. Andrew Chi-Chih Yao
    Bounds on Selection Networks [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:110-116 [Conf]
  24. Andrew Chi-Chih Yao
    On the Complexity of Comparison Problems using Linear Functions (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:85-89 [Conf]
  25. Andrew Chi-Chih Yao
    Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:222-227 [Conf]
  26. Andrew Chi-Chih Yao
    Should Tables Be Sorted? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:22-27 [Conf]
  27. Andrew Chi-Chih Yao
    Theory and Applications of Trapdoor Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:80-91 [Conf]
  28. Andrew Chi-Chih Yao
    Protocols for Secure Computations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:160-164 [Conf]
  29. Andrew Chi-Chih Yao
    Lower Bounds by Probabilistic Arguments (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:420-428 [Conf]
  30. Andrew Chi-Chih Yao
    Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:1-10 [Conf]
  31. Andrew Chi-Chih Yao
    How to Generate and Exchange Secrets (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:162-167 [Conf]
  32. Andrew Chi-Chih Yao
    Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:393-400 [Conf]
  33. Andrew Chi-Chih Yao
    Near-Optimal Time-Space Tradeoff for Element Distinctness [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:91-97 [Conf]
  34. Andrew Chi-Chih Yao
    Lower Bounds for Algebraic Computation Trees with Integer Inputs [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:308-313 [Conf]
  35. Andrew Chi-Chih Yao
    On ACC and Threshold Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:619-627 [Conf]
  36. Andrew Chi-Chih Yao
    Algebraic Decision Trees and Euler Characteristics [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:268-277 [Conf]
  37. Andrew Chi-Chih Yao
    Quantum Circuit Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:352-361 [Conf]
  38. Andrew Chi-Chih Yao
    A Lower Bound for the Monotone Depth of Connectivity [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:302-308 [Conf]
  39. Andrew Chi-Chih Yao, Ronald L. Rivest
    k+1 Heads Are Better than k [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:67-70 [Conf]
  40. Andrew Chi-Chih Yao, F. Frances Yao
    On the Average-case Complexity of Selecting k-th Best [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:280-289 [Conf]
  41. Xiaoming Sun, Andrew Chi-Chih Yao
    On the Quantum Query Complexity of Local Search in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:429-438 [Conf]
  42. Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
    Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:320-331 [Conf]
  43. Sampath Kannan, Andrew Chi-Chih Yao
    Program Checkers for Probability Generation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:163-173 [Conf]
  44. Andrew Chi-Chih Yao
    Weighted Random Assignments with Application to Hashing. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:42- [Conf]
  45. Andrew Chi-Chih Yao
    Interactive Proofs for Quantum Computation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:1- [Conf]
  46. Andrew Chi-Chih Yao
    On the Communication Complexity of Co-linearity Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:57- [Conf]
  47. Andrew Chi-Chih Yao
    Scheduling Unit-Time Tasks with Limited Resources. [Citation Graph (0, 0)][DBLP]
    Sagamore Computer Conference, 1974, pp:17-36 [Conf]
  48. Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao
    Quantum bit escrow. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:705-714 [Conf]
  49. Anders Björner, László Lovász, Andrew Chi-Chih Yao
    Linear Decision Trees: Volume Estimates and Topological Bounds [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:170-177 [Conf]
  50. Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao
    Strong Signature Schemes [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:431-439 [Conf]
  51. Ronald L. Graham, Andrew Chi-Chih Yao
    On the Improbability of Reaching Byzantine Agreements (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:467-478 [Conf]
  52. Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
    Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:739-748 [Conf]
  53. Andrew Chi-Chih Yao
    Some perspective on computational complexity (abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:600- [Conf]
  54. Andrew Chi-Chih Yao
    Graph entropy and quantum sorting problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:112-117 [Conf]
  55. Andrew Chi-Chih Yao
    On Computing the Minima of Quadratic Forms (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:23-26 [Conf]
  56. Andrew Chi-Chih Yao
    On the Average Behavior of Set Merging Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:192-195 [Conf]
  57. Andrew Chi-Chih Yao
    On the Parallel Computation for the Knapsack Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:123-127 [Conf]
  58. Andrew Chi-Chih Yao
    The Entropic Limitations on VLSI Computations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:308-311 [Conf]
  59. Andrew Chi-Chih Yao
    Circuits and Local Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:186-196 [Conf]
  60. Andrew Chi-Chih Yao
    Coherent Functions and Program Checkers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:84-94 [Conf]
  61. Andrew Chi-Chih Yao
    Decision tree complexity and Betti numbers. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:615-624 [Conf]
  62. Andrew Chi-Chih Yao
    Security of quantum protocols against coherent measurements. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:67-75 [Conf]
  63. Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest
    An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:11-17 [Conf]
  64. Andrew Chi-Chih Yao
    Recent Progress in Quantum Computational Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:89-89 [Conf]
  65. Andrew Chi-Chih Yao
    Groups and Algebraic Complexity (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:35- [Conf]
  66. Andrew Chi-Chih Yao
    Hypergraphs and Decision Trees (Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:1- [Conf]
  67. Andrew Chi-Chih Yao
    On Selecting the k Largest with Median Tests. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:2, pp:293-300 [Journal]
  68. Andrew Chi-Chih Yao
    Minimean Optimal Key Arrangements in Hash Tables. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:5, pp:409-428 [Journal]
  69. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
    An exponential lower bound on the size of algebraic decision trees for Max. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:3, pp:193-203 [Journal]
  70. Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao
    Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:555-574 [Journal]
  71. Tomoyuki Yamakami, Andrew Chi-Chih Yao
    NQPC = co-C=P [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  72. Andrew Chi-Chih Yao
    Classical Physics and the Church-Turing Thesis [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:062, pp:- [Journal]
  73. Andrew Chi-Chih Yao
    On the Power of Quantum Fingerprinting [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:074, pp:- [Journal]
  74. Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
    Finding Favorites [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:078, pp:- [Journal]
  75. Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao
    An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:57, pp:- [Journal]
  76. Tomoyuki Yamakami, Andrew Chi-Chih Yao
    NQP = co-C=P [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:73, pp:- [Journal]
  77. Edward G. Coffman Jr., Kimming So, Micha Hofri, Andrew Chi-Chih Yao
    A Stochastic Model of Bin-Packing [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:44, n:2, pp:105-115 [Journal]
  78. Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao
    A Circuit-Based Proof of Toda's Theorem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:271-276 [Journal]
  79. Claire Kenyon, Andrew Chi-Chih Yao
    On Evaluating Boolean Functions with Unreliable Tests. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:1, pp:1-10 [Journal]
  80. Jon Louis Bentley, Andrew Chi-Chih Yao
    An Almost Optimal Algorithm for Unbounded Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:3, pp:82-87 [Journal]
  81. Allan Borodin, Leonidas J. Guibas, Nancy A. Lynch, Andrew Chi-Chih Yao
    Efficient Searching Using Partial Ordering. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:71-75 [Journal]
  82. Hing-Fung Ting, Andrew Chi-Chih Yao
    A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:1, pp:39-43 [Journal]
  83. Tomoyuki Yamakami, Andrew Chi-Chih Yao
    NQPC = co-C=P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:63-69 [Journal]
  84. Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
    Information Bounds Are Weak in the Shortest Distance Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:3, pp:428-444 [Journal]
  85. Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao
    External Hashing Schemes for Collections of Data Structures. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:1, pp:81-95 [Journal]
  86. Andrew Chi-Chih Yao, Ronald L. Rivest
    k+1 Heads Are Better than k. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:2, pp:337-340 [Journal]
  87. Andrew Chi-Chih Yao, Foong Frances Yao
    Lower Bounds on Merging Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:566-571 [Journal]
  88. Andrew Chi-Chih Yao
    Classical physics and the Church-Turing Thesis. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:100-105 [Journal]
  89. Andrew Chi-Chih Yao
    New Algorithms for Bin Packing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:2, pp:207-227 [Journal]
  90. Andrew Chi-Chih Yao
    A Lower Bound to Finding Convex Hulls. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:780-787 [Journal]
  91. Andrew Chi-Chih Yao
    On Parallel Computation for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:898-903 [Journal]
  92. Andrew Chi-Chih Yao
    Uniform Hashing Is Optimal [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:687-693 [Journal]
  93. Andrew Chi-Chih Yao
    An Analysis of (h, k, 1)-Shellsort. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1980, v:1, n:1, pp:14-50 [Journal]
  94. Andrew Chi-Chih Yao, Frances F. Yao
    Dictionary Look-Up with One Error. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:1, pp:194-202 [Journal]
  95. Andrew Chi-Chih Yao
    On Optimal Arrangements of Keys with Double Hashing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:2, pp:253-264 [Journal]
  96. J. Michael Steele, Andrew Chi-Chih Yao
    Lower Bounds for Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:1, pp:1-8 [Journal]
  97. Andrew Chi-Chih Yao
    Lower Bounds to Randomized Algorithms for Graph Properties. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:3, pp:267-287 [Journal]
  98. Andrew Chi-Chih Yao
    Decision Tree Complexity and Betti Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:1, pp:36-43 [Journal]
  99. Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao
    On Computing Algebraic Functions Using Logarithms and Exponentials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:242-246 [Journal]
  100. Andrew Chi-Chih Yao
    On the Evaluation of Powers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:1, pp:100-103 [Journal]
  101. Andrew Chi-Chih Yao
    On the Loop Switching Addressing Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:515-523 [Journal]
  102. Andrew Chi-Chih Yao
    The Complexity of Pattern Matching for a Random String. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:368-387 [Journal]
  103. Andrew Chi-Chih Yao
    Bounds on Selection Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:566-582 [Journal]
  104. Andrew Chi-Chih Yao
    An Analysis of a Memory Allocation Scheme for Implementing Stacks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:398-403 [Journal]
  105. Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao
    The Complexity of Finding Cycles in Periodic Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:376-390 [Journal]
  106. Andrew Chi-Chih Yao
    On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:721-736 [Journal]
  107. Andrew Chi-Chih Yao
    On the Expected Performance of Path Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:129-133 [Journal]
  108. Andrew Chi-Chih Yao
    Monotone Bipartite Graph Properties are Evasive. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:517-520 [Journal]
  109. Andrew Chi-Chih Yao
    On the Complexity of Partial Order Productions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:679-689 [Journal]
  110. Andrew Chi-Chih Yao
    Lower Bounds for Algebraic Computation Trees with Integer Inputs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:655-668 [Journal]
  111. Andrew Chi-Chih Yao
    Near-Optimal Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:966-975 [Journal]
  112. Andrew Chi-Chih Yao, Ronald L. Rivest
    On the Polyhedral Decision Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:343-347 [Journal]
  113. Andrew Chi-Chih Yao, F. Frances Yao
    On the Average-Case Complexity of Selecting the kth Best. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:428-447 [Journal]
  114. Andrew Chi-Chih Yao, F. Frances Yao
    On Fault-Tolerant Networks for Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:120-128 [Journal]
  115. Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao
    On the Shrinkage Exponent for Read-Once Formulae. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:269-282 [Journal]
  116. Andrew Chi-Chih Yao
    On the Time-Space Tradeoff for Sorting with Linear Queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:203-218 [Journal]
  117. Andrew Chi-Chih Yao
    Algebraic Decision Trees and Euler Characteristics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:133-150 [Journal]
  118. Danny Dolev, Andrew Chi-Chih Yao
    On the security of public key protocols. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:2, pp:198-207 [Journal]
  119. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
    A Note on Universal Composable Zero Knowledge in Common Reference String Model. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:462-473 [Conf]
  120. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
    A Note on the Feasibility of Generalized Universal Composability. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:474-485 [Conf]
  121. Fan Chung, Ronald Graham, Jia Mao, Andrew Yao
    Oblivious and Adaptive Strategies for the Majority and Plurality Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:2, pp:147-157 [Journal]

  122. Deniable Internet Key Exchange. [Citation Graph (, )][DBLP]


  123. Some Perspectives on Complexity-Based Cryptography. [Citation Graph (, )][DBLP]


  124. Graph Design for Secure Multiparty Computation over Non-Abelian Groups. [Citation Graph (, )][DBLP]


  125. Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. [Citation Graph (, )][DBLP]


  126. Concurrent Knowledge Extraction in the Public-Key Model. [Citation Graph (, )][DBLP]


  127. Communication Complexity and Its Applications. [Citation Graph (, )][DBLP]


  128. On the Quantum Query Complexity of Local Search in Two and Three Dimensions. [Citation Graph (, )][DBLP]


  129. Concurrent Knowledge-Extraction in the Public-Key Model [Citation Graph (, )][DBLP]


  130. Adaptive Concurrent Non-Malleability with Bare Public-Keys [Citation Graph (, )][DBLP]


Search in 0.255secs, Finished in 0.264secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002