Protest has made the jump between the offline and the online spaces and is frequently used in most virtual worlds available today. Despite the frequency of these protest actions i...
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...