Sciweavers

Share
IACR
2011
149views more  IACR 2011»
7 years 5 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
EJC
2011
7 years 9 months ago
Two enumerative results on cycles of permutations
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...
Richard P. Stanley
ICASSP
2011
IEEE
7 years 10 months ago
Resolving FD-BSS permutation for arbitrary array in presence of spatial aliasing
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...
Jani Even, Norihiro Hagita
CORR
2011
Springer
156views Education» more  CORR 2011»
8 years 1 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
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...
Scott Aaronson
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
8 years 1 months ago
Controllability of homogeneous single-leader networks
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...
Philip Twu, Magnus Egerstedt, Simone Martini
RSA
2010
94views more  RSA 2010»
8 years 4 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
PPSN
2010
Springer
8 years 4 months ago
An Analysis of the XOR Dynamic Problem Generator Based on the Dynamical System
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...
Renato Tinós, Shengxiang Yang
JSC
2010
132views more  JSC 2010»
8 years 4 months ago
Binary codes from the line graph of the n-cube
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 find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
ORDER
2002
104views more  ORDER 2002»
8 years 5 months ago
Partially Well-Ordered Closed Sets of Permutations
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 ...
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
DM
1999
122views more  DM 1999»
8 years 5 months ago
Parking functions, valet functions and priority queues
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...
Julian D. Gilbey, Louis H. Kalikow
books