Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing-Yang Kao
Person information
- affiliation: Northwestern University, Illinois, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j69]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
:
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis. J. Comb. Optim. 33(2): 496-529 (2017)- 2016
- [j68]Chuan-Ju Wang, Ming-Yang Kao:
Optimal search for parameters in Monte Carlo simulation for derivative pricing. Eur. J. Oper. Res. 249(2): 683-690 (2016) - [e4]Ming-Yang Kao:
Encyclopedia of Algorithms - 2016 Edition. Springer 2016, ISBN 978-1-4939-2863-7 [contents] - [r1]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Haplotype Inference on Pedigrees Without Recombinations. Encyclopedia of Algorithms 2016: 894-897 - 2015
- [j67]Hyi-Cheng Tsai, Chin-Laung Lei, Jan-Ming Ho, Ming-Yang Kao, Szu-Lang Liao:
Outstanding Principal as Prepayment Value: A Closed-Form Formula for Mortgage Pricing. J. Inf. Sci. Eng. 31(3): 925-942 (2015) - 2014
- [j66]Bryant Chen, William W. Y. Hsu, Jan-Ming Ho, Ming-Yang Kao:
Linear-time accurate lattice algorithms for tail conditional expectation. Algorithmic Finance 3(1-2): 87-140 (2014) - [c84]Chuan-Ju Wang, Ming-Yang Kao:
Optimal search for parameters in Monte Carlo simulation for derivative pricing. CIFEr 2014: 384-390 - [i40]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
Computing Minimum Tile Sets to Self-Assemble Colors Patterns. CoRR abs/1404.2962 (2014) - [i39]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis. CoRR abs/1409.1619 (2014) - 2013
- [j65]Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic polynomial-time algorithms for designing short DNA words. Theor. Comput. Sci. 494: 144-160 (2013) - [c83]William W. Y. Hsu, Cheng-Yu Lu, Ming-Yang Kao, Jan-Ming Ho:
Optimum quantizing of monotonic nondecreasing arrays. CIFEr 2013: 95-101 - [c82]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
Computing Minimum Tile Sets to Self-Assemble Color Patterns. ISAAC 2013: 699-710 - 2012
- [c81]William W. Y. Hsu, Cheng-Yu Lu, Ming-Yang Kao, Yuh-Dauh Lyuu, Jan-Ming Ho:
Pricing discrete Asian barrier options on lattices. CIFEr 2012: 1-8 - [c80]Hsin-Tsung Peng, Chi-Fang Chang, Szu-Lang Liao, Ming-Yang Kao, Feipei Lai, Jan-Ming Ho:
The development of a real-time valuation service of financial derivatives. CIFEr 2012: 1-8 - [c79]Yi-Cheng Tsai, Zheng-Hui Chen, Jan-Ming Ho, Ming-Yang Kao, Chin-Laung Lei, Szu-Lang Liao:
Closed-form mortgage pricing formula with outstanding principal as prepayment value. CIFEr 2012: 1-7 - [i38]Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. CoRR abs/1201.6358 (2012) - [i37]Ho-Lin Chen, Ming-Yang Kao:
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-Assembly Systems. CoRR abs/1210.5786 (2012) - 2011
- [j64]Bin Fu, Ming-Yang Kao, Lusheng Wang:
Discovering almost any hidden motif from multiple sequences. ACM Trans. Algorithms 7(2): 26:1-26:18 (2011) - [i36]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On Approximating Four Covering and Packing Problems. CoRR abs/1102.1006 (2011) - 2010
- [j63]Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuan Shih, Ming-Yang Kao:
Testing Whether a Set of Code Words Satisfies a Given Set of Constraints. J. Inf. Sci. Eng. 26(2): 333-346 (2010) - [c78]Ho-Lin Chen, Ming-Yang Kao:
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems. DNA 2010: 13-24 - [c77]Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. TAMC 2010: 308-319
2000 – 2009
- 2009
- [j62]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On approximating four covering and packing problems. J. Comput. Syst. Sci. 75(5): 287-302 (2009) - [j61]Ming-Yang Kao, Manan Sanghi:
An approximation algorithm for a bottleneck traveling salesman problem. J. Discrete Algorithms 7(3): 315-326 (2009) - [j60]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM J. Comput. 38(6): 2179-2197 (2009) - [j59]Bin Fu, Ming-Yang Kao, Lusheng Wang:
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences. SIAM J. Discret. Math. 23(4): 1715-1737 (2009) - [j58]Ming-Yang Kao, Manan Sanghi, Robert T. Schweller:
Randomized fast design of short DNA words. ACM Trans. Algorithms 5(4): 43:1-43:24 (2009) - [c76]Kerui Min, Ming-Yang Kao, Hong Zhu:
The Closest Pair Problem under the Hamming Metric. COCOON 2009: 205-214 - [c75]Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu:
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). ISAAC 2009: 1195-1204 - [c74]Bin Fu, Ming-Yang Kao, Lusheng Wang:
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. TAMC 2009: 231-240 - 2008
- [j57]Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You:
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability. Algorithms Mol. Biol. 3 (2008) - [c73]Ming-Yang Kao, Robert T. Schweller:
Randomized Self-assembly for Approximate Shapes. ICALP (1) 2008: 370-384 - [c72]Bin Fu, Ming-Yang Kao, Lusheng Wang:
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. TAMC 2008: 234-245 - [e3]Ming-Yang Kao:
Encyclopedia of Algorithms - 2008 Edition. Springer 2008, ISBN 978-0-387-30770-1 [contents] - 2007
- [j56]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang:
On constructing an optimal consensus clustering from multiple clusterings. Inf. Process. Lett. 104(4): 137-145 (2007) - [j55]Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Average case analysis for tree labelling schemes. Theor. Comput. Sci. 378(3): 271-291 (2007) - [j54]Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik:
Reversible sketches: enabling monitoring and analysis over high-speed data streams. IEEE/ACM Trans. Netw. 15(5): 1059-1072 (2007) - [c71]Jia Wang, Ming-Yang Kao, Hai Zhou:
Address generation for nanowire decoders. ACM Great Lakes Symposium on VLSI 2007: 525-528 - [c70]Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Using Nash Implementation to Achieve Better Frugality Ratios. ISAAC 2007: 377-389 - [c69]Yan Gao, Yao Zhao, Robert T. Schweller, Shobha Venkataraman, Yan Chen, Dawn Xiaodong Song, Ming-Yang Kao:
Detecting Stealthy Spreaders Using Online Outdegree Histograms. IWQoS 2007: 145-153 - [e2]Ming-Yang Kao, Xiang-Yang Li:
Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings. Lecture Notes in Computer Science 4508, Springer 2007, ISBN 978-3-540-72868-9 [contents] - 2006
- [c68]Ming-Yang Kao:
Algorithmic DNA Self-assembly. AAIM 2006: 10 - [c67]Ming-Yang Kao, Manan Sanghi:
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem. CIAC 2006: 223-235 - [c66]Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik:
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications. INFOCOM 2006 - [c65]Ming-Yang Kao, Manan Sanghi, Robert T. Schweller:
Flexible Word Design and Graph Labeling. ISAAC 2006: 48-60 - [c64]Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. ISAAC 2006: 100-110 - [c63]Ming-Yang Kao, Robert T. Schweller:
Reducing tile complexity for self-assembly through temperature programming. SODA 2006: 571-580 - [c62]Zhichun Li, Manan Sanghi, Yan Chen, Ming-Yang Kao, Brian Chavez:
Hamsa: Fast Signature Generation for Zero-day PolymorphicWorms with Provable Attack Resilience. IEEE Symposium on Security and Privacy 2006: 32-47 - [c61]Bethany Man-Yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees Without Recombinations. WABI 2006: 56-67 - [i35]Ming-Yang Kao, Manan Sanghi, Robert T. Schweller:
Randomized Fast Design of Short DNA Words. CoRR abs/cs/0601084 (2006) - [i34]Ming-Yang Kao, Robert T. Schweller:
Reducing Tile Complexity for Self-Assembly Through Temperature Programming. CoRR abs/cs/0602010 (2006) - 2005
- [j53]Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu:
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. J. Comput. Syst. Sci. 70(2): 128-144 (2005) - [j52]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2): 145-162 (2005) - [j51]Gagan Aggarwal, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao, Pablo Moisset de Espanés, Robert T. Schweller:
Complexities for Generalized Models of Self-Assembly. SIAM J. Comput. 34(6): 1493-1515 (2005) - [j50]Tsan-sheng Hsu, Ming-Yang Kao:
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. SIAM J. Discret. Math. 19(2): 345-362 (2005) - [c60]Ming-Yang Kao, Manan Sanghi, Robert T. Schweller:
Randomized Fast Design of Short DNA Words. ICALP 2005: 1275-1286 - [c59]Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Average Case Analysis for Tree Labelling Schemes. ISAAC 2005: 136-145 - [c58]Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
Towards truthful mechanisms for binary demand games: a general framework. EC 2005: 213-222 - 2004
- [j49]Wing-Kai Hon, Tak Wah Lam, Siu-Ming Yiu, Ming-Yang Kao, Wing-Kin Sung:
Subtree Transfer Distance For Degree-D Phylogenies. Int. J. Found. Comput. Sci. 15(6): 893-909 (2004) - [j48]Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu:
Non-shared edges and nearest neighbor interchanges revisited. Inf. Process. Lett. 91(3): 129-134 (2004) - [j47]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. J. Comput. Biol. 11(4): 766-785 (2004) - [j46]Karhan Akcoglu, Petros Drineas, Ming-Yang Kao:
Fast Universalization of Investment Strategies. SIAM J. Comput. 34(1): 1-22 (2004) - [c57]Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller:
Complexities for generalized models of self-assembly. SODA 2004: 880-889 - [c56]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 - 2003
- [j45]Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu:
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. J. Comput. Biol. 10(6): 981-995 (2003) - [j44]Ming-Yang Kao, Jared Samet, Wing-Kin Sung:
The Enhanced Double Digest Problem for DNA Physical Mapping. J. Comb. Optim. 7(1): 69-78 (2003) - [j43]Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs. SIAM J. Comput. 32(2): 408-434 (2003) - 2002
- [j42]James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. J. Comput. Biol. 9(5): 721-741 (2002) - [c55]Karhan Akcoglu, Petros Drineas, Ming-Yang Kao:
Fast Universalization of Investment Strategies with Provably Good Relative Returns. ICALP 2002: 888-900 - [c54]Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu:
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. WABI 2002: 157-171 - [c53]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. WABI 2002: 419-433 - [i33]Karhan Akcoglu, Petros Drineas, Ming-Yang Kao:
Fast Universalization of Investment Strategies with Provably Good Relative Returns. CoRR cs.CE/0204019 (2002) - [i32]Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu:
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications. CoRR cs.DS/0207026 (2002) - [i31]Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu:
Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers. CoRR cs.DS/0211009 (2002) - 2001
- [j41]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. J. Algorithms 40(2): 212-233 (2001) - [j40]Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church:
A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. J. Comput. Biol. 8(3): 325-337 (2001) - [j39]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Decomposition Theorem for Maximum Weight Bipartite Matchings. SIAM J. Comput. 31(1): 18-26 (2001) - [j38]Miklós Csürös, Ming-Yang Kao:
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. SIAM J. Comput. 31(1): 306-322 (2001) - [j37]Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong:
Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. SIAM J. Comput. 31(2): 447-459 (2001) - [j36]Wen-Lian Hsu, Ming-Yang Kao:
Selected papers from COCOON 1998 - Foreword. Theor. Comput. Sci. 261(2): 211 (2001) - [j35]Ming-Yang Kao, Jie Wang:
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees. Theor. Comput. Sci. 262(1): 101-115 (2001) - [c52]Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu:
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. BIBE 2001: 183-190 - [c51]Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan:
Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options. ESA 2001: 404-415 - [c50]Jyh-Shing Roger Jang, Hong-Ru Lee, Ming-Yang Kao:
Content-based Music Retrieval Using Linear Scaling and Branch-and-bound Tree Search. ICME 2001 - [c49]James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. ISAAC 2001: 403-415 - [c48]Ming-Yang Kao, Vijay Ramachandran:
DNA Self-Assembly For Constructing 3D Boxes. ISAAC 2001: 429-440 - [c47]James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar:
Towards understanding the predictability of stock markets from the perspective of computational complexity. SODA 2001: 745-754 - [i30]Ming-Yang Kao, Vijay Ramachandran:
DNA Self-Assembly For Constructing 3D Boxes. CoRR cs.CC/0112009 (2001) - [i29]James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah:
Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. CoRR cs.CE/0101015 (2001) - [i28]Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church:
A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. CoRR cs.CE/0101016 (2001) - [i27]Ming-Yang Kao:
Tree Contractions and Evolutionary Trees. CoRR cs.CE/0101030 (2001) - [i26]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees. CoRR cs.CE/0101031 (2001) - [i25]Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan:
Fast Pricing of European Asian Options with Provable Accuracy: Single-stock and Basket Options. CoRR cs.CE/0102003 (2001) - [i24]Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu:
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. CoRR cs.CE/0102008 (2001) - [i23]Ming-Yang Kao, Jared Samet, Wing-Kin Sung:
The Enhanced Double Digest Problem for DNA Physical Mapping. CoRR cs.CE/0102010 (2001) - [i22]Ming-Yang Kao, Andreas Nolte, Stephen R. Tate:
The Risk Profile Problem for Stock Portfolio Optimization. CoRR cs.CE/0107007 (2001) - [i21]Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu:
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. CoRR cs.CE/0111051 (2001) - [i20]Ming-Yang Kao:
Total Protection of Analytic Invariant Information in Cross Tabulated Tables. CoRR cs.CR/0101032 (2001) - [i19]Ming-Yang Kao:
Data Security Equals Graph Connectivity. CoRR cs.CR/0101034 (2001) - [i18]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. CoRR cs.CV/0101010 (2001) - [i17]Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. CoRR cs.DM/0101028 (2001) - [i16]Xin He, Ming-Yang Kao, Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. CoRR cs.DS/0101021 (2001) - [i15]Ming-Yang Kao, Stephen R. Tate:
On-Line Difference Maximization. CoRR cs.DS/0101024 (2001) - [i14]Xin He, Ming-Yang Kao, Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. CoRR cs.DS/0101033 (2001) - [i13]Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu:
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. CoRR cs.DS/0102005 (2001) - [i12]Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs. CoRR cs.DS/0102007 (2001) - [i11]Tsan-sheng Hsu, Ming-Yang Kao:
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. CoRR cs.DS/0102009 (2001) - [i10]Ming-Yang Kao:
Multiple-Size Divide-and-Conquer Recurrences. CoRR cs.GL/0101011 (2001) - 2000
- [j34]Zhi-Zhong Chen, Ming-Yang Kao:
Reducing Randomness via Irrational Numbers. SIAM J. Comput. 29(4): 1247-1256 (2000) - [j33]Ming-Yang Kao, Jie Wang:
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors. SIAM J. Comput. 29(5): 1568-1576 (2000) - [j32]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees. SIAM J. Comput. 30(2): 602-624 (2000) - [j31]Xin He, Ming-Yang Kao, Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. SIAM J. Comput. 30(3): 838-846 (2000) - [c46]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Faster and Unifying Algorithm for Comparing Trees. CPM 2000: 129-142 - [c45]Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu:
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. ISAAC 2000: 84-95 - [c44]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. ISAAC 2000: 479-490 - [c43]Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam:
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. ISAAC 2000: 527-538 - [c42]Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church:
A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. SODA 2000: 389-398 - [c41]Ming-Yang Kao, Andreas Nolte, Stephen R. Tate:
The risk profile problem for stock portfolio optimization (extended abstract). STOC 2000: 228-234 - [c40]Ming-Yang Kao, Jared Samet, Wing-Kin Sung:
The Enhanced Double Digest Problem for DNA Physical Mapping. SWAT 2000: 383-392 - [i9]