Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-13
|
Results: 13
Randomized on-line scheduling on two uniform machines
Authors:
Epstein, L Noga, J Seiden, S Sgall, J Woeginger, G
Citation:
L. Epstein et al., Randomized on-line scheduling on two uniform machines, J SCHED, 4(2), 2001, pp. 71-92
Solution of David Gale's lion and man problem
Authors:
Sgall, J
Citation:
J. Sgall, Solution of David Gale's lion and man problem, THEOR COMP, 259(1-2), 2001, pp. 663-670
Ancient and new algorithms for load balancing in the l(p) norm
Authors:
Avidor, A Azar, Y Sgall, J
Citation:
A. Avidor et al., Ancient and new algorithms for load balancing in the l(p) norm, ALGORITHMIC, 29(3), 2001, pp. 422-441
Multiprocessor scheduling with rejection
Authors:
Bartal, Y Leonardi, S Marchetti-Spaccamela, A Sgall, J Stougie, L
Citation:
Y. Bartal et al., Multiprocessor scheduling with rejection, SIAM J DISC, 13(1), 2000, pp. 64-78
DNF tautologies with a limited number of occurrences of every variable
Authors:
Savicky, P Sgall, J
Citation:
P. Savicky et J. Sgall, DNF tautologies with a limited number of occurrences of every variable, THEOR COMP, 238(1-2), 2000, pp. 495-498
Semi-online scheduling with decreasing job sizes
Authors:
Seiden, S Sgall, J Woeginger, G
Citation:
S. Seiden et al., Semi-online scheduling with decreasing job sizes, OPER RES L, 27(5), 2000, pp. 215-221
A lower bound for on-line scheduling on uniformly related machines
Authors:
Epstein, L Sgall, J
Citation:
L. Epstein et J. Sgall, A lower bound for on-line scheduling on uniformly related machines, OPER RES L, 26(1), 2000, pp. 17-22
Efficient dynamic traitor tracing
Authors:
Berkman, O Parnas, M Sgall, J
Citation:
O. Berkman et al., Efficient dynamic traitor tracing, SIAM J COMP, 30(6), 2000, pp. 1802-1828
A simple analysis of the harmonic algorithm for two servers
Authors:
Chrobak, M Sgall, J
Citation:
M. Chrobak et J. Sgall, A simple analysis of the harmonic algorithm for two servers, INF PROCESS, 75(1-2), 2000, pp. 75-77
Lower bounds for the polynomial calculus and the Grobner basis algorithm
Authors:
Impagliazzo, R Pudlak, P Sgall, J
Citation:
R. Impagliazzo et al., Lower bounds for the polynomial calculus and the Grobner basis algorithm, COMP COMPLE, 8(2), 1999, pp. 127-144
Bounds on pairs of families with restricted intersections
Authors:
Sgall, J
Citation:
J. Sgall, Bounds on pairs of families with restricted intersections, COMBINATORI, 19(4), 1999, pp. 555-566
Some bounds on multiparty communication complexity of pointer jumping
Authors:
Damm, C Jukna, S Sgall, J
Citation:
C. Damm et al., Some bounds on multiparty communication complexity of pointer jumping, COMP COMPLE, 7(2), 1998, pp. 109-127
On-line scheduling
Authors:
Sgall, J
Citation:
J. Sgall, On-line scheduling, LECT N COMP, 1442, 1998, pp. 196-231
Risultati:
1-13
|