Ming-Yang Kao - RankMe

198 papers A* 25A 8B 23C 11Misc 4Journal 109Unranked 15

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis. J. Comb. Optim. Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
2016	—	`book`	Encyclopedia of Algorithms - 2016 Edition Ming-Yang Kao
2016	—	`ch.`	Haplotype Inference on Pedigrees Without Recombinations. Encyclopedia of Algorithms Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao
2016	J	`jnl`	Optimal search for parameters in Monte Carlo simulation for derivative pricing. Eur. J. Oper. Res. Chuan-Ju Wang, Ming-Yang Kao
2015	J	`jnl`	Outstanding Principal as Prepayment Value: A Closed-Form Formula for Mortgage Pricing. J. Inf. Sci. Eng. Hyi-Cheng Tsai, Chin-Laung Lei, Jan-Ming Ho, Ming-Yang Kao, Szu-Lang Liao
2014	J	`jnl`	A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis. CoRR Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
2014	J	`jnl`	Computing Minimum Tile Sets to Self-Assemble Colors Patterns. CoRR Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
2014	J	`jnl`	Linear-time accurate lattice algorithms for tail conditional expectation. Algorithmic Finance Bryant Chen, William W. Y. Hsu, Jan-Ming Ho, Ming-Yang Kao
2014	—	`conf`	Optimal search for parameters in Monte Carlo simulation for derivative pricing. CIFEr Chuan-Ju Wang, Ming-Yang Kao
2013	B	`conf`	Computing Minimum Tile Sets to Self-Assemble Color Patterns. ISAAC Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
2013	J	`jnl`	Deterministic polynomial-time algorithms for designing short DNA words. Theor. Comput. Sci. Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
2013	—	`conf`	Optimum quantizing of monotonic nondecreasing arrays. CIFEr William W. Y. Hsu, Cheng-Yu Lu, Ming-Yang Kao, Jan-Ming Ho
2012	—	`conf`	Closed-form mortgage pricing formula with outstanding principal as prepayment value. CIFEr Yi-Cheng Tsai, Zheng-Hui Chen, Jan-Ming Ho, Ming-Yang Kao, Chin-Laung Lei, Szu-Lang Liao
2012	J	`jnl`	Deterministic Polynomial-Time Algorithms for Designing Short DNA Words CoRR Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
2012	J	`jnl`	Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-Assembly Systems CoRR Ho-Lin Chen, Ming-Yang Kao
2012	—	`conf`	Pricing discrete Asian barrier options on lattices. CIFEr William W. Y. Hsu, Cheng-Yu Lu, Ming-Yang Kao, Yuh-Dauh Lyuu, Jan-Ming Ho
2012	—	`conf`	The development of a real-time valuation service of financial derivatives. CIFEr Hsin-Tsung Peng, Chi-Fang Chang, Szu-Lang Liao, Ming-Yang Kao, Feipei Lai, Jan-Ming Ho
2011	J	`jnl`	Discovering almost any hidden motif from multiple sequences. ACM Trans. Algorithms Bin Fu, Ming-Yang Kao, Lusheng Wang
2011	J	`jnl`	On Approximating Four Covering and Packing Problems CoRR Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao
2010	C	`conf`	Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. TAMC Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
2010	B	`conf`	Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems. DNA Ho-Lin Chen, Ming-Yang Kao
2010	J	`jnl`	Testing Whether a Set of Code Words Satisfies a Given Set of Constraints. J. Inf. Sci. Eng. Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuan Shih, Ming-Yang Kao
2009	J	`jnl`	An approximation algorithm for a bottleneck traveling salesman problem. J. Discrete Algorithms Ming-Yang Kao, Manan Sanghi
2009	C	`conf`	Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. TAMC Bin Fu, Ming-Yang Kao, Lusheng Wang
2009	J	`jnl`	Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM J. Comput. Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao
2009	J	`jnl`	On approximating four covering and packing problems. J. Comput. Syst. Sci. Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao
2009	J	`jnl`	Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences. SIAM J. Discret. Math. Bin Fu, Ming-Yang Kao, Lusheng Wang
2009	J	`jnl`	Randomized fast design of short DNA words. ACM Trans. Algorithms Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
2009	Misc	`conf`	The Closest Pair Problem under the Hamming Metric. COCOON Kerui Min, Ming-Yang Kao, Hong Zhu
2009	B	`conf`	Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). ISAAC Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu
2008	C	`conf`	Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. TAMC Bin Fu, Ming-Yang Kao, Lusheng Wang
2008	—	`book`	Encyclopedia of Algorithms - 2008 Edition Ming-Yang Kao
2008	—	`conf`	Randomized Self-assembly for Approximate Shapes. ICALP (1) Ming-Yang Kao, Robert T. Schweller
2008	J	`jnl`	Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability. Algorithms Mol. Biol. Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
2007	—	`conf`	Address generation for nanowire decoders. ACM Great Lakes Symposium on VLSI Jia Wang, Ming-Yang Kao, Hai Zhou
2007	C	`ed.`	Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings AAIM Ming-Yang Kao, Xiang-Yang Li
2007	J	`jnl`	Average case analysis for tree labelling schemes. Theor. Comput. Sci. Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
2007	B	`conf`	Detecting Stealthy Spreaders Using Online Outdegree Histograms. IWQoS Yan Gao, Yao Zhao, Robert T. Schweller, Shobha Venkataraman, Yan Chen, Dawn Xiaodong Song, Ming-Yang Kao
2007	J	`jnl`	On constructing an optimal consensus clustering from multiple clusterings. Inf. Process. Lett. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang
2007	J	`jnl`	Reversible sketches: enabling monitoring and analysis over high-speed data streams. IEEE/ACM Trans. Netw. Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik
2007	B	`conf`	Using Nash Implementation to Achieve Better Frugality Ratios. ISAAC Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
2006	B	`conf`	A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. ISAAC Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
2006	C	`conf`	Algorithmic DNA Self-assembly. AAIM Ming-Yang Kao
2006	C	`conf`	An Approximation Algorithm for a Bottleneck Traveling Salesman Problem. CIAC Ming-Yang Kao, Manan Sanghi
2006	B	`conf`	Flexible Word Design and Graph Labeling. ISAAC Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
2006	—	`conf`	Hamsa: Fast Signature Generation for Zero-day PolymorphicWorms with Provable Attack Resilience. S&P Zhichun Li, Manan Sanghi, Yan Chen, Ming-Yang Kao, Brian Chavez
2006	C	`conf`	Linear-Time Haplotype Inference on Pedigrees Without Recombinations. WABI Bethany Man-Yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao
2006	J	`jnl`	Randomized Fast Design of Short DNA Words CoRR Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
2006	J	`jnl`	Reducing Tile Complexity for Self-Assembly Through Temperature Programming CoRR Ming-Yang Kao, Robert T. Schweller
2006	A*	`conf`	Reducing tile complexity for self-assembly through temperature programming. SODA Ming-Yang Kao, Robert T. Schweller
2006	A*	`conf`	Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications. INFOCOM Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik
2005	B	`conf`	Average Case Analysis for Tree Labelling Schemes. ISAAC Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
2005	J	`jnl`	Complexities for Generalized Models of Self-Assembly. SIAM J. Comput. Gagan Aggarwal, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao, Pablo Moisset de Espanés, Robert T. Schweller
2005	J	`jnl`	Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. J. Comput. Syst. Sci. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
2005	J	`jnl`	Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. SIAM J. Discret. Math. Tsan-sheng Hsu, Ming-Yang Kao
2005	A*	`conf`	Randomized Fast Design of Short DNA Words. ICALP Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
2005	J	`jnl`	Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
2005	A*	`conf`	Towards truthful mechanisms for binary demand games: a general framework. EC Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
2004	A*	`conf`	Complexities for generalized models of self-assembly. SODA Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller
2004	J	`jnl`	Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. J. Comput. Biol. Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
2004	J	`jnl`	Fast Universalization of Investment Strategies. SIAM J. Comput. Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
2004	J	`jnl`	Non-shared edges and nearest neighbor interchanges revisited. Inf. Process. Lett. Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
2004	J	`jnl`	Subtree Transfer Distance For Degree-D Phylogenies. Int. J. Found. Comput. Sci. Wing-Kai Hon, Tak Wah Lam, Siu-Ming Yiu, Ming-Yang Kao, Wing-Kin Sung
2004	—	`conf`	Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
2003	J	`jnl`	Common-Face Embeddings of Planar Graphs. SIAM J. Comput. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
2003	J	`jnl`	Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. J. Comput. Biol. Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
2003	J	`jnl`	The Enhanced Double Digest Problem for DNA Physical Mapping. J. Comb. Optim. Ming-Yang Kao, Jared Samet, Wing-Kin Sung
2002	J	`jnl`	A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. J. Comput. Biol. James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
2002	C	`conf`	Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. WABI Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
2002	C	`conf`	Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. WABI Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
2002	J	`jnl`	Fast Universalization of Investment Strategies with Provably Good Relative Returns CoRR Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
2002	A*	`conf`	Fast Universalization of Investment Strategies with Provably Good Relative Returns. ICALP Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
2002	J	`jnl`	Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers CoRR Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
2002	J	`jnl`	Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications CoRR Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
2001	B	`conf`	A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. ISAAC James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
2001	J	`jnl`	A Decomposition Theorem for Maximum Weight Bipartite Matchings. SIAM J. Comput. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2001	J	`jnl`	A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry CoRR Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
2001	J	`jnl`	A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. J. Comput. Biol. Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
2001	J	`jnl`	A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs CoRR Xin He, Ming-Yang Kao, Hsueh-I Lu
2001	J	`jnl`	An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings CoRR Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2001	J	`jnl`	An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. J. Algorithms Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2001	J	`jnl`	Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees CoRR Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2001	J	`jnl`	Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model CoRR James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
2001	J	`jnl`	Common-Face Embeddings of Planar Graphs CoRR Zhi-Zhong Chen, Xin He, Ming-Yang Kao
2001	J	`jnl`	Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses CoRR Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
2001	A	`conf`	Content-based Music Retrieval Using Linear Scaling and Branch-and-bound Tree Search. ICME Jyh-Shing Roger Jang, Hong-Ru Lee, Ming-Yang Kao
2001	J	`jnl`	DNA Self-Assembly For Constructing 3D Boxes CoRR Ming-Yang Kao, Vijay Ramachandran
2001	B	`conf`	DNA Self-Assembly For Constructing 3D Boxes. ISAAC Ming-Yang Kao, Vijay Ramachandran
2001	J	`jnl`	Data Security Equals Graph Connectivity CoRR Ming-Yang Kao
2001	A	`conf`	Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options. ESA Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan
2001	J	`jnl`	Fast Pricing of European Asian Options with Provable Accuracy: Single-stock and Basket Options CoRR Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan
2001	J	`jnl`	Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings CoRR Xin He, Ming-Yang Kao, Hsueh-I Lu
2001	J	`jnl`	Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees. Theor. Comput. Sci. Ming-Yang Kao, Jie Wang
2001	J	`jnl`	Multiple-Size Divide-and-Conquer Recurrences CoRR Ming-Yang Kao
2001	J	`jnl`	On-Line Difference Maximization CoRR Ming-Yang Kao, Stephen R. Tate
2001	J	`jnl`	Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time CoRR Tsan-sheng Hsu, Ming-Yang Kao
2001	J	`jnl`	Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets CoRR Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
2001	J	`jnl`	Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. SIAM J. Comput. Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong
2001	J	`jnl`	Optimal Constructions of Hybrid Algorithms CoRR Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
2001	J	`jnl`	Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs CoRR Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
2001	C	`conf`	Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. BIBE Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
2001	J	`jnl`	Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. SIAM J. Comput. Miklós Csürös, Ming-Yang Kao
2001	J	`jnl`	Selected papers from COCOON 1998 - Foreword. Theor. Comput. Sci. Wen-Lian Hsu, Ming-Yang Kao
2001	J	`jnl`	The Enhanced Double Digest Problem for DNA Physical Mapping CoRR Ming-Yang Kao, Jared Samet, Wing-Kin Sung
2001	J	`jnl`	The Risk Profile Problem for Stock Portfolio Optimization CoRR Ming-Yang Kao, Andreas Nolte, Stephen R. Tate
2001	J	`jnl`	Total Protection of Analytic Invariant Information in Cross Tabulated Tables CoRR Ming-Yang Kao
2001	A*	`conf`	Towards understanding the predictability of stock markets from the perspective of computational complexity. SODA James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
2001	J	`jnl`	Tree Contractions and Evolutionary Trees CoRR Ming-Yang Kao
2000	J	`jnl`	A Decomposition Theorem for Maximum Weight Bipartite Matchings CoRR Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2000	J	`jnl`	A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. SIAM J. Comput. Xin He, Ming-Yang Kao, Hsueh-I Lu
2000	B	`conf`	A Faster and Unifying Algorithm for Comparing Trees. CPM Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2000	A*	`conf`	A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. SODA Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
2000	J	`jnl`	Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees. SIAM J. Comput. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
2000	J	`jnl`	Designing Proxies for Stock Market Indices is Computationally Hard CoRR Ming-Yang Kao, Stephen R. Tate
2000	B	`conf`	Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. ISAAC Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam
2000	J	`jnl`	Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors. SIAM J. Comput. Ming-Yang Kao, Jie Wang
2000	J	`jnl`	Opportunity Cost Algorithms for Combinatorial Auctions CoRR Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao
2000	B	`conf`	Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. ISAAC Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
2000	J	`jnl`	Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions CoRR Ming-Yang Kao, Junfeng Qi, Lei Tan
2000	J	`jnl`	Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns CoRR Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong
2000	J	`jnl`	Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets CoRR Miklós Csürös, Ming-Yang Kao
2000	J	`jnl`	Reducing Randomness via Irrational Numbers. SIAM J. Comput. Zhi-Zhong Chen, Ming-Yang Kao
2000	—	`conf`	The Enhanced Double Digest Problem for DNA Physical Mapping. SWAT Ming-Yang Kao, Jared Samet, Wing-Kin Sung
2000	A*	`conf`	The risk profile problem for stock portfolio optimization (extended abstract). STOC Ming-Yang Kao, Andreas Nolte, Stephen R. Tate
2000	J	`jnl`	Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity CoRR James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
2000	B	`conf`	Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. ISAAC Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
1999	A	`conf`	A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees. ESA Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
1999	A	`conf`	A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. ESA Xin He, Ming-Yang Kao, Hsueh-I Lu
1999	A	`conf`	Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. STACS Ming-Yang Kao, Andrzej Lingas, Anna Östlin
1999	A*	`conf`	Designing Proxies for Stock Market Indices is Computationally Hard. SODA Ming-Yang Kao, Stephen R. Tate
1999	J	`jnl`	Guest Editors' Foreword. Algorithmica Dan Gusfield, Ming-Yang Kao
1999	J	`jnl`	Guest Editors' Foreword. Algorithmica Ming-Yang Kao, A. S. Kyle, P. Lakner
1999	J	`jnl`	Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors CoRR Ming-Yang Kao, Jie Wang
1999	J	`jnl`	Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. SIAM J. Discret. Math. Xin He, Ming-Yang Kao, Hsueh-I Lu
1999	A*	`conf`	Nonplanar Topological Inference and Political-Map Graphs. SODA Zhi-Zhong Chen, Xin He, Ming-Yang Kao
1999	A	`conf`	On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees. ESA Ting Chen, Ming-Yang Kao
1999	J	`jnl`	On-Line Difference Maximization. SIAM J. Discret. Math. Ming-Yang Kao, Stephen R. Tate
1999	J	`jnl`	Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. SIAM J. Comput. Ming-Yang Kao, Junfeng Qi, Lei Tan
1999	A*	`conf`	Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. STOC Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong
1999	A*	`conf`	Recovering Evolutionary Trees Through Harmonic Greedy Triplets. SODA Miklós Csürös, Ming-Yang Kao
1999	J	`jnl`	Reducing Randomness via Irrational Numbers CoRR Zhi-Zhong Chen, Ming-Yang Kao
1998	J	`jnl`	A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. J. Comb. Optim. Tsan-sheng Hsu, Ming-Yang Kao
1998	A*	`conf`	Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. ICALP Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
1998	Misc	`ed.`	Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings COCOON Wen-Lian Hsu, Ming-Yang Kao
1998	—	`conf`	Default-Sensitive PreProcessings for Finding Maxima. CATS Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
1998	A*	`conf`	Efficient Minimization of Numerical Summation Errors. ICALP Ming-Yang Kao, Jie Wang
1998	J	`jnl`	Efficient Submesh Permutations in Wormhole-routed meshes. Inf. Sci. Ching-Tien Ho, Ming-Yang Kao
1998	J	`jnl`	Optimal Constructions of Hybrid Algorithms. J. Algorithms Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
1998	J	`jnl`	Optimal On-Line Scheduling of Parallel Jobs with Dependencies. J. Comb. Optim. Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng
1998	J	`jnl`	Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. J. Comb. Optim. Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng
1998	J	`jnl`	Tree Contractions and Evolutionary Trees. SIAM J. Comput. Ming-Yang Kao
1997	B	`conf`	All-Cavity Maximum Matchings. ISAAC Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
1997	J	`jnl`	Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants. J. Comb. Optim. Ming-Yang Kao
1997	A*	`conf`	General Techniques for Comparing Unrooted Evolutionary Trees. STOC Ming-Yang Kao, Tak Wah Lam, Teresa M. Przytycka, Wing-Kin Sung, Hing-Fung Ting
1997	J	`jnl`	Multiple-size divide-and-conquer recurrences. SIGACT News Ming-Yang Kao
1997	A*	`conf`	On-Line Difference Maximization. SODA Ming-Yang Kao, Stephen R. Tate
1997	Misc	`conf`	Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. COCOON Ming-Yang Kao, Junfeng Qi, Lei Tan
1997	A*	`conf`	Reducing Randomness via Irrational Numbers. STOC Zhi-Zhong Chen, Ming-Yang Kao
1997	B	`conf`	Security Problems for Statistical Databases with General Cell Suppressions. SSDBM Tsan-sheng Hsu, Ming-Yang Kao
1997	J	`jnl`	Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables. SIAM J. Comput. Ming-Yang Kao
1997	C	`conf`	Tree Contractions and Evolutionary Trees. CIAC Ming-Yang Kao
1996	J	`jnl`	Data Security Equals Graph Connectivity. SIAM J. Discret. Math. Ming-Yang Kao
1996	B	`conf`	Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract). ISAAC Tsan-sheng Hsu, Ming-Yang Kao
1996	Misc	`conf`	Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. COCOON Tsan-sheng Hsu, Ming-Yang Kao
1996	J	`jnl`	Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. Inf. Comput. Ming-Yang Kao, John H. Reif, Stephen R. Tate
1995	J	`jnl`	An Optimal Parallel Algorithm for Planar Cycle Separators. Algorithmica Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
1995	J	`jnl`	Efficient Broadcast on Hypercubes with Wormhole and E-Cube Routings. Parallel Process. Lett. Ching-Tien Ho, Ming-Yang Kao
1995	J	`jnl`	Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs. Inf. Process. Lett. Ming-Yang Kao
1995	A*	`conf`	Load Balancing in the L FOCS Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
1995	—	`conf`	Minimal Linear Invariants. ASIAN Ming-Yang Kao
1995	B	`conf`	Online Perfect Matching and Mobile Computing. WADS Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
1995	J	`jnl`	Optimal Broadcast in All-Port Wormhole-Routed Hypercubes. IEEE Trans. Parallel Distributed Syst. Ching-Tien Ho, Ming-Yang Kao
1995	J	`jnl`	Planar Strong Connectivity Helps in Parallel Depth-First Search. SIAM J. Comput. Ming-Yang Kao
1994	B	`conf`	Data Compression Techniques for Stock Market Prediction. Data Compression Conference Salman Azhar, Greg J. Badros, Arman Glodjo, Ming-Yang Kao, John H. Reif
1994	—	`conf`	Efficient submesh permutations in wormhole-routed meshes. SPDP Ching-Tien Ho, Ming-Yang Kao
1994	—	`conf`	Optimal Broadcast in All-Port Wormhole-Routed Hypercubes. ICPP (3) Ching-Tien Ho, Ming-Yang Kao
1994	A*	`conf`	Optimal Constructions of Hybrid Algorithms. SODA Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
1994	J	`jnl`	Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discret. Math. Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari
1994	A	`conf`	Regular Edge Labelings and Drawings of Planar Graphs. GD Xin He, Ming-Yang Kao
1994	B	`conf`	Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. ISAAC Ming-Yang Kao, Shang-Hua Teng
1994	A	`conf`	Total Protection of Analytic Invariant Information in Cross Tabulated Tables. STACS Ming-Yang Kao
1993	J	`jnl`	Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. SIAM J. Discret. Math. Ming-Yang Kao, Dan Gusfield
1993	B	`conf`	Improved Parallel Depth-First Search in Undirected Planar Graphs. WADS Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
1993	J	`jnl`	Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components. SIAM J. Comput. Ming-Yang Kao
1993	J	`jnl`	Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees. SIAM J. Comput. Ming-Yang Kao, Gregory E. Shannon
1993	A*	`conf`	Optimal online scheduling of parallel jobs with dependencies. STOC Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng
1993	B	`conf`	Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs. ISAAC Xin He, Ming-Yang Kao
1993	J	`jnl`	Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity. SIAM J. Comput. Joseph Cheriyan, Ming-Yang Kao, Ramakrishna Thurimella
1993	A*	`conf`	Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. SODA Ming-Yang Kao, John H. Reif, Stephen R. Tate
1993	J	`jnl`	Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. J. Comput. Syst. Sci. Ming-Yang Kao, Philip N. Klein
1992	J	`jnl`	Not all Planar Digraphs have Small Cycle Separators. Inf. Process. Lett. Ming-Yang Kao, Fang Wan
1992	B	`conf`	O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SPAA Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari
1991	J	`jnl`	Online Matching with Blocked Input. Inf. Process. Lett. Ming-Yang Kao, Stephen R. Tate
1990	J	`jnl`	Parallel Depth-First Search in General Directed Graphs. SIAM J. Comput. Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao
1990	A*	`conf`	Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs STOC Ming-Yang Kao, Philip N. Klein
1989	A*	`conf`	Local Reorientation, Global Order, and Planar Topology (Preliminary Version) STOC Ming-Yang Kao, Gregory E. Shannon
1989	A*	`conf`	Parallel Depth-First Search in General Directed Graphs (Preliminary Version) STOC Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao
1988	—	`conf`	All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC. AWOC Ming-Yang Kao