2194 search results - page 13 / 439 » Improving HLRTA*( k ) |
ICISC
2007
13 years 11 months ago
2007
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
JCO
2008
13 years 9 months ago
2008
COMCOM
2004
13 years 9 months ago
2004
ICFEM
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. K
CPM
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...