☰

Ming-Yang Kao - Publications

Affiliations: 
Yale University, New Haven, CT 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

48 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Wang CJ, Kao MY. Optimal search for parameters in Monte Carlo simulation for derivative pricing European Journal of Operational Research. 249: 683-690. DOI: 10.1016/J.Ejor.2015.08.060  0.386
2011 Fu B, Kao M, Wang L. Discovering almost any hidden motif from multiple sequences Acm Transactions On Algorithms. 7: 26. DOI: 10.1145/1921659.1921672  0.322
2010 Kao M, Li X, Wang W. WITHDRAWN: A 6-approximation algorithm for computing the least common AoN-supertree with applications in the reconstruction of glycan trees Theoretical Computer Science. DOI: 10.1016/J.Tcs.2010.07.012  0.386
2009 Fu B, Kao M, Wang L. Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences Siam Journal On Discrete Mathematics. 23: 1715-1737. DOI: 10.1137/080720401  0.371
2009 Chan MY, Chan W, Chin FYL, Fung SPY, Kao M. Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops Siam Journal On Computing. 38: 2179-2197. DOI: 10.1137/080680990  0.426
2009 Ashley M, Berger-Wolf T, Berman P, Chaovalitwongse W, DasGupta B, Kao MY. On approximating four covering and packing problems Journal of Computer and System Sciences. 75: 287-302. DOI: 10.1016/J.Jcss.2009.01.002  0.396
2007 Berman P, DasGupta B, Kao M, Wang J. On constructing an optimal consensus clustering from multiple clusterings Information Processing Letters. 104: 137-145. DOI: 10.1016/J.Ipl.2007.06.008  0.327
2006 Bertone P, Trifonov V, Rozowsky JS, Schubert F, Emanuelsson O, Karro J, Kao MY, Snyder M, Gerstein M. Design optimization methods for genomic DNA tiling arrays. Genome Research. 16: 271-81. PMID 16365382 DOI: 10.1101/Gr.4452906  0.325
2005 Kao MY, Sanghi M, Schweller R. Randomized fast design of short DNA words Lecture Notes in Computer Science. 3580: 1275-1286. DOI: 10.1145/1597036.1597047  0.361
2005 Hsu T, Kao M. Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time Siam Journal On Discrete Mathematics. 19: 345-362. DOI: 10.1137/S0895480196303216  0.462
2005 Akcoglu K, Drineas P, Kao MY. Fast universalisation of investment strategies Siam Journal On Computing. 34: 1-22. DOI: 10.1137/S0097539702405619  0.378
2005 Berman P, DasGupta B, Kao M. Tight approximability results for test set problems in bioinformatics Journal of Computer and System Sciences. 71: 145-162. DOI: 10.1016/J.Jcss.2005.02.001  0.334
2005 Goldwasser MH, Kao M, Lu H. Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications Journal of Computer and System Sciences. 70: 128-144. DOI: 10.1016/J.Jcss.2004.08.001  0.414
2004 Berman P, Bertone P, Dasgupta B, Gerstein M, Kao MY, Snyder M. Fast optimal genome tiling with applications to microarray design and homology search. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 11: 766-85. PMID 15579244 DOI: 10.1089/Cmb.2004.11.766  0.417
2004 Hon W, Lam TW, Yiu S, Kao M, Sung W. Subtree Transfer Distance for Degree-d Phylogenies International Journal of Foundations of Computer Science. 15: 893-909. DOI: 10.1142/S0129054104002807  0.342
2004 Aggarwal G, Goldwasser MH, Kao MY, Schweller RT. Complexities for Generalized Models of Self-Assembly Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 873-882. DOI: 10.1137/S0097539704445202  0.353
2004 Hon W, Kao M, Lam T, Sung W, Yiu S. Non-shared edges and nearest neighbor interchanges revisited Information Processing Letters. 91: 129-134. DOI: 10.1016/J.Ipl.2004.04.003  0.42
2003 Chen Z, He X, Kao M. Common-Face Embeddings of Planar Graphs Siam Journal On Computing. 32: 408-434. DOI: 10.1137/S009753970037775X  0.374
2002 Aspnes J, Hartling J, Kao MY, Kim J, Shah G. A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 9: 721-41. PMID 12487760 DOI: 10.1089/106652702761034154  0.313
2002 Kao M, Lam T, Sung W, Ting H. A Decomposition Theorem for Maximum Weight Bipartite Matchings Siam Journal On Computing. 31: 18-26. DOI: 10.1137/S0097539799361208  0.364
2002 Chen G, Kao M, Lyuu Y, Wong H. Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns Siam Journal On Computing. 31: 447-459. DOI: 10.1137/S0097539799358847  0.369
2002 Csurös M, Kao M. Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets Siam Journal On Computing. 31: 306-322. DOI: 10.1137/S009753970037905X  0.405
2001 Kao M, Wang J. Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees Theoretical Computer Science. 262: 101-115. DOI: 10.1016/S0304-3975(00)00183-3  0.389
2001 Kao M, Lam T, Sung W, Ting H. An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings Journal of Algorithms. 40: 212-233. DOI: 10.1006/Jagm.2001.1163  0.439
2000 He X, Kao M, Lu H. A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs Siam Journal On Computing. 30: 838-846. DOI: 10.1137/S0097539799359117  0.391
2000 Chen ZZ, Kao MY. Reducing randomness via irrational numbers Siam Journal On Computing. 29: 1247-1256. DOI: 10.1137/S0097539798341600  0.435
2000 Kao M, Wang J. Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors Siam Journal On Computing. 29: 1568-1576. DOI: 10.1137/S0097539798341594  0.391
2000 Kao M, Lam T, Sung W, Ting H. Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees Siam Journal On Computing. 30: 602-624. DOI: 10.1137/S0097539797332275  0.471
1999 He X, Kao M, Lu H. Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings Siam Journal On Discrete Mathematics. 12: 317-325. DOI: 10.1137/S0895480197325031  0.341
1999 Kao M, Tate SR. On-Line Difference Maximization Siam Journal On Discrete Mathematics. 12: 78-90. DOI: 10.1137/S0895480196307445  0.37
1999 Kao M, Qi J, Tan L. Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions Siam Journal On Computing. 28: 955-969. DOI: 10.1137/S0097539796305377  0.406
1998 Kao M, Occhiogrosso N, Teng S. Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs Journal of Combinatorial Optimization. 2: 351-359. DOI: 10.1023/A:1009720402326  0.383
1998 Kao M, Ma Y, Sipser M, Yin Y. Optimal Constructions of Hybrid Algorithms Journal of Algorithms. 29: 142-164. DOI: 10.1006/Jagm.1998.0959  0.415
1997 Kao MY. Tree contractions and evolutionary trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1203: 299-310. DOI: 10.1137/S0097539795283504  0.4
1997 Kao MY. Total protection of analytic-invariant information in cross-tabulated tables Siam Journal On Computing. 26: 231-242. DOI: 10.1137/S0097539793253589  0.345
1997 Kao MY. Efficient detection and protection of information in cross tabulated tables II: Minimal linear invariants Journal of Combinatorial Optimization. 1: 187-202. DOI: 10.1023/A:1009712000657  0.364
1996 Kao MY. Data security equals graph connectivity Siam Journal On Discrete Mathematics. 9: 87-100. DOI: 10.1137/S0895480193243274  0.322
1996 Kao MY, Reif JH, Tate SR. Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem Information and Computation. 131: 63-79. DOI: 10.1006/Inco.1996.0092  0.429
1995 Kao M. Planar Strong Connectivity Helps in Parallel Depth-First Search Siam Journal On Computing. 24: 46-62. DOI: 10.1137/S0097539792227077  0.45
1995 Ho C, Kao M. Optimal broadcast in all-port wormhole-routed hypercubes Ieee Transactions On Parallel and Distributed Systems. 6: 200-204. DOI: 10.1109/71.342134  0.416
1995 Kao MY. Linear-time optimal augmentation for componentwise bipartite-completeness of graphs Information Processing Letters. 54: 59-63. DOI: 10.1016/0020-0190(94)00229-R  0.371
1993 Kao M, Shannon GE. Linear-processor NC algorithms for planar directed graphs II: directed spanning trees Siam Journal On Computing. 22: 460-481. DOI: 10.1137/0222033  0.472
1993 Kao M. Linear-processor NC algorithms for planar directed graphs I: strongly connected components Siam Journal On Computing. 22: 431-459. DOI: 10.1137/0222032  0.487
1993 Cheriyan J, Kao M, Thurimella R. Scan-first search and sparse certificates: an improved parallel algorithm for k -vertex connectivity Siam Journal On Computing. 22: 157-174. DOI: 10.1137/0222013  0.432
1993 Kao MY, Klein PN. Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs Journal of Computer and System Sciences. 47: 459-500. DOI: 10.1016/0022-0000(93)90042-U  0.37
1992 Kao MY, Wan F. Not all planar diagraphs have small cycle separators Information Processing Letters. 44: 79-83. DOI: 10.1016/0020-0190(92)90189-3  0.357
1991 Kao MY, Tate SR. Online matching with blocked input Information Processing Letters. 38: 113-116. DOI: 10.1016/0020-0190(91)90231-6  0.453
1990 Aggarwal A, Anderson RJ, Kao M. Parallel depth-first search in general directed graphs Siam Journal On Computing. 19: 397-409. DOI: 10.1137/0219025  0.413
Show low-probability matches.