In-situ associative permuting (original) (raw)

Permuting

Patricio Poblete

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990

View PDFchevron_right

Raising Permutations to Powers in Place

Ian Munro

2016

View PDFchevron_right

A New Construction of Permutation Arrays

Jung-youl Park

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2012

View PDFchevron_right

Computing in permutation groups without memory

Ben Fairbairn

2014

View PDFchevron_right

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

Ron Shamir

SIAM Journal on Computing, 2000

View PDFchevron_right

Cryptography efficient permutation instructions for fast software

Ruby B. Lee

IEEE Micro, 2001

View PDFchevron_right

On Permutation Operations in Cipher Design

Ruby B. Lee

View PDFchevron_right

Efficient Permutation Instructions for Fast Software Cryptography

Ruby B. Lee

IEEE Micro, 2001

View PDFchevron_right

Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast Algorithms and Architectures

Mohammad Mansour

IEEE Transactions on Signal Processing, 2013

View PDFchevron_right

A new algorithm for generation of permutations

Shmuel Zaks

BIT, 1984

View PDFchevron_right

IPS, sorting by transforming an array into its own sorting permutation with almost no space overhead1

Arne Maus

2008

View PDFchevron_right

In-place associative permutation sort

A. Emre Cetin

View PDFchevron_right

Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture

Boran Adas

2017

View PDFchevron_right

On compressing permutations and adaptive sorting

Jérémy Barbay

Theoretical Computer Science, 2013

View PDFchevron_right

The organization of permutation architectures with bused interconnections

Shlomo Kipnis

IEEE Transactions on Computers, 1990

View PDFchevron_right

Coding with Permutations

Gerard Cohen

Information and Computation/information and Control, 1979

View PDFchevron_right

Sorting permutations with transpositions in O(n3) amortized time

Priyanshu Das

Theoretical Computer Science, 2018

View PDFchevron_right

IPS, sorting by transforming an array into its own sorting permutation with almost no space overhead

Arne Maus

2008

View PDFchevron_right

Sorting Signed Permutations by Inversions in O ( n log n ) Time

B. Moret, Vaibhav Rajan

Journal of Computational Biology, 2010

View PDFchevron_right

Comparing Fast Implementations of Bit Permutation Instructions

Ruby B. Lee

View PDFchevron_right

A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

David A Bader

Journal of Computational Biology, 2001

View PDFchevron_right

An algorithm to enumerate sorting reversals for signed permutations

Adam Siepel

2003

View PDFchevron_right

Implementation Complexity of Bit PermutationInstructions

Ruby B. Lee

View PDFchevron_right

Permutation Operations in Block Ciphers

Ruby Lee

2004

View PDFchevron_right

Bit Permutation Instructions for Accelerating Software Cryptography

Ruby B. Lee

View PDFchevron_right

Fast Digit-Index Permutations

Jaime Seguel

Scientific Programming, 1996

View PDFchevron_right

Optimum Circuits for Bit-Dimension Permutations

Jesus Grajal

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2019

View PDFchevron_right

Permutation algorithms on optical multi-trees

Koushik Sinha

Computers & Mathematics with Applications, 2008

View PDFchevron_right

On generation of permutations through decomposition of symmetric groups into cosets

Zbigniew Kokosiński

BIT, 1990

View PDFchevron_right

A compact data structure and parallel algorithms for permutation graphs

Jens Gustedt

Lecture Notes in Computer Science, 1995

View PDFchevron_right