( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The local-global conjecture for scheduling with non-linear cost.

, , , и . J. Sched., 20 (3): 239-254 (2017)

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.

Christoph Dürr

Christoph Dürr

Christoph Jürgen Dürr

Helmut Dürr

Walter Dürr

 

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

A Decision Procedure for Well-Formed Linear Quantum Cellular Automata., , и . STACS, том 1046 из Lecture Notes in Computer Science, стр. 281-292. Springer, (1996)Quantum Algorithms for Element Distinctness., , , , , , и . SIAM J. Comput., 34 (6): 1324-1330 (2005)Randomized Two-Valued Bounded Delay Online Buffer Management., и . CoRR, (2020)Non-monotone DR-submodular Maximization over General Convex Sets., , , и . IJCAI, стр. 2148-2154. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Tile-Packing Tomography Is \mathbbNPNP-hard., , , , и . COCOON, том 6196 из Lecture Notes in Computer Science, стр. 254-263. Springer, (2010)Online Computation with Untrusted Advice., , , , и . ITCS, том 151 из LIPIcs, стр. 52:1-52:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty., , , , , и . ESA, том 204 из LIPIcs, стр. 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Competitive Analysis of Scheduling Algorithms for Aggregated Links., , и . LATIN, том 3887 из Lecture Notes in Computer Science, стр. 617-628. Springer, (2006)Quantum Query Complexity of Some Graph Problems., , , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 481-493. Springer, (2004)Online Maximum Matching with Recourse., , и . MFCS, том 117 из LIPIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)