http://www.stepanovpapers.com en http://www.stepanovpapers.com/eop/lecture_all.pdf Book and lectures. Code compiles again; Chapter 12 in progress. Last update: May 2, 2008. Contact person: paul.mcjones adobe.com Sat, 03 May 2008 00:40:00 GMT http://www.stepanovpapers.com/Stepanov-Science_of_C++_Programming-1993.pdf Alexander A. Stepanov: Science of C++ Programming. Invited presentation to C++ standards committee, San Jose, California, November 11, 1993, 25 slides. Last update: May 30, 2007. Contact person: webmaster@stepanovpapers.com http://www.stepanovpapers.com/notes.pdf This site is a collection of Alex Stepanov's papers, class notes, and source code, covering generic programming and other topics. Last update: October 3, 2006. Contact person: webmaster@stepanovpapers.com http://www.stepanovpapers.com/PAM.pdf Mat Marcus's notes and supplements from Alex Stepanov's Programming as Mathematics course given at Adobe Systems in 2004-2005 (no longer actively updated). This volume is concerned with mathematical preliminaries (up to RSA) http://www.stepanovpapers.com/FOP2.pdf Mat Marcus's notes and supplements from Alex Stepanov's Programming as Mathematics course given at Adobe Systems in 2004-2005 (no longer actively updated). This volume is concerned with generic programming. http://www.stepanovpapers.com/find.pdf Notes from the May 2004 Foundations of Programming course given at Adobe Systems beginning in May 2004 http://www.stepanovpapers.com/container_benchmark.cpp The primary purpose of this benchmark is to show how different standard containers are in terms of performance. We have observed that programmers often use sets, multisets, deques in the situations where sorted vectors are the optimal solutions. Similarly, programmers often choose lists simply because they do a few insertions and deletions without knowing that vectors are more efficient at that for small containers. The secondary purpose of the benchmark is to encourage compiler and library vendors to keep improving performance. For example, it is not acceptable that some compilers give you a sizable penalty for using vector iterators instead of pointer. It is also quite clear that performance of other standard containers could be improved. http://www.stepanovpapers.com/gcd.pdf Lecture originally prepared as the 1999 Arthur Schoffstall Lecture in Computer Science and Computer Engineering at the Rensselaer Polytechnic Institute (updated June 2004) http://www.stepanovpapers.com/CPCW_Interview.pdf From Chinese Popular Computer Week, February 28th 2005. http://www.stepanovpapers.com/DeSt98.pdf Report of the Dagstuhl Seminar on Generic Programming, Schloss Dagstuhl, Germany, Apr. 1998, also appears in Lecture Notes in Computer Science (LNCS) volume 1766, pages 1-11