46 search results - page 4 / 10 » Permuted Longest-Common-Prefix Array |
58
Voted
ASPDAC
1999
ACM
15 years 1 months ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
IEEEPACT
1999
IEEE
15 years 1 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
TCOM
2010
14 years 4 months ago
2010
In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either ...
ARSCOM
2008
14 years 9 months ago
2008
We present 3 open challenges in the field of Costas arrays. They are: a) the determination of the number of dots on the main diagonal of a Welch array, and especially the maximal ...