Year |
Citation |
Score |
2009 |
Xiao M, Cai L, Yao AC. Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem Algorithmica. 59: 510-520. DOI: 10.1007/S00453-009-9316-1 |
0.326 |
|
2007 |
Chung F, Graham R, Mao J, Yao A. Oblivious and Adaptive Strategies for the Majority and Plurality Problems Algorithmica. 48: 147-157. DOI: 10.1007/S00453-007-0060-0 |
0.336 |
|
2006 |
Li M, Yao AC, Yao FF. Discrete and continuous min-energy schedules for variable voltage processors. Proceedings of the National Academy of Sciences of the United States of America. 103: 3983-7. PMID 16537472 DOI: 10.1073/Pnas.0510886103 |
0.35 |
|
2006 |
Xiaoming S, Yao AC. On the quantum query complexity of local search in two and three dimensions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 429-438. DOI: 10.1007/S00453-008-9170-6 |
0.377 |
|
2002 |
Razborov A, Wigderson A, Yao A. Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus Combinatorica. 22: 555-574. DOI: 10.1007/S00493-002-0007-7 |
0.377 |
|
1998 |
Grigoriev D, Karpinski M, Yao AC. An exponential lower bound on the size of algebraic decision trees for max Computational Complexity. 7: 193-203. DOI: 10.1007/S000370050010 |
0.382 |
|
1997 |
Yao AC, Yao FF. Dictionary Look-Up with One Error Journal of Algorithms. 25: 194-202. DOI: 10.1006/Jagm.1997.0875 |
0.344 |
|
1995 |
Grigoriev D, Singer M, Yao A. On Computing Algebraic Functions Using Logarithms and Exponentials Siam Journal On Computing. 24: 242-246. DOI: 10.1137/S0097539793245015 |
0.331 |
|
1995 |
Yao AC. Algebraic decision trees and Euler characteristics Theoretical Computer Science. 141: 133-150. DOI: 10.1016/0304-3975(94)00082-T |
0.316 |
|
1995 |
Håstad J, Razborov A, Yao A. On the shrinkage exponent for read-once formulae Theoretical Computer Science. 141: 269-282. DOI: 10.1016/0304-3975(94)00081-S |
0.31 |
|
1994 |
Yao AC. Near-Optimal Time-Space Tradeoff for Element Distinctness Siam Journal On Computing. 23: 966-975. DOI: 10.1137/S0097539788148959 |
0.411 |
|
1994 |
Ting HF, Yao AC. A randomized algorithm for finding maximum with O((log n)2) polynomial tests Information Processing Letters. 49: 39-43. DOI: 10.1016/0020-0190(94)90052-3 |
0.418 |
|
1991 |
Yao AC. Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains Siam Journal On Computing. 20: 655-668. DOI: 10.1137/0220041 |
0.415 |
|
1991 |
Yao AC. Lower bounds to randomized algorithms for graph properties Journal of Computer and System Sciences. 42: 267-287. DOI: 10.1016/0022-0000(91)90003-N |
0.387 |
|
1991 |
Yao AC. Weighted Random Assignments with Application to Hashing Rundbrief Der Gi-Fachgruppe 5.10 Informationssystem-Architekturen. 42-42. DOI: 10.1007/3-540-54945-5_47 |
0.303 |
|
1990 |
KENYON C, YAO AC. ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS International Journal of Foundations of Computer Science. 1: 1-10. DOI: 10.1142/S0129054190000023 |
0.322 |
|
1989 |
Yao AC. On the complexity of partial order productions Siam Journal On Computing. 18: 679-689. DOI: 10.1137/0218047 |
0.367 |
|
1988 |
Yao AC. Monotone Bipartite Graph Properties are Evasive Siam Journal On Computing. 17: 517-520. DOI: 10.1137/0217031 |
0.317 |
|
1985 |
Yao AC. On the Complexity of Maintaining Partial Sums Siam Journal On Computing. 14: 277-288. DOI: 10.1137/0214022 |
0.434 |
|
1985 |
Yao AC. On the Expected Performance of Path Compression Algorithms Siam Journal On Computing. 14: 129-133. DOI: 10.1137/0214010 |
0.357 |
|
1985 |
Yao AC. On optimal arrangements of keys with double hashing Journal of Algorithms. 6: 253-264. DOI: 10.1016/0196-6774(85)90042-2 |
0.416 |
|
1982 |
Yao AC. On Parallel Computation for the Knapsack Problem Journal of the Acm (Jacm). 29: 898-903. DOI: 10.1145/322326.322342 |
0.372 |
|
1982 |
Yao AC. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems Siam Journal On Computing. 11: 721-736. DOI: 10.1137/0211059 |
0.408 |
|
1982 |
Yao AC, Yao FF. On the Average-Case Complexity of Selecting the kth Best Siam Journal On Computing. 11: 428-447. DOI: 10.1137/0211034 |
0.402 |
|
1982 |
Sedgewick R, Szymanski TG, Yao AC. The Complexity of Finding Cycles in Periodic Functions Siam Journal On Computing. 11: 376-390. DOI: 10.1137/0211030 |
0.341 |
|
1982 |
Yao AC. On the time-space tradeoff for sorting with linear queries Theoretical Computer Science. 19: 203-218. DOI: 10.1016/0304-3975(82)90060-3 |
0.341 |
|
1982 |
Michael Steele J, Yao AC. Lower bounds for algebraic decision trees Journal of Algorithms. 3: 1-8. DOI: 10.1016/0196-6774(82)90002-5 |
0.358 |
|
1981 |
Yao AC. A Lower Bound to Finding Convex Hulls Journal of the Acm (Jacm). 28: 780-787. DOI: 10.1145/322276.322289 |
0.432 |
|
1981 |
Yao AC. Should Tables Be Sorted? Journal of the Acm (Jacm). 28: 615-628. DOI: 10.1145/322261.322274 |
0.391 |
|
1980 |
Bentley JL, Weide BW, Yao AC. Optimal Expected-Time Algorithms for Closest Point Problems Acm Transactions On Mathematical Software (Toms). 6: 563-580. DOI: 10.1145/355921.355927 |
0.354 |
|
1980 |
Graham RL, Yao AC, Yao FF. Information Bounds Are Weak in the Shortest Distance Problem Journal of the Acm (Jacm). 27: 428-444. DOI: 10.1145/322203.322206 |
0.428 |
|
1980 |
Yao AC. New Algorithms for Bin Packing Journal of the Acm (Jacm). 27: 207-227. DOI: 10.1145/322186.322187 |
0.365 |
|
1980 |
Lipton RJ, Rosenberg AL, Yao AC. External Hashing Schemes for Collections of Data Structures Journal of the Acm (Jacm). 27: 81-95. DOI: 10.1145/322169.322177 |
0.328 |
|
1980 |
Graham RL, Yao AC, Yao FF. Some Monotonicity Properties of Partial Orders Siam Journal On Algebraic Discrete Methods. 1: 251-258. DOI: 10.1137/0601028 |
0.317 |
|
1980 |
Yao AC. Bounds on Selection Networks Siam Journal On Computing. 9: 566-582. DOI: 10.1137/0209043 |
0.301 |
|
1980 |
Yao AC, Rivest RL. On the Polyhedral Decision Problem Siam Journal On Computing. 9: 343-347. DOI: 10.1137/0209028 |
0.382 |
|
1980 |
Coffman EG, So K, Hofri M, Yao AC. A stochastic model of bin-packing Information and Control. 44: 105-115. DOI: 10.1016/S0019-9958(80)90050-9 |
0.302 |
|
1980 |
Yao AC. An analysis of (h, k, 1)-Shellsort Journal of Algorithms. 1: 14-50. DOI: 10.1016/0196-6774(80)90003-6 |
0.335 |
|
1979 |
Tarjan RE, Yao AC. Storing a sparse table Communications of the Acm. 22: 606-611. DOI: 10.1145/359168.359175 |
0.41 |
|
1979 |
Yao AC. The Complexity of Pattern Matching for a Random String Siam Journal On Computing. 8: 368-387. DOI: 10.1137/0208029 |
0.335 |
|
1978 |
Yao AC. On the Loop Switching Addressing Problem Siam Journal On Computing. 7: 515-523. DOI: 10.1137/0207041 |
0.371 |
|
1978 |
Yao AC. On random 2?3 trees Acta Informatica. 9: 159-170. DOI: 10.1007/Bf00289075 |
0.397 |
|
1977 |
Yao AC, Avis DH, Rivest RL. An Ω(n2 n) Lower Bound to the Shortest Paths Problem Proceedings of the Annual Acm Symposium On Theory of Computing. 2: 11-17. DOI: 10.1145/800105.803391 |
0.333 |
|
1976 |
Yao AC. On the Evaluation of Powers Siam Journal On Computing. 5: 100-103. DOI: 10.1137/0205008 |
0.412 |
|
1976 |
Yao AC. On a problem of Katona on minimal separating systems Discrete Mathematics. 15: 193-199. DOI: 10.1016/0012-365X(76)90085-6 |
0.392 |
|
1975 |
Yao AC, Knuth DE. Analysis of the subtractive algorithm for greatest common divisors. Proceedings of the National Academy of Sciences of the United States of America. 72: 4720-2. PMID 16592294 DOI: 10.1073/Pnas.72.12.4720 |
0.43 |
|
Show low-probability matches. |