Entry Robertson:1999:HMR 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{Robertson:1999:HMR,
  author =       "John S. Robertson",
  title =        "How many recursive calls does a recursive function
                 make?",
  journal =      j-SIGCSE,
  volume =       "31",
  number =       "2",
  pages =        "60--61",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/571535.571570",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 16:56:38 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "The calculation of the Fibonacci sequence using
                 recursion gives rise to an interesting question: How
                 many times does a recursive function call itself? This
                 paper presents one way to examine this question using
                 difference equations with initial conditions, or
                 discrete dynamical systems (DDS). We show that there is
                 a linear relationship between the Fibonacci numbers
                 themselves and the number of recursive calls. This
                 relationship generalizes to any type of DDS of
                 second-order, and DDS of higher-order.",
  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