Entry Trono:1991:ACA from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

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{Trono:1991:ACA,
  author =       "John A. Trono",
  title =        "Average case analysis when merging two ordered lists
                 of different length",
  journal =      j-SIGCSE,
  volume =       "23",
  number =       "3",
  pages =        "5--6",
  month =        sep,
  year =         "1991",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/126459.126461",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:16 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "A derivation for the expected number of comparisons
                 when merging two ordered lists is given, where the
                 sizes of the individual lists are unknown but the size
                 of the merged list is known. Other applications where
                 this result can be applied are also mentioned, most
                 notably the LUPSort algorithm of Merritt and
                 Nauck[4].",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries