A Unified Framework to Discover Permutation Generation Algorithms

Pramod Ganapathi; Rezaul Chowdhury

doi:10.1093/comjnl/bxab181

A Unified Framework to Discover Permutation Generation Algorithms

Computer Science

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins and Lipski. We use the frameworks to design two new sorting-based permutation generation algorithms, one of which is optimal.

Original language	English
Pages (from-to)	603-614
Number of pages	12
Journal	Computer Journal
Volume	66
Issue number	3
DOIs	https://doi.org/10.1093/comjnl/bxab181
State	Published - Mar 1 2023

Keywords

permutation algorithms
permutation frameworks
permutation generation

Access to Document

10.1093/comjnl/bxab181

Cite this

@article{b2debda3b57242fa99ecbee27121c088,

title = "A Unified Framework to Discover Permutation Generation Algorithms",

abstract = "We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins and Lipski. We use the frameworks to design two new sorting-based permutation generation algorithms, one of which is optimal.",

keywords = "permutation algorithms, permutation frameworks, permutation generation",

author = "Pramod Ganapathi and Rezaul Chowdhury",

year = "2023",

month = mar,

day = "1",

doi = "10.1093/comjnl/bxab181",

language = "English",

volume = "66",

pages = "603--614",

journal = "Computer Journal",

issn = "0010-4620",

number = "3",

}

TY - JOUR

T1 - A Unified Framework to Discover Permutation Generation Algorithms

AU - Ganapathi, Pramod

AU - Chowdhury, Rezaul

PY - 2023/3/1

Y1 - 2023/3/1

N2 - We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins and Lipski. We use the frameworks to design two new sorting-based permutation generation algorithms, one of which is optimal.

AB - We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins and Lipski. We use the frameworks to design two new sorting-based permutation generation algorithms, one of which is optimal.

KW - permutation algorithms

KW - permutation frameworks

KW - permutation generation

UR - https://www.scopus.com/pages/publications/85174442208

U2 - 10.1093/comjnl/bxab181

DO - 10.1093/comjnl/bxab181

M3 - Article

AN - SCOPUS:85174442208

SN - 0010-4620

VL - 66

SP - 603

EP - 614

JO - Computer Journal

JF - Computer Journal

IS - 3

ER -

A Unified Framework to Discover Permutation Generation Algorithms

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this