Author of the publication

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.

 

Other publications of authors with the same name

Algebraic models of computation and interpolation for algebraic proof systems., and . Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 279-295. DIMACS/AMS, (1996)Making DNA computers error resistant., , , and . DNA Based Computers, volume 44 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 163-170. DIMACS/AMS, (1996)Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines., , and . RTSS, page 139-148. IEEE Computer Society, (2007)It is tough to be a plumber., , , , and . Theor. Comput. Sci., 313 (3): 473-484 (2004)Optimal On-Line Scheduling of Parallel Jobs with Dependencies., , , and . J. Comb. Optim., 1 (4): 393-411 (1998)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)Online Scheduling of Jobs with Fixed Start Times on Related Machines., , , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 134-145. Springer, (2012)Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms., and . WAOA, volume 8952 of Lecture Notes in Computer Science, page 236-247. Springer, (2014)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., and . STACS, volume 3 of LIPIcs, page 349-360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)