M
Ming-Yang Kao
Researcher at Northwestern University
Publications - 202
Citations - 4582
Ming-Yang Kao is an academic researcher from Northwestern University. The author has contributed to research in topics: Time complexity & Planar graph. The author has an hindex of 37, co-authored 202 publications receiving 4438 citations. Previous affiliations of Ming-Yang Kao include Tufts University & Indiana University.
Papers
More filters
Book ChapterDOI
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions
Ming-Yang Kao,Junfeng Qi,Lei Tan +2 more
TL;DR: In this paper, the problem of multiple-object auction with an adversary who knows the bidding algorithms of all the other bidders was studied, and an optimal randomized bidding algorithm was derived.
Book ChapterDOI
Efficient Minimization of Numerical Summation Errors
Ming-Yang Kao,Jie Wang +1 more
TL;DR: It is proved that if X has both positive and negative numbers, it is NP-hard to compute S n with the worst-case error equal to E n *, and the first known polynomial-time approximation algorithm for computing Sn that has a provably small error for arbitrary X is given.
Book ChapterDOI
Fast Universalization of Investment Strategies with Provably Good Relative Returns
TL;DR: In this article, the authors present a general framework for universalizing investment strategies and discuss conditions under which investment strategies are universalizable, including trading strategies that decide positions in individual stocks, and portfolio strategies that allocate wealth among multiple stocks.
Journal ArticleDOI
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
TL;DR: It is proved that if X has both positive and negative numbers, it is NP-hard to compute Sn with the worst-case error equal to E^*_n, and the first known polynomial-time approximation algorithm that has a provably small error for arbitrary X is given.
Journal ArticleDOI
Non-shared edges and nearest neighbor interchanges revisited
TL;DR: This paper gives the first sub-quadratic time algorithm for computing the non-shared edge distance, whose running time is O(n log n), and can speed up the existing approximation algorithm for the NNI distance from O( n2) time to O(log n) time.