<--- Back to Details
First PageDocument Content
Permutations / Randomness / Sorting algorithms / Combinatorics / FisherYates shuffle / Random permutation / Inversion / Algorithm / Trace / Pancake sorting / Bit-reversal permutation
Date: 2008-10-22 02:35:21
Permutations
Randomness
Sorting algorithms
Combinatorics
FisherYates shuffle
Random permutation
Inversion
Algorithm
Trace
Pancake sorting
Bit-reversal permutation

348 IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5,

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Download Document from Source Website

File Size: 661,02 KB

Share Document on Facebook

Similar Documents

Swiss-Cheese operad and Drinfeld center Najib Idrissi∗ January 5, 2017 We build a model in groupoids for the Swiss-Cheese operad, based on parenthesized permutations and braids. We relate algebras over this model

Swiss-Cheese operad and Drinfeld center Najib Idrissi∗ January 5, 2017 We build a model in groupoids for the Swiss-Cheese operad, based on parenthesized permutations and braids. We relate algebras over this model

DocID: 1xTp6 - View Document

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY

DocID: 1vhtk - View Document

Algorithmics of Modular decomposition Christophe Paul CNRS - LIRMM, Montpellier France  Algorithms & Permutations Workshop

Algorithmics of Modular decomposition Christophe Paul CNRS - LIRMM, Montpellier France Algorithms & Permutations Workshop

DocID: 1v91l - View Document

A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!

A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!

DocID: 1uX0H - View Document

Sorting and a Tale of Two Polytopes Jean Cardinal ULB, Brussels, Belgium Algorithms & Permutations, Paris, 2012

Sorting and a Tale of Two Polytopes Jean Cardinal ULB, Brussels, Belgium Algorithms & Permutations, Paris, 2012

DocID: 1uPKr - View Document