NETWORKS
2002
13 years 4 months ago
2002
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...
DM
2006
13 years 5 months ago
2006
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
The de Bruijn digraph B d;D is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmos...
ASAP
2000
IEEE
13 years 9 months ago
2000
IEEE
Permutation is widely used in cryptographic algorithms. However, it is not well-supported in existing instruction sets. In this paper, two instructions, PPERM3R and GRP, are propo...
ICCD
2001
IEEE
14 years 1 months ago
2001
IEEE
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...