If you made any changes in Pure, your changes will be visible here soon.

Research Output 1988 2017

Filter
Conference contribution
2 Citations (Scopus)

A 6-Approximation algorithm for computing smallest common AoN-supertree with application to the reconstruction of glycan trees

Aoki-Kinoshita, K. F., Kanehisa, M., Kao, M-Y., Li, X. Y. & Wang, W., Dec 1 2006, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 100-110 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Approximation algorithms
Rooted Trees
Labels
Approximation Algorithms
Labeled Trees

A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model

Aspnes, J., Hartling, J., Ming-Yang, K., Kim, J. & Shah, G., Dec 1 2001, Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. p. 403-415 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Canonical Model
Protein Sequence
Proteins
Network Flow
Protein

Address generation for nanowire decoders

Wang, J., Kao, M-Y. & Zhou, H., Oct 1 2007, GLSVLSI'07: Proceedings of the 2007 ACM Great Lakes Symposium on VLSI. p. 525-528 4 p. 1228909. (Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nanowires
Fabrication
Logic devices
Mathematical models
Data storage equipment
21 Citations (Scopus)

A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 438-449 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bipartite Matching
Evolutionary Tree
Decomposition Theorem
Decomposition
Computing

A faster and unifying algorithm for comparing trees

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 2000, Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings. Sankoff, D. & Giancarlo, R. (eds.). Springer Verlag, p. 129-142 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1848).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Labeled Trees
Leaves
Evolutionary Tree
Distinct
Similarity Measure
4 Citations (Scopus)

A fast general methodology for information — theoretically optimal encodings of graphs

He, X., Kao, M. Y. & Lu, H. I., Jan 1 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 540-549 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Encoding
Methodology
Graph in graph theory
Separators
Planar graph
13 Citations (Scopus)

All-cavity maximum matchings

Kao, M. Y., Lam, T. W., Sung, W. K. & Ting, H. F., Jan 1 1997, Algorithms and Computation - 8th International Symposium, ISAAC 1997, Proceedings. Leong, H. W., Jain, S. & Imai, H. (eds.). Springer Verlag, p. 364-373 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1350).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Maximum Matching
Cavity
Count
Vertex of a graph
Denote
12 Citations (Scopus)

All graphs have cycle separators and planar directed depth-first search is in DNC

Kao, M. Y., Jan 1 1988, VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings. Reif, J. H. (ed.). Springer Verlag, p. 53-63 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 319 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Depth-first Search
Separator
Separators
Directed graphs
Cycle
2 Citations (Scopus)

An approximation algorithm for a bottleneck traveling salesman problem

Kao, M-Y. & Sanghi, M., Jan 1 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Verlag, p. 223-235 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Traveling salesman problem
Approximation algorithms
Travelling salesman problems
Approximation Algorithms
Polynomials
1 Citation (Scopus)

Average case analysis for tree labelling schemes

Kao, M-Y., Li, X. Y. & Wang, W., Dec 1 2005, Algorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings. p. 136-145 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3827 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Average-case Analysis
Labeling Scheme
Labeling
Labels
Separator
7 Citations (Scopus)

Balanced randomized tree splitting with applications to evolutionary tree constructions

Kao, M. Y., Lingas, A. & Östlin, A., Jan 1 1999, STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag, p. 184-196 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1563).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Binary trees
Approximation algorithms
Experiments
Distance Matrix

Closed-form mortgage pricing formula with outstanding principal as prepayment value

Tsai, Y. C., Chen, Z. H., Ho, J. M., Kao, M-Y., Lei, C. L. & Liao, S. L., Nov 27 2012, 2012 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2012 - Proceedings. p. 100-106 7 p. 6327778. (2012 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2012 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Risk management
Costs
Prepayment
Mortgage pricing
Mortgages
56 Citations (Scopus)

Compact encodings of planar graphs via canonical orderings and multiple parentheses

Chuang, R. C. N., Garg, A., He, X., Kao, M. Y. & Lu, H. I., Dec 1 1998, Automata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings. p. 118-129 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1443 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Planar graph
Decoding
Encoding
Coding
Adjacency

Computing and combinatorics: 4th annual international conference COCOON’98 Taipei, Taiwan, R.o.C., august 12-14, 1998 proceedings

Hsu, W. L. & Kao, M. Y., Jan 1 1998, Computing and Combinatorics - 4th Annual International Conference COCOON 1998, Proceedings. Springer Verlag, Vol. 1449. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1449).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Taiwan
Combinatorics
Annual
Computing
6 Citations (Scopus)

Computing minimum tile sets to self-assemble color patterns

Johnsen, A. C., Kao, M-Y. & Seki, S., Dec 1 2013, Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings. p. 699-710 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8283 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tile
Self-assembly
Self assembly
Color
Synthesis
4 Citations (Scopus)

Data compression techniques for stock market prediction

Azhar, S., Badros, G. J., Glodjo, A., Kao, M. Y. & Reif, J. H., Jan 1 1994, Proceedings of the Data Compression Conference. Storer, J. A. & Cohn, M. (eds.). Publ by IEEE, p. 72-82 11 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Data compression
Correlation theory
Finance
Taxation
Costs

Designing proxies for stock market indices is computationally hard

Kao, M. Y. & Tate, S. R., Jan 1 1999, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). SIAM

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stock Market
Computational complexity
Financial markets
Computational Complexity
NP-complete problem
12 Citations (Scopus)

Detecting stealthy spreaders using online outdegree histograms

Gao, Y., Zhao, Y., Schweller, R., Venkataraman, S., Chen, Y., Song, D. & Kao, M-Y., Oct 1 2007, 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007. p. 145-153 9 p. 4262465. (IEEE International Workshop on Quality of Service, IWQoS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Spreaders
HIgh speed networks
Internet
Scanning
Data storage equipment
1 Citation (Scopus)

Deterministic polynomial-time algorithms for designing short DNA words

Kao, M-Y., Leung, H. C. M., Sun, H. & Zhang, Y., Jul 15 2010, Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. p. 308-319 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6108 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Deterministic Algorithm
Polynomial-time Algorithm
DNA
Polynomials
Randomized Algorithms
1 Citation (Scopus)

Discovering almost any hidden motif from multiple sequences in polynomial time with low sample complexity and high success probability

Fu, B., Kao, M-Y. & Wang, L., Jul 16 2009, Theory and Applications of Models of Computation - 6th Annual Conference, TAMC 2009, Proceedings. p. 231-240 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5532 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Polynomial time
Polynomials
Motif Discovery
DNA
Probabilistic Model
14 Citations (Scopus)

DNA self-assembly for constructing 3D boxes (Extended Abstract)

Kao, M-Y. & Ramachandran, V., Dec 1 2001, Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. p. 429-441 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Self-assembly
Self assembly
DNA
Tile
Nanostructures
18 Citations (Scopus)

Dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry

Chen, T., Kao, M. Y., Tepel, M., Rush, J. & Church, G. M., Jan 1 2000, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 389-398 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mass Spectrometry
Dynamic programming
Peptides
Sequencing
Mass spectrometry
1 Citation (Scopus)

Efficient algorithms for model-based motif discovery from multiple sequences

Fu, B., Kao, M-Y. & Wang, L., Dec 1 2008, Theory and Applications of Models of Computation - 5th International Conference, TAMC 2008, Proceedings. p. 234-245 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4978 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Motif Discovery
Efficient Algorithms
Model-based
Probabilistic Model
Strings
1 Citation (Scopus)

Efficient minimization of numerical summation errors

Kao, M. Y. & Wang, J., Dec 1 1998, Automata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings. p. 375-386 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1443 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Worst Case Error
Summation
Approximation Algorithms
Floating point
Approximation algorithms

Fast accurate algorithms for tail conditional expectation

Chen, B., Hsu, W. M. Y. & Kao, M-Y., Nov 26 2009, Numerical Analysis and Applied Mathematics - International Conference on Numerical Analysis and Applied Mathematics 2009, ICNAAM-2009. Vol. 1168. p. 501-504 4 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

extrapolation
interpolation
synthesis
15 Citations (Scopus)

Fast algorithms for finding maximum-density segments of a sequence with applications to bioinformatics

Goldwasser, M. H., Kao, M-Y. & Lu, H. I., Jan 1 2002, Algorithms in Bioinformatics - 2nd International Workshop,WABI 2002, Proceedings. Guigo, R. & Gusfield, D. (eds.). Springer Verlag, p. 157-171 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2452).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bioinformatics
Fast Algorithm
Sequence Analysis
Subsequence
Consecutive
3 Citations (Scopus)

Fast optimal genome tiling with applications to microarray design and homology search

Berman, P., Bertone, P., DasGupta, B., Gerstein, M., Kao, M-Y. & Snyder, M., Jan 1 2002, Algorithms in Bioinformatics - 2nd International Workshop,WABI 2002, Proceedings. Guigo, R. & Gusfield, D. (eds.). Springer Verlag, p. 419-433 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2452).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Microarrays
Tile
Tiling
Microarray
Homology
6 Citations (Scopus)

Fast pricing of European Asian options with provable accuracy: Single-stock and basket options?

Akcoglu, K., Kao, M. Y. & Raghavan, S. V., Jan 1 2001, Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. Springer Verlag, p. 404-415 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2161).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Asian Options
European Options
Pricing
Polynomials
Costs
3 Citations (Scopus)

Fast universalization of investment strategies with provably good relative returns

Akcoglu, K., Drineas, P. & Kao, M-Y., Dec 1 2002, Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. p. 888-900 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2380 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Trading Strategies
Universal Cover
Log-concave
Concave function
Exponential time
3 Citations (Scopus)

Flexible word design and graph labeling

Kao, M-Y., Sanghi, M. & Schweller, R., Dec 1 2006, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 48-60 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Graph Labeling
Labeling
Hamming distance
Graph in graph theory
Vertex of a graph
172 Citations (Scopus)

Hamsa: Fast signature generation for zero-day polymorphic worms with provable attack resilience

Li, Z., Sanghi, M., Chen, Y., Kao, M-Y. & Chavez, B., Nov 21 2006, Proceedings - 2006 IEEE Symposium on Security and Privacy, S+P 2006. p. 32-46 15 p. 1623999. (Proceedings - IEEE Symposium on Security and Privacy; vol. 2006).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

HIgh speed networks
Internet
Engines

Improved parallel depth-first search in undirected planar graphs

Kao, M. Y., Teng, S. H. & Toyama, K., Jan 1 1993, Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Dehne, F., Sack, J-R., Santoro, N. & Whitesides, S. (eds.). Springer Verlag, p. 409-420 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 709 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Depth-first Search
Undirected Graph
Planar graph
Separator
Search Trees
1 Citation (Scopus)

Improved phylogeny comparisons: Non-shared edges, nearest neighbor interchanges, and subtree transfers

Hon, W. K., Kao, M. Y. & Lam, T. W., Jan 1 2000, Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings. Teng, S-H., Lee, D. T. & Teng, S-H. (eds.). Springer Verlag, p. 527-538 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1969).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Phylogeny
Interchanges
Nearest Neighbor
Approximation algorithms
Approximation Algorithms
18 Citations (Scopus)

Linear-time haplotype inference on pedigrees without recombinations

Chan, M. Y., Chan, W. T., Chin, F. Y. L., Fung, S. P. Y. & Kao, M-Y., Jan 1 2006, Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings. Springer Verlag, p. 56-67 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4175 LNBI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pedigree
Haplotype
Recombination
Linear Time
Linear-time Algorithm
7 Citations (Scopus)

Local reorientation, global order, and planar topology

Kao, M. Y. & Shannon, G. E., Dec 1 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 286-296 11 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Topology
Data storage equipment
2 Citations (Scopus)

Minimal linear invariants

Kao, M. Y., Jan 1 1995, Algorithms, Concurrency and Knowledge - 1995 Asian Computing Science Conference, ACSC 1995, Proceedings. Levy, J-J. & Kanchanasut, K. (eds.). Springer Verlag, p. 23-33 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1023).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Invariant
Table
Correspondence
Cell
Linear-time Algorithm
13 Citations (Scopus)

Nonplanar topological inference and political-map graphs

Chen, Z. Z., He, X. & Kao, M. Y., Jan 1 1999, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). SIAM, p. 195-204 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Printed circuit boards
Polynomials
Graph in graph theory
Mixed Graphs
Inclusion Relations
4 Citations (Scopus)

O(n log log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

Fuerer, M., He, X., Kao, M. Y. & Raghavachari, B., Dec 1 1992, 4th Annual ACM Symposium on Parallel Algorithms and Architectures. Publ by ACM, p. 410-419 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parallel algorithms
Joining
Data storage equipment
1 Citation (Scopus)

On-line difference maximization

Kao, M. Y. & Tate, S. R., Jan 1 1997, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). ACM, p. 175-182 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stochastic Games
Optimal Algorithm
Maximise
Distinct
Arbitrary
11 Citations (Scopus)

Online perfect matching and mobile computing

Grove, E. F., Kao, M. Y., Krishnan, P. & Vitter, J. S., Jan 1 1995, Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Akl, S. G., Dehne, F., Sack, J-R. & Santoro, N. (eds.). Springer Verlag, p. 194-205 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 955).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mobile computing
Mobile Computing
Perfect Matching
Customers
Switches
1 Citation (Scopus)

On the informational asymmetry between upper and lower bounds for ultrametric evolutionary trees

Chen, T. & Kao, M. Y., Jan 1 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 248-256 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Evolutionary Tree
Asymmetry
Upper and Lower Bounds
Testing
Pairwise
6 Citations (Scopus)

Optimal augmentation for bipartite componentwise biconnectivity in linear time

Hsu, T. S. & Kao, M. Y., Jan 1 1996, Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings. Nagamochi, H., Miyano, S., Asano, T., Igarashi, Y. & Suri, S. (eds.). Springer Verlag, p. 213-222 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1178).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Augmentation
Linear Time
Linear-time Algorithm
Connected Components
Bipartite Graph

Optimal bidding algorithms against cheating in multiple-object auctions

Kao, M. Y., Qi, J. & Tan, L., Jan 1 1997, Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings. Springer Verlag, p. 192-201 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1276).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bidding
Auctions
Closed-form Solution
Object
Multivariate Distribution

Optimal bid sequences for multiple-object auctions with unequal budgets

Chen, Y., Kao, M. Y. & Lu, H. I., Jan 1 2000, Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings. Lee, D. T., Teng, S-H. & Teng, S-H. (eds.). Springer Verlag, p. 84-95 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1969).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Auctions
Unequal
Bidding
Object
Genes
11 Citations (Scopus)

Optimal constructions of hybrid algorithms

Kao, M. Y., Ma, Y., Sipser, M. & Yin, Y., Jan 1 1994, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 372-381 10 p. (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hybrid Algorithm
Randomized Algorithms
Competitive Ratio
Deterministic Algorithm
Resolve
33 Citations (Scopus)

Optimal online scheduling of parallel jobs with dependencies

Feldmann, A., Kao, M. Y., Sgall, J. & Teng, S. H., Jun 1 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 642-651 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Scheduling
Scheduling algorithms
Communication
2 Citations (Scopus)

Optimal search for parameters in Monte Carlo simulation for derivative pricing

Wang, C. J. & Kao, M-Y., Oct 14 2014, 2014 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr Proceedings. Almeida, R. J., Maringer, D., Palade, V. & Serguieva, A. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 384-390 7 p. 6924099. (IEEE/IAFE Conference on Computational Intelligence for Financial Engineering, Proceedings (CIFEr)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pricing
Monte Carlo Simulation
Online Algorithms
Derivatives
Derivative
9 Citations (Scopus)

Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems

Chen, H. L. & Kao, M-Y., Feb 1 2011, DNA Computing and Molecular Programming - 16th International Conference, DNA 16, Revised Selected Papers. p. 13-24 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6518 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Assembly Systems
Self-assembly
Tile
Self assembly
DNA

Optimum quantizing of monotonic nondecreasing arrays

Hsu, W. W. Y., Lu, C. Y., Kao, M-Y. & Ho, J. M., Oct 28 2013, Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013. p. 95-101 7 p. 6611703. (Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Heuristic algorithms
Dynamic programming
Convex hull
Heuristic algorithm
3 Citations (Scopus)

Parallel construction of canonical ordering and convex drawing of triconnected planar graphs

He, X. & Kao, M. Y., Jan 1 1993, Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Chin, F. Y. L., Raghavan, P., Balasubramanian, N. V. & Ng, K. W. (eds.). Springer Verlag, p. 303-312 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 762 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Planar graph
Drawing