( en | de | ru )

 

Disambiguation of "Sgall, Jirí"

Author of the publication

copydeleteadd this publication to your clipboard
Functions that have read-twice constant width branching programs are not necessarily testable.

, , and . Random Struct. Algorithms, 24 (2): 175-193 (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. You can also use the button next to the name to display some publications already assigned to the person.

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

 

Other publications of authors with the same name

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption., and . Theory Comput. Syst., 56 (1): 73-81 (2015)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., and . Theory Comput. Syst., 48 (3): 577-613 (2011)An Approximation Scheme For Cake Division With A Linear Number Of Cuts., and . Combinatorica, 27 (2): 205-211 (2007)Preemptive Online Scheduling: Optimal Algorithms for All Speeds., , and . Algorithmica, 53 (4): 504-522 (2009)Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting., , , , , and . Comput. Complex., 6 (3): 256-298 (1997)Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines., and . ESA, volume 1643 of Lecture Notes in Computer Science, page 151-162. Springer, (1999)Improved Online Algorithms for Buffer Management in QoS Switches., , , and . ESA, volume 3221 of Lecture Notes in Computer Science, page 204-215. Springer, (2004)Some Bounds on Multiparty Communication Complexity of Pointer Jumping., , and . Comput. Complex., 7 (2): 109-127 (1998)Solution of David Gale's lion and man problem.. Theor. Comput. Sci., 259 (1-2): 663-670 (2001)Periodic scheduling with obligatory vacations., , and . Theor. Comput. Sci., 410 (47-49): 5112-5121 (2009)