Sciweavers

552 search results - page 18 / 111
» Lower bounds for dynamic connectivity
Sort
View
DCC
2000
IEEE
14 years 9 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
TIT
2010
107views Education» more  TIT 2010»
14 years 4 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
SPAA
1994
ACM
15 years 1 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
15 years 4 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
JCT
2011
104views more  JCT 2011»
14 years 4 months ago
Bounds for solid angles of lattices of rank three
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Lenny Fukshansky, Sinai Robins