Minjun Chang
Orcid: 0000-0002-2251-4163
According to our database1,
Minjun Chang
authored at least 3 papers
between 2018 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
2018
2019
2020
0
1
2
3
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Theory Comput. Syst., 2020
2018
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals.
CoRR, 2018
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018