Obserwuj
Jiri Sgall
Jiri Sgall
Computer Science Institute of Charles University
Zweryfikowany adres z iuuk.mff.cuni.cz - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
On-line scheduling
J Sgall
Online algorithms: The state of the art, 196-231, 2005
4532005
Online Scheduling.
K Pruhs, J Sgall, E Torng
Handbook of Scheduling, 2004
417*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
3902000
On the computational power of DNA
D Boneh, C Dunworth, RJ Lipton, J Sgall
Discrete Applied Mathematics 71 (1-3), 79-94, 1996
3361996
First Fit bin packing: A tight analysis
G Dósa, J Sgall
30th International symposium on theoretical aspects of computer science …, 2013
1762013
Dynamic scheduling on parallel machines
A Feldmann, J Sgall, SH Teng
Theoretical Computer Science 130 (1), 49-72, 1994
1571994
Lower bounds for the polynomial calculus and the Gröbner basis algorithm
R Impagliazzo, P Pudlák, J Sgall
Computational Complexity 8, 127-144, 1999
1501999
Solution of David Gale's lion and man problem
J Sgall
Theoretical Computer Science 259 (1-2), 663-670, 2001
1432001
Semi-online scheduling with decreasing job sizes
S Seiden, J Sgall, G Woeginger
Operations Research Letters 27 (5), 215-221, 2000
1292000
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
1281996
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
117*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
1092001
Making DNA computers error resistant
D Boneh, RJ Lipton
DNA Based Computers, 163-170, 1996
1021996
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
902004
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
882006
Communication complexity towards lower bounds on circuit depth
J Edmonds, R Impagliazzo, S Rudich, J Sgall
Computational Complexity 10, 210-246, 2001
882001
Communication complexity towards lower bounds on circuit depth
J Edmonds, R Impagliazzo, S Rudich, J Sgall
Computational Complexity 10, 210-246, 2001
882001
A lower bound for randomized on-line multiprocessor scheduling
J Sgall
Information Processing Letters 63 (1), 51-55, 1997
811997
Ancient and New Algorithms for Load Balancing in the l p Norm
A Avidor, Y Azar, J Sgall
Algorithmica 29, 422-441, 2001
802001
Boolean circuits, tensor ranks, and communication complexity
P Pudlák, V Rödl, J Sgall
SIAM Journal on Computing 26 (3), 605-633, 1997
801997
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20