Entry Fillebrown:1992:FCB 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{Fillebrown:1992:FCB,
  author =       "Sandra Fillebrown",
  title =        "Faster computation of {Bernoulli} numbers",
  journal =      j-J-ALG,
  volume =       "13",
  number =       "3",
  pages =        "431--445",
  month =        sep,
  year =         "1992",
  CODEN =        "JOALDV",
  DOI =          "https://doi.org/10.1016/0196-6774(92)90048-H",
  ISSN =         "0196-6774 (print), 1090-2678 (electronic)",
  ISSN-L =       "0196-6774",
  bibdate =      "Tue Dec 11 09:15:18 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 http://www.math.utah.edu/pub/tex/bib/jalg.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/019667749290048H",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Algorithms",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01966774",
  remark =       "The author gives algorithms for computing Bernoulli
                 numbers of high order that require at most $\lfloor 2 n
                 \lg n \rfloor$ bits. One algorithm requires $O(n^2 \log
                 n)$ multiplications of numbers of $O(n \log n)$ bits,
                 and the other need $O(n)$ multiplications of numbers of
                 $O(n \log n)$ bits.",
}

Related entries