Lee J. Stemkoski
Associate Professor
Mathematics And Computer Science
Science Building Room 418
516.877.4495
516.877.4499
STEMKOSKI@ADELPHI.EDU
http://adelphi.edu/~stemkoski/
Associate Professor
Mathematics And Computer Science
Science Building Room 418
516.877.4495
516.877.4499
STEMKOSKI@ADELPHI.EDU
http://adelphi.edu/~stemkoski/
General Information
Ph.D., Dartmouth College (2006)
M.A., Dartmouth College (2003)
M.A., Boston University (2001)
B.A., Boston University (2001)
Calculus III
Game Programming
Graphical User Interface Programming
Introduction To Computer Programming (lab)
Introduction To Computer Programming (lecture)
Introduction To Ordinary Differential Equations
Introduction To Video Game Programming
Software Seminar: C # And Unity
While I have been a professor at Adelphi University, I have taught over 30 different courses and 50 independent studies. Some of these classes include:
Mathematics courses:
* Calculus 1 (Differential)
* Calculus 2 (Integral)
* Calculus 3 (Multivariable)
* Differential Equations
* Linear Algebra
* Math Honors Seminar
* Proofs and Abstract Reasoning
* Geometry (Euclidean and Non-Euclidean)
* Number Theory
* Advanced Mathematical Modeling
* Mathematical Biology
* Actuarial Science
* Analysis
* Abstract Algebra 1
* Abstract Algebra 2
* History of Mathematics
Computer Science:
* Introduction to Video Game Programming
* Discrete Structures
* Introduction to Computer Programming (Java)
* Computer Organization and Assembly Language
* Survey of Programming Languages
* Graphical User Interfaces
* Video Game Programming
* 3D Graphics and Image Processing
* Cryptography
* Artificial Intelligence
Selected student research topics:
* Mathematical Modeling
* Complexity Theory
* Game Theory
* Group Theory
* Knot Theory
* History of Mathematics
The cornerstones of my teaching philosophy consist of creating an active learning environment, cultivating a depth of understanding, helping students craft optimal learning strategies, and encouraging them to refine their knowledge in the process of helping others. For each class I teach, I distill these ideas into concise and memorable six-word phrases. This set of philosophies serves students as an academic compass: guiding them to the most beneficial mindset for our current course, and hopefully developing habits that will continue to serve them well in future courses.
These philosophies, originally conceived for mathematics students, are as follows:
• You Learn Math By Doing Math. [To learn the material, you must actively perform calculations, make deductions, and solve exercises.]
• The Answer Is Not The Goal. [You must be able to communicate the solution that leads to the answer, and understand the underlying principles and techniques well enough to adapt them to a variety of situations.]
• Always Study Strategically, Steadily, and Socially. [Create actionable plans, start work immediately and continue to work consistently, and practice communicating your understanding with others.]
• You Master Math By Teaching Math. [True understanding is attained when you can explain a topic without notes or references, spontaneously answer questions and discuss the course material, and adjust your explanations to effectively help your peers gain an understanding as well.]
Adapted for a computer science course, these philosophies are as follows:
• You Learn Programming By Writing Programs. [To learn the material, you must write many programs that accomplish tasks using a variety of approaches.]
• Write Programs That Go Beyond “Working”. [It isn't enough that software produces a desired result; it must be user-friendly, efficient, well-documented, reusable, and extendable.]
• Always Work Strategically, Steadily, and Socially. [Set well-defined deadlines with testable steps; work continuously; engage in a development community.]
• You Achieve Mastery Through Assisting Others. [You will become a better programmer if you regularly help others debug and test their software, and provide relevant and applicable feedback on their work.]
Mathematical research interests:
* History of Mathematics
* Number Theory
* Knot Theory
Computer science research interests:
* 3D Graphics
* Video Game Development
Beginning Java Game Development with LibGDX.
New York: Apress, 2015. ISBN: 978-1484215012.
Game Development with Construct 2.
(In preparation.)
C. Lathrop and L. Stemkoski (2007). Parallels in the Work of Leonhard Euler and Thomas Clausen. In R. Bradley, L. D'Antonio, C.E. Sandifer (Eds.). Euler at 300: An Appreciation. (pp. 217-226). Washington DC: Mathematical Association of America.
D. Klyve and L. Stemkoski (2007). The Euler Archive: Giving Euler to the World. In R. Bradley, L. D'Antonio, C.E. Sandifer (Eds.). Euler at 300: An Appreciation. (pp. 33-40). Washington DC: Mathematical Association of America.
D. Klyve and L. Stemkoski (2007). Greaco-Latin Squares and a Mistaken Conjecture of Euler. In W. Dunham (Eds.). The Genius of Euler: Reflections on his Life and Work. (pp. 273-288). Washington DC: Mathematical Association of America.
Stemkoski, L. Introduction to JavaFX for Game Development. GameDevelopment.TutsPlus.com (2015)
Bloch, S. and Stemkoski, L. "Functional Game Programming in Java-Based CS1". Journal of Computing Sciences in Colleges, Volume 29 (2), 2013.
Klyve, D., Stemkoski, L., and Tou, E. (2011), Teaching and Research with Original Sources from the Euler Archive. Convergence, (8).
Bradley, R. and Stemkoski, L. (2011), When Nine Points are Worth But Eight: Euler's Resolution of Cramer's Paradox. Convergence, (8).
Stemkoski, L. (2010), Parameterized Knots. Loci Featured Items, (2).
Stemkoski, L. and Storm, C. (2009), Applets and Activities for Real Analysis. Loci Resources, (1).
Stemkoski, L. (2009), Teaching Time Savers: The Homework Self-Evaluation Challenge. FOCUS: The Newsletter of the Mathematical Association of America, (4), 13.
Stemkoski, L., and Tou, E. (2009), Explicit Construction of Arithmetic Lattices in SL(3,R). International Journal of Mathematics and Computer Science, (4), 53--64.
Stemkoski, L. (2009), Investigating Euler's Polyhedral Formula Using Original Sources. Convergence, (6).
Klyve, D. and Stemkoski, L. (2006), Graeco-Latin Squares and a Mistaken Conjecture of Euler. College Mathematics Journal, (1), 2--15.
Kim, P., Stemkoski, L., and C. Yuen (2001), Polynomial Knots of Degree Five. MIT Undergraduate Journal of Mathematics, (3), 125--135.
(2015). Rendering Photorealistic Knots: Theory and Practice. Contributer Paper Session, Joint Mathematics Meetings. San Antonio, TX.
(2014). Leonhard Euler's Work in Number Theory and the Commentationes Arithmeticae. Pohle Colloquium, Adelphi University. Garden City, NY.
(2014). Classifying Families of Polynomial Knots. Joint Mathematics Meetings. Baltimore, MD.
(2013). The Work of Leonhard Euler related to Fermat's Last Theorem. In Joint Mathematics Meetings. San Diego, CA.
(2012). The Coeffcient Space of Polynomial Knots. In Joint Mathematics Meetings. Boston, MA.
(2011). Applications of Calculus to Game Theory: The Prisoners' Dilemma. In Joint Mathematics Meetings. New Orleans, LA.
(2010). Alternative Forms of Assessment in Mathematics. In Joint Mathematics Meetings. San Francisco, CA.
(2010). Online Articles from J.O.M.A. to Loci. In Joint Mathematics Meetings. San Francisco, CA.
(2009). Agent-Based Models of Population Segregation. In Adelphi University Faculty Works in Progress Seminar. Garden City, NY.
(2008). Analyzing Strategies for Interaction: Game Theory in a Calculus Course. In MathFest 2008. Madison, WI.
(2007). Agent-Based Models of Species Interaction and Reproduction. In Adelphi University Interdisciplinary Science Symposium. Garden City, NY.
(2007). The Unpublished Notebooks and Manuscripts of Leonhard Euler. In The Pohle Colloquium. Garden City, NY.
(2007). Cataloging and Publishing Euler's Works: A History. In MathFest 2007. San Jose, CA.
(2007). The Euler Archive: Illuminating the Life and Times of Leonhard Euler. Embassy of Switzerland, Washington D.C..
(2007). Investigating Euler's Polyhedral Formula Using Original Sources. In Joint Mathematics Meetings. New Orleans, LA.
(2006). The Fuss Index vs. the Enestrom Index: An Euler Archive Update. In Euler 2K+6. Albany, NY.
(2006). The Prisoners' Dilemma and the Evolution of Cooperation. In Norwich University Colloquium Series. Norwich, VT.
(2006). A Trace Formula for Compact Quotients of SL(3,R) and Weyl's Law. In Joint Mathematics Meetings. San Antonio, TX.
(2005). From the Riemann Zeta Function to the Selberg Trace Formula. In Middlebury College Mathematics Department Seminar. Middlebury, VT.
(2005). Simulating Evolution using the Iterated Prisoners' Dilemma. In Dartmouth College Graduate Student Seminar. Hanover, NH.
Book Review: "Geometry with an Introduction to Cosmic Topology" by M. Hitchman, The MAA Mathematical Sciences Digital Library, December 2009.
Book Review: "In Search of the Riemann Zeroes" by M. Lapidus, The MAA Mathematical Sciences Digital Library, June 2008.
Book Review: "The Art of Mathematics" by J. P. King, The MAA Mathematical Sciences Digital Library, January 2008.
Book Review: "The Early Mathematics of Leonhard Euler" by C. E. Sandifer, The MAA Mathematical Sciences Digital Library, March 2007.
Interviewed for "The Euler Archive: An Interview with the Founders" in FOCUS: The Newsletter of the Mathematical Association of America, January 2007
Koala's Quest: a collection-style platform game for Android tablets, published in the Google Play store.
Over 250,000 installations (as of August 2016).
Project NExT Fellow (2006--2007)
Phi Beta Kappa (The Nation's Oldest Academic Honor Society; Inducted 2001)
Pi Mu Epsilon (National Mathematics Honor Society; Inducted 2000)