Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
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...
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...