RANDOM
1999
Springer
13 years 12 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
RANDOM
1999
Springer
13 years 12 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
MFCS
1999
Springer
13 years 12 months ago
1999
Springer
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...