658 search results - page 115 / 132 » The Grindahl Hash Functions |
134
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
137
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
131
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
127
click to vote
CHES
2009
Springer
16 years 4 months ago
2009
Springer
We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data- and key-dependent branches and mem...
234
Voted
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...