Sciweavers

6142 search results - page 358 / 1229
» The Complexity of Partition Functions
Sort
View
INTEGRATION
2007
90views more  INTEGRATION 2007»
15 years 6 months ago
Partitioning-based decoupling capacitor budgeting via sequence of linear programming
In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linear p...
Jeffrey Fan, Sheldon X.-D. Tan, Yici Cai, Xianlong...
JCT
2010
82views more  JCT 2010»
15 years 5 months ago
Major index for 01-fillings of moon polyominoes
We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. W...
William Y. C. Chen, Svetlana Poznanovic, Catherine...
STACS
2005
Springer
16 years 5 days ago
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
Nir Ailon, Bernard Chazelle
SACRYPT
2009
Springer
155views Cryptology» more  SACRYPT 2009»
16 years 1 months ago
Practical Collisions for SHAMATA-256
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream cipher-like hash function design with components of the AES, and it is one of the ...
Sebastiaan Indesteege, Florian Mendel, Bart Prenee...
FSE
2007
Springer
129views Cryptology» more  FSE 2007»
16 years 26 days ago
Cryptanalysis of FORK-256
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differential...
Krystian Matusiewicz, Thomas Peyrin, Olivier Bille...