- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...