Sciweavers

73 search results - page 3 / 15
» A Permutation Regularity Lemma
Sort
View
ALGORITHMICA
2011
13 years 10 days ago
Common Intervals of Multiple Permutations
Abstract Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We present an algorith...
Steffen Heber, Richard Mayr, Jens Stoye
COCOON
2007
Springer
13 years 11 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
JCT
2006
69views more  JCT 2006»
13 years 5 months ago
Short paths in quasi-random triple systems with sparse underlying graphs
The Frankl-R
Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski...
CPC
2002
95views more  CPC 2002»
13 years 5 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
ISCAS
2006
IEEE
120views Hardware» more  ISCAS 2006»
13 years 11 months ago
Fast bit permutation unit for media enhanced microprocessors
— Bit and subword permutations are useful in many multimedia and cryptographic applications. New shift and permute instructions have been added to the instruction set of general-...
Giorgos Dimitrakopoulos, Christos Mavrokefalidis, ...