Entry Mitzenmacher:1996:DSP 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{Mitzenmacher:1996:DSP,
  author =       "Michael Mitzenmacher",
  title =        "Designing stimulating programming assignments for an
                 algorithms course: a collection of exercises based on
                 random graphs",
  journal =      j-SIGCSE,
  volume =       "28",
  number =       "3",
  pages =        "29--36",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/234867.234875",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:35 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "The field of random graphs contains many surprising
                 and interesting results. Here we demonstrate how some
                 of these results can be used to develop stimulating,
                 open-ended exercises for courses in algorithms and data
                 structures or graph theory. Specifically, we provide
                 problems for algorithms that compute minimum spanning
                 trees, connected components, maximum flows, and
                 all-pairs shortest paths.",
  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