𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing Pseudo-Random Permutations with a Prescribed Structure

✍ Scribed by Moni Naor; Omer Reingold

Publisher
Springer
Year
2002
Tongue
English
Weight
59 KB
Volume
15
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Enumeration of Permutations with a P
The Enumeration of Permutations with a Prescribed Number of β€œForbidden” Patterns
✍ John Noonan; Doron Zeilberger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 219 KB

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''

Constructing a bipartite graph of maximu
Constructing a bipartite graph of maximum connectivity with prescribed degrees
✍ Asano, Takao πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 328 KB πŸ‘ 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and