Jiri Sgall
Jiri Sgall
Computer Science Institute of Charles University
Verifisert e-postadresse på iuuk.mff.cuni.cz - Startside
Sitert av
Sitert av
On-line scheduling
J Sgall
Online algorithms, 196-231, 1998
Online Scheduling.
K Pruhs, J Sgall, E Torng
Handbook of Scheduling, 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
On the computational power of DNA
D Boneh, C Dunworth, RJ Lipton, J Sgall
Discrete Applied Mathematics 71 (1-3), 79-94, 1996
Dynamic scheduling on parallel machines
A Feldmann, J Sgall, SH Teng
Theoretical Computer Science 130 (1), 49-72, 1994
Solution of David Gale's lion and man problem
J Sgall
Theoretical Computer Science 259 (1-2), 663-670, 2001
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
First Fit bin packing: A tight analysis
G Dósa, J Sgall
30th International Symposium on Theoretical Aspects of Computer Science …, 2013
Semi-online scheduling with decreasing job sizes
S Seiden, J Sgall, G Woeginger
Operations Research Letters 27 (5), 215-221, 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 (3), 256-298, 1996
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
Making DNA computers error resistant
D Boneh, C Dunworth, RJ Lipton, J Sgall
DNA Based Computers II 44, 163-170, 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
Approximation schemes for scheduling on uniformly related and identical parallel machines
L Epstein, J Sgall
Algorithmica 39 (1), 43-57, 2004
Ancient and new algorithms for load balancing in the lp norm
A Avidor, Y Azar, J Sgall
Algorithmica 29 (3), 422-441, 2001
A lower bound for randomized on-line multiprocessor scheduling
J Sgall
Information Processing Letters 63 (1), 51-55, 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
Optimal online scheduling of parallel jobs with dependencies
A Feldmann, MY Kao, J Sgall, SH Teng
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
On the complexity of cake cutting
GJ Woeginger, J Sgall
Discrete Optimization 4 (2), 213-220, 2007
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
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20