Ming-Yang Kao

According to our database1, Ming-Yang Kao authored at least 136 papers between 1988 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

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
Haplotype Inference on Pedigrees Without Recombinations.
Encyclopedia of Algorithms, 2016

Optimal search for parameters in Monte Carlo simulation for derivative pricing.
European Journal of Operational Research, 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

Computing Minimum Tile Sets to Self-Assemble Colors Patterns.
CoRR, 2014

Linear-time accurate lattice algorithms for tail conditional expectation.
Algorithmic Finance, 2014

2013
Deterministic polynomial-time algorithms for designing short DNA words.
Theor. Comput. Sci., 2013

Computing Minimum Tile Sets to Self-Assemble Color Patterns.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Optimum quantizing of monotonic nondecreasing arrays.
Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2013

2012
Closed-form mortgage pricing formula with outstanding principal as prepayment value.
Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012

The development of a real-time valuation service of financial derivatives.
Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012

Pricing discrete Asian barrier options on lattices.
Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012

2011
Discovering almost any hidden motif from multiple sequences.
ACM Trans. Algorithms, 2011

2010
Testing Whether a Set of Code Words Satisfies a Given Set of Constraints.
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
Randomized fast design of short DNA words.
ACM Trans. Algorithms, 2009

Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences.
SIAM J. Discrete Math., 2009

Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.
SIAM J. Comput., 2009

An approximation algorithm for a bottleneck traveling salesman problem.
J. Discrete Algorithms, 2009

On approximating four covering and packing problems.
J. Comput. Syst. Sci., 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

The Closest Pair Problem under the Hamming Metric.
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 for Molecular Biology, 2008

Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences.
Proceedings of the Theory and Applications of Models of Computation, 2008

Randomized Self-assembly for Approximate Shapes.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Reversible sketches: enabling monitoring and analysis over high-speed data streams.
IEEE/ACM Trans. Netw., 2007

Average case analysis for tree labelling schemes.
Theor. Comput. Sci., 2007

On constructing an optimal consensus clustering from multiple clusterings.
Inf. Process. Lett., 2007

Detecting Stealthy Spreaders Using Online Outdegree Histograms.
Proceedings of the Fifteenth IEEE International Workshop on Quality of Service, 2007

Using Nash Implementation to Achieve Better Frugality Ratios.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Address generation for nanowire decoders.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

2006
Linear-Time Haplotype Inference on Pedigrees Without Recombinations.
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

Reducing tile complexity for self-assembly through temperature programming.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Flexible Word Design and Graph Labeling.
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

Algorithmic DNA Self-assembly.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time.
SIAM J. Discrete Math., 2005

Complexities for Generalized Models of Self-Assembly.
SIAM J. Comput., 2005

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications.
J. Comput. Syst. Sci., 2005

Tight approximability results for test set problems in bioinformatics.
J. Comput. Syst. Sci., 2005

Towards truthful mechanisms for binary demand games: a general framework.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

2004
Fast Universalization of Investment Strategies.
SIAM J. Comput., 2004

Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
Journal of Computational Biology, 2004

Non-shared edges and nearest neighbor interchanges revisited.
Inf. Process. Lett., 2004

Subtree Transfer Distance For Degree-D Phylogenies.
Int. J. Found. Comput. Sci., 2004

Complexities for generalized models of self-assembly.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Common-Face Embeddings of Planar Graphs.
SIAM J. Comput., 2003

The Enhanced Double Digest Problem for DNA Physical Mapping.
J. Comb. Optim., 2003

Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs.
Journal of Computational Biology, 2003

2002
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model.
Journal of Computational Biology, 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

Fast Universalization of Investment Strategies with Provably Good Relative Returns.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees.
Theor. Comput. Sci., 2001

Selected papers from COCOON 1998 - Foreword.
Theor. Comput. Sci., 2001

A Decomposition Theorem for Maximum Weight Bipartite Matchings.
SIAM J. Comput., 2001

Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets.
SIAM J. Comput., 2001

Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns.
SIAM J. Comput., 2001

A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry.
Journal of Computational Biology, 2001

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
J. Algorithms, 2001

The Risk Profile Problem for Stock Portfolio Optimization
CoRR, 2001

Towards understanding the predictability of stock markets from the perspective of computational complexity.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

DNA Self-Assembly For Constructing 3D Boxes.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Content-based Music Retrieval Using Linear Scaling and Branch-and-bound Tree Search.
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

Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees.
SIAM J. Comput., 2000

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs.
SIAM J. Comput., 2000

Reducing Randomness via Irrational Numbers.
SIAM J. Comput., 2000

Opportunity Cost Algorithms for Combinatorial Auctions
CoRR, 2000

The risk profile problem for stock portfolio optimization (extended abstract).
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

Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

A Faster and Unifying Algorithm for Comparing Trees.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
On-Line Difference Maximization.
SIAM J. Discrete Math., 1999

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings.
SIAM J. Discrete Math., 1999

Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions.
SIAM J. Comput., 1999

Guest Editors' Foreword.
Algorithmica, 1999

Guest Editors' Foreword.
Algorithmica, 1999

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.
Proceedings of the STACS 99, 1999

Designing Proxies for Stock Market Indices is Computationally Hard.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Recovering Evolutionary Trees Through Harmonic Greedy Triplets.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Nonplanar Topological Inference and Political-Map Graphs.
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
Tree Contractions and Evolutionary Trees.
SIAM J. Comput., 1998

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs.
J. Comb. Optim., 1998

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity.
J. Comb. Optim., 1998

Optimal On-Line Scheduling of Parallel Jobs with Dependencies.
J. Comb. Optim., 1998

Optimal Constructions of Hybrid Algorithms.
J. Algorithms, 1998

Efficient Submesh Permutations in Wormhole-routed meshes.
Inf. Sci., 1998

Efficient Minimization of Numerical Summation Errors.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses.
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
Multiple-size divide-and-conquer recurrences.
SIGACT News, 1997

Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables.
SIAM J. Comput., 1997

Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants.
J. Comb. Optim., 1997

General Techniques for Comparing Unrooted Evolutionary Trees.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Security Problems for Statistical Databases with General Cell Suppressions.
Proceedings of the Ninth International Conference on Scientific and Statistical Database Management, 1997

All-Cavity Maximum Matchings.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Data Security Equals Graph Connectivity.
SIAM J. Discrete Math., 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
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes.
IEEE Trans. Parallel Distrib. Syst., 1995

Planar Strong Connectivity Helps in Parallel Depth-First Search.
SIAM J. Comput., 1995

Efficient Broadcast on Hypercubes with Wormhole and E-Cube Routings.
Parallel Processing Letters, 1995

Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs.
Inf. Process. Lett., 1995

An Optimal Parallel Algorithm for Planar Cycle Separators.
Algorithmica, 1995

Online Perfect Matching and Mobile Computing.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Load Balancing in the Lp Norm.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Minimal Linear Invariants.
Proceedings of the Algorithms, 1995

1994
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
SIAM J. Discrete Math., 1994

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Regular Edge Labelings and Drawings of Planar Graphs.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Data Compression Techniques for Stock Market Prediction.
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. Discrete 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

Improved Parallel Depth-First Search in Undirected Planar Graphs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Optimal online scheduling of parallel jobs with dependencies.
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
Not all Planar Digraphs have Small Cycle Separators.
Inf. Process. Lett., 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
Online Matching with Blocked Input.
Inf. Process. Lett., 1991

1990
Parallel Depth-First Search in General Directed Graphs.
SIAM J. Comput., 1990

1989
Local Reorientation, Global Order, and Planar Topology (Preliminary Version)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Parallel Depth-First Search in General Directed Graphs (Preliminary Version)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988
All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988


  Loading...