Join Our Newsletter

IACR

2011

7 years 5 months ago
2011

Keccak is one of the ﬁve hash functions selected for the ﬁnal round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we ﬁnd t...

EJC

2011

7 years 9 months ago
2011

Answering a question of B´ona, it is shown that for n ≥ 2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1, 2, . . . , n} is 1/2 if...

ICASSP

2011

IEEE

7 years 10 months ago
2011

IEEE

This paper presents a novel method for solving the permutation problem inherent to frequency domain blind signal separation of multiple simultaneous speakers. As conventional meth...

CORR

2011

Springer

8 years 1 months ago
2011

Springer

We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...

CDC

2010

IEEE

8 years 1 months ago
2010

IEEE

This paper addresses an aspect of controllability in a single-leader network when the agents are homogeneous. In such a network, indices are not assigned to the individual agents a...

RSA

2010

8 years 4 months ago
2010

We study here the spectra of random lifts of graphs. Let G be a ﬁnite connected graph, and let the inﬁnite tree T be its universal cover space. If λ1 and ρ are the spectral ...

PPSN

2010

Springer

8 years 4 months ago
2010

Springer

In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...

JSC

2010

8 years 4 months ago
2010

We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We ﬁnd the automorphism groups and the parameters of the cod...

ORDER

2002

8 years 5 months ago
2002

It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...

DM

1999

8 years 5 months ago
1999

We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...