Entry Alonso:1996:PAG from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | 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{Alonso:1996:PAG,
  author =       "Laurent Alonso and Ren{\'e} Schott",
  title =        "A parallel algorithm for the generation of a
                 permutation and applications",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "1",
  pages =        "15--28",
  day =          "28",
  month =        may,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=159&issue=1&aid=2139",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics)C6120 (File
                 organisation); C4240C (Computational complexity);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "CRIN, Inst. Nat. de Recherche en Inf. et
                 Autom.-Lorraine, Vandoeuvre-les-Nancy, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bijection; computational complexity; Dyck word;
                 Motzkin words; O(Log/sup 2/(n)) time; parallel
                 algorithm; parallel algorithms; permutation; tree data
                 structures; trees; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries