Jump to content

David Musser

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by KasparBot (talk | contribs) at 23:32, 14 March 2016 (migrating Persondata to Wikidata, please help, see challenges for this article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

David "Dave" Musser is a professor emeritus of computer science at the Rensselaer Polytechnic Institute in Troy, New York, U.S.

He is known for his work in generic programming, particularly as applied to C++, and his collaboration with Alexander Stepanov. Their work together includes coining the term "generic programming" in Musser & Stepanov (1989), and led to the creation of the C++ Standard Template Library (STL).

In Musser (1997), he developed the sorting algorithm called introsort (also known as introspective sort), and the related selection algorithm called introselect, to provide algorithms that are both efficient and have optimal worst-case performance, for use in the STL.[1]

In 2007 he retired from Rensselaer.

Selected publications

  • Musser, D. R.; Stepanov, A. A. (1989). "Generic programming". In P. Gianni (ed.). Symbolic and Algebraic Computation: International symposium ISSAC 1988. Lecture Notes in Computer Science. Vol. 358. pp. 13–25. doi:10.1007/3-540-51084-2_2. ISBN 978-3-540-51084-0. {{cite book}}: Invalid |ref=harv (help)
  • Musser, David R. (1997). "Introspective Sorting and Selection Algorithms". Software: Practice and Experience. 27 (8). Wiley: 983–993. doi:10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |doi_brokendate= ignored (|doi-broken-date= suggested) (help)

References

  1. ^ "Generic Algorithms", David Musser