Entry Er:1987:EIP from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Er:1987:EIP,
  author =       "M. C. Er",
  title =        "An efficient implementation of permutation
                 backtracking in lexicographic order",
  journal =      j-COMP-J,
  volume =       "30",
  number =       "3",
  pages =        "282--282",
  month =        jun,
  year =         "1987",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/30.3.282",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Jul 26 14:08:13 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/282.tif",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Western Australia, Nedlands, Aust",
  affiliationaddress = "Univ of Western Australia, Nedlands, Aust",
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C7310 (Mathematics)",
  classification = "723; 921",
  corpsource =   "Dept. of Comput. Sci., Western Australia Univ.,
                 Nedlands, WA, Australia",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "combinatorial mathematics; computational complexity;
                 computer programming; lexicographic order; mathematical
                 techniques --- Combinatorial Mathematics; mathematics
                 computing; permutation backtracking; permutation
                 generation",
  treatment =    "T Theoretical or Mathematical",
}

Related entries