Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Wilson:1983:AIP,
author = "J. M. Wilson",
title = "Algorithm 114: Interrupted permutations in
lexicographic order",
journal = j-COMP-J,
volume = "26",
number = "1",
pages = "92--92",
month = feb,
year = "1983",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/26.1.92",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj1980.bib",
acknowledgement = ack-nhfb,
classcodes = "C1140Z (Other topics in statistics)",
corpsource = "Dept. of Management Studies, Loughborough Univ. of
Technol., Loughborough, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "FORTRAN routines; interrupted permutations;
lexicographic permutations; PERM; statistical analysis;
subroutines; SWITCH",
treatment = "P Practical",
}