( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online competitive algorithms for maximizing weighted throughput of unit jobs.

, , , , , и . J. Discrete Algorithms, 4 (2): 255-276 (2006)

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

 

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

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)An Approximation Scheme For Cake Division With A Linear Number Of Cuts., и . Combinatorica, 27 (2): 205-211 (2007)Preemptive Online Scheduling: Optimal Algorithms for All Speeds., , и . Algorithmica, 53 (4): 504-522 (2009)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)Some Bounds on Multiparty Communication Complexity of Pointer Jumping., , и . Comput. Complex., 7 (2): 109-127 (1998)The weighted 2-server problem., и . Theor. Comput. Sci., 324 (2-3): 289-312 (2004)Paging with connections: FIFO strikes again., , , и . Theor. Comput. Sci., 377 (1-3): 55-64 (2007)It is tough to be a plumber., , , , и . Theor. Comput. Sci., 313 (3): 473-484 (2004)