Sciweavers

658 search results - page 115 / 132
» The Grindahl Hash Functions
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 8 months ago
A Fast Generic Sequence Matching Algorithm
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...
David R. Musser, Gor V. Nishanov
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 6 days ago
Making Hard Problems Harder
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...
Joshua Buresh-Oppenheim, Rahul Santhanam
DAC
2007
ACM
14 years 9 months ago
On Resolution Proofs for Combinational Equivalence
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...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
CHES
2009
Springer
200views Cryptology» more  CHES 2009»
14 years 9 months ago
Accelerating AES with Vector Permute Instructions
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...
Mike Hamburg
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 8 months ago
Map-reduce-merge: simplified relational data processing on large clusters
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 ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...