Minjun Chang

According to our database, Minjun Chang authored at least 3 papers between 2018 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.

Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky

Theory Comput. Syst., 2020

2018

DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals.

Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky

CoRR, 2018

DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.

Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018