Sciweavers

2924 search results - page 10 / 585
» Lower Bounds in Distributed Computing
Sort
View
TPDS
1998
95views more  TPDS 1998»
13 years 7 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- 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...
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
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...
Roberto Tamassia, Nikos Triandopoulos
DCC
2000
IEEE
13 years 7 months ago
Relating Differential Distribution Tables to Other Properties of of Substitution Boxes
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
Xian-Mo Zhang, Yuliang Zheng, Hideki Imai
UC
2005
Springer
14 years 1 months ago
Lower Bounds on the Computational Power of an Optical Model of Computation
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 ...
Damien Woods, J. Paul Gibson
EOR
2007
99views more  EOR 2007»
13 years 7 months ago
Computing the asymptotic worst-case of bin packing lower bounds
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...