%0 Journal Article %1 journals/mst/ChangHSV20 %A Chang, Minjun %A Hochbaum, Dorit S. %A Spaen, Quico %A Velednitsky, Mark %D 2020 %J Theory Comput. Syst. %K dblp %N 4 %P 645-661 %T An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. %U http://dblp.uni-trier.de/db/journals/mst/mst64.html#ChangHSV20 %V 64

@article{journals/mst/ChangHSV20, added-at = {2020-05-06T00:00:00.000+0200}, author = {Chang, Minjun and Hochbaum, Dorit S. and Spaen, Quico and Velednitsky, Mark}, biburl = {https://www.bibsonomy.org/bibtex/25dd932b9451874f54d9764b9fed88f40/dblp}, ee = {https://doi.org/10.1007/s00224-019-09947-7}, interhash = {7dc6515fc04954033773ef5d235b98af}, intrahash = {5dd932b9451874f54d9764b9fed88f40}, journal = {Theory Comput. Syst.}, keywords = {dblp}, number = 4, pages = {645-661}, timestamp = {2020-05-07T11:39:23.000+0200}, title = {An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.}, url = {http://dblp.uni-trier.de/db/journals/mst/mst64.html#ChangHSV20}, volume = 64, year = 2020 }