David Musser
David "Dave" Musser is a professor emeritus of computer science at the Rensselaer Polytechnic Institute in Troy, New York, United States.
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. 358. pp. 13–25. doi:10.1007/3-540-51084-2_2. ISBN 978-3-540-51084-0.CS1 maint: ref=harv (link)
- Musser, David R. (1997). "Introspective Sorting and Selection Algorithms". Software: Practice and Experience. 27 (8): 983–993. doi:10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#.CS1 maint: ref=harv (link)
gollark: React Native exists. Also Ionic or Cordova or whatever. There are a lot of ways.
gollark: Obviously, this *should* all require enough storage to store about a fifth of the entire content of Wikipedia.
gollark: It's great! I can run 1000 Firefox tabs and Minecraft and 3 VSCode instances and an Electron app simultaneously.
gollark: I used to have to, but now I have sufficient RAM.
gollark: I read *some* of them, but they could stick malicious stuff into the source or makefile and I'd not notice.
References
- "Generic Algorithms", David Musser
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.