Entry Plaxton:1997:LBS 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{Plaxton:1997:LBS,
  author =       "C. Greg Plaxton and Torsten Suel",
  title =        "Lower Bounds for {Shellsort}",
  journal =      j-J-ALG,
  volume =       "23",
  number =       "2",
  pages =        "221--240",
  month =        may,
  year =         "1997",
  CODEN =        "JOALDV",
  DOI =          "https://doi.org/10.1006/jagm.1996.0825",
  ISSN =         "0196-6774 (print), 1090-2678 (electronic)",
  ISSN-L =       "0196-6774",
  bibdate =      "Tue Dec 11 09:16:36 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
  note =         "For other Shellsort bounds, see
                 \cite{Yao:1980:AS,Sedgewick:1986:NUB,Weiss:1990:TLB,Poonen:1993:WCS,Goodrich:2011:RSS}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0196677496908251",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Algorithms",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01966774",
  remark =       "The authors show worst-case lower bounds for the
                 Shellsort algorithm of $\Omega(n (\lg n)^2 / (\lg \lg
                 N)^2)$ for arbitrary increments.",
}

Related entries