29 search results - page 4 / 6 » Counting 1324-Avoiding Permutations |
PKC
2001
Springer
13 years 9 months ago
2001
Springer
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
DM
2000
13 years 5 months ago
2000
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
JCT
2011
13 years 7 days ago
2011
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
SPAA
1996
ACM
13 years 9 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
COMBINATORICS
2002
13 years 5 months ago
2002