( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
It is tough to be a plumber.

, , , , и . Theor. Comput. Sci., 313 (3): 473-484 (2004)

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.

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

 

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

Algebraic models of computation and interpolation for algebraic proof systems., и . Proof Complexity and Feasible Arithmetics, том 39 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 279-295. DIMACS/AMS, (1996)Making DNA computers error resistant., , , и . DNA Based Computers, том 44 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 163-170. DIMACS/AMS, (1996)Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms., и . WAOA, том 8952 из Lecture Notes in Computer Science, стр. 236-247. Springer, (2014)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., и . STACS, том 3 из LIPIcs, стр. 349-360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption., и . Theory Comput. Syst., 56 (1): 73-81 (2015)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., и . Theory Comput. Syst., 48 (3): 577-613 (2011)Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines., и . ESA, том 1643 из Lecture Notes in Computer Science, стр. 151-162. Springer, (1999)Improved Online Algorithms for Buffer Management in QoS Switches., , , и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 204-215. Springer, (2004)It is tough to be a plumber., , , , и . Theor. Comput. Sci., 313 (3): 473-484 (2004)Optimal On-Line Scheduling of Parallel Jobs with Dependencies., , , и . J. Comb. Optim., 1 (4): 393-411 (1998)