Entry Sedgewick:1986:NUB from jalg.bib

Last update: Sat Oct 14 02:35:45 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{Sedgewick:1986:NUB,
  author =       "Robert Sedgewick",
  title =        "A new upper bound for {Shellsort}",
  journal =      j-J-ALG,
  volume =       "7",
  number =       "2",
  pages =        "159--173",
  month =        jun,
  year =         "1986",
  CODEN =        "JOALDV",
  DOI =          "https://doi.org/10.1016/0196-6774(86)90001-5",
  ISSN =         "0196-6774 (print), 1090-2678 (electronic)",
  ISSN-L =       "0196-6774",
  bibdate =      "Tue Dec 11 09:14:28 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
  note =         "For other Shellsort bounds, see
                 \cite{Yao:1980:AS,Weiss:1990:TLB,Poonen:1993:WCS,Plaxton:1997:LBS,Goodrich:2011:RSS}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/0196677486900015",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Algorithms",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01966774",
  remark =       "The author derives a new worst-case (upper) bound of
                 $O(N^{4/3})$ operations for the Shellsort algorithm,
                 improving the previously best-known bound of
                 $O(N^{3/2})$.",
}

Related entries