Entry Campbell:1991:FMW from compj.bib

Last update: Sun Nov 30 02:31:30 MST 2003                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{Campbell:1991:FMW,
  author =       "D. Campbell and T. McNeill",
  title =        "Finding a Majority When Sorting is Not Available",
  journal =      j-COMP-J,
  volume =       "34",
  number =       "2",
  pages =        "186--186",
  month =        apr,
  year =         "1991",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620",
  bibdate =      "Mon Jul 26 14:08:16 1999",
  bibsource =    "http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_02/",
  note =         "See correspondence \cite{Gries:1992:CFM}.",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_02/tiff/186.tif",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT,
                 USA",
  classcodes =   "C6120 (File organisation); C4240 (Programming and
                 algorithm theory); C1160 (Combinatorial mathematics)",
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT,
                 USA",
  keywords =     "abstract data type; Abstract data type; data
                 structures; equivalence; equivalence class; Equivalence
                 class; equivalence classes; Equivalence relation;
                 majority; Majority; Object; programming theory;
                 relation; sorting; Sorting; space-frugal algorithm;
                 Space-frugal algorithm",
  thesaurus =    "Data structures; Equivalence classes; Programming
                 theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries