Ming-Yang Kao
Affiliations:- Northwestern University, Illinois, USA
According to our database1,
Ming-Yang Kao
authored at least 136 papers
between 1988 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2017
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis.
J. Comb. Optim., 2017
2016
Encyclopedia of Algorithms, 2016
Eur. J. Oper. Res., 2016
2015
Outstanding Principal as Prepayment Value: A Closed-Form Formula for Mortgage Pricing.
J. Inf. Sci. Eng., 2015
2014
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis.
CoRR, 2014
Algorithmic Finance, 2014
2013
Theor. Comput. Sci., 2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2013
2012
Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012
Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012
Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012
2011
ACM Trans. Algorithms, 2011
2010
J. Inf. Sci. Eng., 2010
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems.
Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010
2009
SIAM J. Discret. Math., 2009
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.
SIAM J. Comput., 2009
J. Discrete Algorithms, 2009
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract).
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009
2008
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability.
Algorithms Mol. Biol., 2008
Proceedings of the Theory and Applications of Models of Computation, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
IEEE/ACM Trans. Netw., 2007
Inf. Process. Lett., 2007
Proceedings of the Fifteenth IEEE International Workshop on Quality of Service, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007
2006
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006
Hamsa: Fast Signature Generation for Zero-day PolymorphicWorms with Provable Attack Resilience.
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Proceedings of the Algorithmic Aspects in Information and Management, 2006
2005
SIAM J. Discret. Math., 2005
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications.
J. Comput. Syst. Sci., 2005
J. Comput. Syst. Sci., 2005
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005
2004
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
J. Comput. Biol., 2004
Inf. Process. Lett., 2004
Int. J. Found. Comput. Sci., 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
2003
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs.
J. Comput. Biol., 2003
2002
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model.
J. Comput. Biol., 2002
Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers
CoRR, 2002
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
Theor. Comput. Sci., 2001
SIAM J. Comput., 2001
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets.
SIAM J. Comput., 2001
SIAM J. Comput., 2001
A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry.
J. Comput. Biol., 2001
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
J. Algorithms, 2001
Towards understanding the predictability of stock markets from the perspective of computational complexity.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, 2001
Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options.
Proceedings of the Algorithms, 2001
2000
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors.
SIAM J. Comput., 2000
SIAM J. Comput., 2000
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs.
SIAM J. Comput., 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000
1999
SIAM J. Discret. Math., 1999
SIAM J. Comput., 1999
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.
Proceedings of the STACS 99, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees.
Proceedings of the Algorithms, 1999
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees.
Proceedings of the Algorithms, 1999
1998
J. Comb. Optim., 1998
J. Comb. Optim., 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Default-Sensitive PreProcessings for Finding Maxima.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998
1997
SIAM J. Comput., 1997
Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants.
J. Comb. Optim., 1997
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Ninth International Conference on Scientific and Statistical Database Management, 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
1996
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem.
Inf. Comput., 1996
Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract).
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
IEEE Trans. Parallel Distributed Syst., 1995
SIAM J. Comput., 1995
Parallel Process. Lett., 1995
Inf. Process. Lett., 1995
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
SIAM J. Discret. Math., 1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Proceedings of the IEEE Data Compression Conference, 1994
1993
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test.
SIAM J. Discret. Math., 1993
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees.
SIAM J. Comput., 1993
Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components.
SIAM J. Comput., 1993
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity.
SIAM J. Comput., 1993
Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs.
J. Comput. Syst. Sci., 1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
1992
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992
1991
1990
1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988