CHEUNG, Yun Kuen (Marco) 張潤權
Email: [AT] univie [DOT] ac [DOT] at

Postdoctoral researcher in the research group Theory and Applications of Algorithms (TAA), University of Vienna
PhD at Courant Institute of Mathematical Sciences, New York University; Department: Computer Science
MPhil at HKUST; Department: Mathematics (worked in Theoretical Computer Science Lab)
BSc at HKUST; Major: Mathematics, Physics; Minor: Information and Technology (with focus on Computer Science)

Main Page

I am currently a postdoc working in theoretical computer science under the mentorship of Prof. Monika Henzinger, in the research group TAA, University of Vienna. In the summer of 2014, I graduated as a PhD in Computer Science from Courant Institute of Mathematical Sciences, New York University. I was fortunate to have Prof. Richard Cole as my advisor during the five years in NYU.

My research interest is broadly in theoretical computer science, algorithm design and analysis. I have been working on multiple fronts. My primary research area is computational economics and algorithmic game theory. Richard and I have been working on the analyses of asynchronous market dynamics (tatonnement), and we find that such analyses can be extended to asynchronous coordinate descent, which has magnificient applications in modern maching learning and optimization. With Monika and her student Gramoz Goranci, I am also working on problems on graph sparsification. In the past I have worked on the lovely topic of analytic combinatorics and its applications in exact analysis of algorithms.

When I did my MPhil in HKUST, I was fortunate to have Prof. Mordecai Golin as advisor. We used Mellin transform technique to solve some divide-and-conquer type recurrences exactly, and to give exact formula on varies types of weighted digital sums that appear in different algorithm analysis problems. While it looks not in the mainstream of theoretical computer science anymore, its magnifience cannot be ignored, since practitioners are really concerned about refined comparisons of the running times of fundamental algorithms (e.g. sorting), including the constants in front of the first order terms, and sometimes even those of the second order terms.

For more details of my research and publications, click here.