Sciweavers

1696 search results - page 8 / 340
» Permuted function matching
Sort
View
DM
2006
79views more  DM 2006»
13 years 11 months ago
Restricted even permutations and Chebyshev polynomials
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...
Toufik Mansour
COMBINATORICS
1998
88views more  COMBINATORICS 1998»
13 years 10 months ago
Multi-statistic enumeration of two-stack sortable permutations
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...
Mireille Bousquet-Mélou
JALC
2006
81views more  JALC 2006»
13 years 11 months ago
A Monoidal Interval of Clones of Selfdual Functions
Let A be a 2p-element set, p prime, and let be a fixed point-free permutation on A of order p. We study the interval of clones C on A such that C consists of functions that are s...
Andrei A. Krokhin, Ivo G. Rosenberg
BMCBI
2004
143views more  BMCBI 2004»
13 years 10 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 4 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...