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.

 

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

A note on the size of query trees.. CoRR, (2017)Communication-Aware Scheduling of Precedence-Constrained Tasks., , , , и . SIGMETRICS Perform. Evaluation Rev., 47 (2): 21-23 (2019)Space-efficient local computation algorithms., , , и . SODA, стр. 1132-1139. SIAM, (2012)A Parallelizable Acceleration Framework for Packing Linear Programs., , , и . AAAI, стр. 3706-3713. AAAI Press, (2018)How to Hire Secretaries with Stochastic Departures., , и . WINE, том 11920 из Lecture Notes in Computer Science, стр. 343. Springer, (2019)Randomly Coloring Graphs of Logarithmically Bounded Pathwidth.. APPROX-RANDOM, том 116 из LIPIcs, стр. 57:1-57:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Sublinear Graph Augmentation for Fast Query Implementation., , и . WAOA, том 11312 из Lecture Notes in Computer Science, стр. 181-203. Springer, (2018)On the Probe Complexity of Local Computation Algorithms., , и . CoRR, (2017)Designing Local Computation Algorithms and Mechanisms. Tel Aviv University, Israel, (2015)Tel Aviv University Library.Non-Exploitable Protocols for Repeated Cake Cutting., , и . AAAI, стр. 1226-1233. AAAI Press, (2018)