On-line scheduling J Sgall Online algorithms: The state of the art, 196-231, 2005 | 449 | 2005 |
Online Scheduling. K Pruhs, J Sgall, E Torng Handbook of Scheduling, 2004 | 427* | 2004 |
Multiprocessor scheduling with rejection Y Bartal, S Leonardi, A Marchetti-Spaccamela, J Sgall, L Stougie SIAM Journal on Discrete Mathematics 13 (1), 64-78, 2000 | 398 | 2000 |
On the computational power of DNA D Boneh, C Dunworth, RJ Lipton, J Sgall Discrete Applied Mathematics 71 (1-3), 79-94, 1996 | 332 | 1996 |
First Fit bin packing: A tight analysis G Dósa, J Sgall 30th International symposium on theoretical aspects of computer science …, 2013 | 183 | 2013 |
Dynamic scheduling on parallel machines A Feldmann, J Sgall, SH Teng Theoretical Computer Science 130 (1), 49-72, 1994 | 157 | 1994 |
Lower bounds for the polynomial calculus and the Gröbner basis algorithm R Impagliazzo, P Pudlák, J Sgall Computational Complexity 8 (2), 127-144, 1999 | 155 | 1999 |
Solution of David Gale's lion and man problem J Sgall Theoretical Computer Science 259 (1-2), 663-670, 2001 | 147 | 2001 |
Semi-online scheduling with decreasing job sizes S Seiden, J Sgall, G Woeginger Operations Research Letters 27 (5), 215-221, 2000 | 132 | 2000 |
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting S Buss, R Impagliazzo, J Krajíček, P Pudlák, AA Razborov, J Sgall Computational Complexity 6, 256-298, 1996 | 129 | 1996 |
Graph balancing: a special case of scheduling unrelated parallel machines T Ebenlendr, M Krčál, J Sgall Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 121* | 2008 |
Randomized on‐line scheduling on two uniform machines L Epstein, J Noga, S Seiden, J Sgall, G Woeginger Journal of Scheduling 4 (2), 71-92, 2001 | 114 | 2001 |
Making DNA computers error resistant D Boneh, C Dunworth, RJ Lipton, J Sgall DNA Based Computers, 163-170, 1996 | 103 | 1996 |
Online competitive algorithms for maximizing weighted throughput of unit jobs FYL Chin, M Chrobak, SPY Fung, W Jawor, J Sgall, T Tichý Journal of Discrete Algorithms 4 (2), 255-276, 2006 | 91 | 2006 |
Approximation schemes for scheduling on uniformly related and identical parallel machines L Epstein\thanks {School of Computer Science, The Interdisciplinary Center ... Algorithmica 39, 43-57, 2004 | 91 | 2004 |
On the complexity of cake cutting GJ Woeginger, J Sgall Discrete Optimization 4 (2), 213-220, 2007 | 86 | 2007 |
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001 | 85 | 2001 |
A lower bound for randomized on-line multiprocessor scheduling J Sgall Information Processing Letters 63 (1), 51-55, 1997 | 82 | 1997 |
Boolean circuits, tensor ranks, and communication complexity P Pudlák, V Rödl, J Sgall SIAM Journal on Computing 26 (3), 605-633, 1997 | 80 | 1997 |
Ancient and New Algorithms for Load Balancing in the l p Norm A Avidor, Y Azar, J Sgall Algorithmica 29, 422-441, 2001 | 79 | 2001 |