Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Atkinson:1980:PGS,
author = "M. D. Atkinson",
title = "Permutation groups and set union algorithms",
journal = j-COMP-J,
volume = "23",
number = "2",
pages = "187--187",
month = may,
year = "1980",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/23.2.187-a",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:08 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/23/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/23/2/187.2.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_02/tiff/187.tif",
acknowledgement = ack-nhfb,
classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computing Math., Univ. Coll., Cardiff, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computational; group theory; membership; partition;
programming theory; set union algorithms",
treatment = "T Theoretical or Mathematical",
}