From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Introduction to algorithms, , , и . MIT Press, Cambridge, Mass., (2003)Sorting Networks, , , и . глава 27, The MIT Press, Third издание, (2009)A general framework for handling commitment in online throughput maximization., , , , и . Math. Program., 183 (1): 215-247 (2020)Estimating the Longest Increasing Subsequence in Nearly Optimal Time., , , и . FOCS, стр. 708-719. IEEE, (2022)Scheduling with Speed Predictions., , , и . WAOA, том 14297 из Lecture Notes in Computer Science, стр. 74-89. Springer, (2023)A randomized algorithm for online metric b-matching., , и . Oper. Res. Lett., 51 (6): 591-594 (ноября 2023)Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity., , и . ICALP, том 132 из LIPIcs, стр. 14:1-14:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Distributed Algorithms for Matching in Hypergraphs., и . WAOA, том 12806 из Lecture Notes in Computer Science, стр. 30-46. Springer, (2020)Algoritmos: teoria e prática, , , и . Editora Campus, (2002)Matching Drivers to Riders: A Two-Stage Robust Approach., , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)