Entry Naps:1998:MWE 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{Naps:1998:MWE,
  author =       "Thomas L. Naps and Eric Bressler",
  title =        "A multi-windowed environment for simultaneous
                 visualization of related algorithms on the World Wide
                 {Web}",
  journal =      j-SIGCSE,
  volume =       "30",
  number =       "1",
  pages =        "277--281",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/274790.274312",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 16:56:29 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Using algorithm visualization, we can depict the
                 execution of an algorithm as a sequence of graphical
                 snapshots, the viewing of which is controlled by the
                 user. Although the delivery of such visualizations over
                 the Web greatly increases their accessibility,
                 Web-based environments for viewing algorithms often
                 lack the richness of features that characterize similar
                 viewing environments on standalone machines. Here we
                 describe enhancements recently made to such a Web-based
                 system. These enhancements conveniently present a
                 variety of windowing options that allow the user to
                 simultaneously view multiple snapshots. These snapshots
                 may depict (1) similar views of the states of an
                 algorithm over a range of time, (2) different views of
                 the state of an algorithm at a given point in time, or
                 (3) side-by-side comparisons of different algorithms
                 that solve the same problem. We illustrate each of
                 these options using variations of the quick sort
                 algorithm.",
  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