We present Permutation Routing as a method for increased robustness in IP networks with traditional hop-by-hop forwarding. Permutation Routing treats routers involved in traffic forwarding as a sequence of resources, and creates permutations of these resources that give several forwarding options. We introduce Permutation Routing as a concept, and use it to create routings where we seek to maxi...

Abstract Minwise hashing is a standard procedure in the context of search, for efficiently estimating set similarities in massive binary data such as text. Recently, b-bit minwise hashing has been applied to large-scale learning and sublinear time nearneighbor search. The major drawback of minwise hashing is the expensive preprocessing, as the method requires applying (e.g.,) k = 200 to 500 per...

A method for efficiently handling associativity and commutativity (AC) in implementations of (equational) theorem provers without incorporating AC as an underlying theory will be presented. The key of substantial efficiency gains resides in a more suitable representation of permutation-equations (such as f(x,f(y,z))=f(y,f(z,x)) for instance). By representing these permutation-equations through ...

One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xh ( x ) over Fq2 , where q = 2 , h(x) = 1+x+x and r, s, t, k > 0 are integers. Their methods are essentially usage of a multiplicative versio...

2011 Using the reciprocal to calculate generating functions for permutations with no consecutive pattern matches Permutation Patterns 2011 San Luis Obispo, CA 2011 Reciprocal method to enumerate permutations with no consecutive pattern matches FPSAC 2011 Reykjavik, Iceland 2010 Pattern matching in the cycle structure of permutations Permutation Patterns 2010 Dartmouth, NH 2010 Advancement to ca...

In this paper, the problem of constructing permutation polynomials over finite fields is investigated. By using the piecewise method, a class of permutation polynomials of the form (x − x + c) k(q 2−1) d +1 + x + x over Fq2 is constructed, where 1 ≤ k < d and d is an arbitrary factor of q − 1, which generalizes some known results in the literature.

The bit-reversed permutation is a famous task in signal processing and is key to efficient implementation of the fast Fourier transform. This paper presents optimized C++11 implementations of five extant methods for computing the bit-reversed permutation: Stockham auto-sort, naive bitwise swapping, swapping via a table of reversed bytes, local pairwise swapping of bits, and swapping via a cache...

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

We introduce a new algorithm to compute up to conjugacy the maximal subgroups of a finite permutation group. Or method uses a “hybrid group” approach; that is, we first compute a large solvable normal subgroup of the given permutation group and then use this to split the computation in various parts. 1991 Mathematics Subject Classification: primary 20B40, 20-04, 20E28; secondary 20B15, 68Q40