( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Primal-Dual Randomized Algorithm for Weighted Paging.

, , и . J. ACM, 59 (4): 19:1-19:24 (2012)

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.

Niv Drory

Friedrich Buchbinder

Sascha Buchbinder

Maria Buchbinder

Hans Buchbinder

 

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

The Design of Competitive Online Algorithms via a Primal-Dual Approach., и . Foundations and Trends in Theoretical Computer Science, 3 (2-3): 93-263 (2009)A general approach to online network optimization problems., , , , и . SODA, стр. 577-586. SIAM, (2004)A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching., , , и . Algorithmica, 68 (2): 390-403 (2014)Constrained Submodular Maximization via a Nonsymmetric Technique., и . Math. Oper. Res., 44 (3): 988-1005 (2019)Frequency Capping in Online Advertising., , , и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 147-158. Springer, (2011)Fair Coin Flipping: Tighter Analysis and the Many-Party Case., , , и . CoRR, (2021)Lower and upper bounds on obtaining history independence., и . Inf. Comput., 204 (2): 291-337 (2006)Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid., , и . SIAM J. Comput., 52 (4): 945-967 (августа 2023)Fair Coin Flipping: Tighter Analysis and the Many-Party Case., , , и . SODA, стр. 2580-2600. SIAM, (2017)Submodular Maximization with Cardinality Constraints., , , и . SODA, стр. 1433-1452. SIAM, (2014)