Jeff G Erickson
For more information
- Ph.D., Computer Science, University of California, Berkeley, July 1996
- M.S., Information and Computer Science, University of California, Irvine, June 1992
- B.A., Computer Science and Mathematical Sciences (double major), Rice University, May 1987
I have been a faculty member in the Department of Computer Science since 1998 and a full professor since 2010; I was named a Sohaib and Sara Abbasi Professor in 2020. I have published over 100 technical papers in computational geometry, computational topology, graph algorithms, and related topics at the intersection of computer science and mathematics. Among many other conference committee memberships, I was the chair of the community-elected steering committee for the International Symposium on Computational Geometry (SOCG) from 2013 to 2016, and I am currently a SafeTOC (anti-harassment) advocate for SOCG and for the ACM-SIAM Symposium on Discrete Algorithms (SODA).
I primarily teach large algorithms classes; my free Algorithms textbook is used in dozens of computer science departments and by myriads of of students, recruiters, and professionals around the world. I am an Education Innovation Fellow in the Grainger College of Engineering's Academy of Excellence in Engineering Education. Exactly half of my former PhD students have won NSF CAREER awards. My own awards include a Sloan Research Fellowship, an NSF CAREER award, and numerous teaching and research awards from the University of Illinois.
At various times in my professional life I have been an associate department head (in charge of faculty hiring), the chair of the faculty advisory committee, an Apple II assembly-language programmer, a disk jockey, a pizza cook, and a knot-tying instructor at a Boy Scout camp. My current favorite brands of espresso are Unicorn Blood by Dark Matter and Redacted by Blue Copper. Please see http://jeffe.cs.illinois.edu/cv.pdf for a detailed curriculum vitae.
- Sohaib and Sara Abbasi Professor, University of Illinois at Urbana-Champaign, 2020-present
- Professor, University of Illinois at Urbana-Champaign, 2010-present
- Associate Professor (tenured), University of Illinois at Urbana-Champaign, 2004-2010
- Assistant Professor, University of Illinois at Urbana-Champaign, 1998-2004
I primarily teach courses in algorithms. My free algorithms textbook, along with an extensive archive of related course materials, is available at http://jeffe.cs.illinois.edu/teaching/algorithms/. Please send me bug reports!
For a complete overview of my research activities, please see my publication archive at http://jeffe.cs.illinois.edu/pubs/.
- Algorithms, data structures, and lower bounds
- Computational and discrete geometry and topology
- Combinatorial optimization
Books Authored or Co-Authored (Original Editions)
- Jeff Erickson. Algorithms. 1st edition, xiv+454 pages, June 2019. A self-published open-access textbook.
Selected Articles in Journals
- Jeff Erickson and Yipu Wang. Topologically trivial closed walks in directed surface graphs. Discrete & Computational Geometry 64(4):1253–1294, 2020, special issue of invited papers from the 35th International Symposium on Computational Geometry.
- Hsien-Chih Chang and Jeff Erickson. Untangling planar curves. Discrete & Computational Geometry 58(4):889--920, 2017, special issue of invited papers from the 32nd International Symposium on Computational Geometry.
- Hugo Akitaya, Greg Aloupis, Jeff Erickson, and Csaba Tóth. Recognizing weakly simple polygons. Discrete & Computational Geometry 58(4):785--821, 2017, special issue of invited papers from the 32nd International Symposium on Computational Geometry.
- Jeff Erickson. Efficiently hex-meshing things with topology. Discrete & Computational Geometry 52(3):427–449, 2014, special issue of invited papers from the 29th Symposium on Computational Geometry.
- David Bremner, Timothy M. Chan, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Pǎtraşcu, and Perouz Taslakian. Necklaces, convolutions, and X + Y. Algorithmica 69(2): 294–314, 2014.
- Jeff Erickson and Amir Nayyeri. Tracing compressed curves in triangulated surfaces. Discrete & Computational Geometry 49(4):823--863, 2013, special issue of invited papers from the 28th Symposium on Computational Geometry.
- Sergio Cabello, Erin W. Chambers, and Jeff Erickson. Multiple-source shortest paths in surface-embedded graphs. SIAM Journal on Computing, 42(4):1542--1571, 2013. ArXiv:1202.0314.
- Erin W. Chambers, Jeff Erickson, and Amir Nayyeri. Homology flows, cohomology cuts. SIAM Journal on Computing 41(6):1605–1634, 2012, special section of invited papers from the 41st Annual ACM Symposium on Theory of Computing.
Articles in Conference Proceedings
- Jeff Erickson, Gabriel Nivasch, and Junyan Xu. Fusible numbers and Peano Arithmetic. To appear in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021.
- Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten LoÌˆffler, Tillmann Miltzow, JeÌroÌ‚me Urhausen, Jordi Vermeulen, and Giovanni Viglietta. Chasing puppies: Curve-constrained beacon routing. To appear in Proceedings of the 37th International Symposium on Computational Geometry, 2021.
- Erin Chambers, Jeff Erickson, Patrick Lin, and Salman Parsa. How to morph graphs on the torus. Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2759–2778, 2021.
- Jeff Erickson and Ivor van der Hoog and Tillman Miltzow. Smoothing the gap between NP and ∃ℝ. Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science, 1022-1033, 2020.
- Jeff Erickson and Patrick Lin. A toroidal Maxwell-Cremona-Delaunay correspondence. Proceedings of the 36th International Symposium on Computational Geometry 40:1–40:17, 2020.
- Hsien-Chih Chang, Marcos Cossarini, and Jeff Erickson. Lower bounds for electrical reduction on surfaces. Proceedings of the 35th International Symposium on Computational Geometry, 25:1–25:16, 2019.
- Jeff Erickson, Kyle Fox, and Luvsandondov Lkhamsuren. Holiest minimum-cost paths and flows in surface graphs. Proceedings of the 50th Annual ACM Symposium on Theory of Computing, 1319–1332, 2018
- Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Stephan Tillmann, Eric Sedgwick, and Dylan Thurston. Tightening curves on surfaces via local moves. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 121–135, 2018.
- Hsien-Chih-Chang, Jeff Erickson, and Chao Xu. Detecting weakly simple polygons. Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms, 1655–1670, 2015
- Jeff Erickson and Kim Whittlesey. Transforming curves on surfaces redux. Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, 1646–1655, 2013.
- Jeff Erickson and Amir Nayyeri. Minimum cuts and shortest non-separating cycles via homology covers. Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 1166–1176, 2011.
Conferences Organized or Chaired
- Program committee, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
- Program committee, 2019 Symposium on Simplicity in Algorithms (2019)
- Program committee, 34th International Symposium on Computational Geometry (SOCG 2018) — submission forbidden
- Organizing committee, Dagstuhl Seminar on Computational Geometry (2019)
- Program committee, 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) — submission forbidden
- Organizing committee, Oberwolfach Seminar on Computational Geometric and Algebraic Topology (2015)
- Steering committee chair, Symposium on Computational Geometry (SOCG), 2013–2016. Committee members elected by the research community, officers elected by the committee. Oversaw the 2014 community vote ending SOCG's 30-year affiliation with ACM; see http://makingsocg.wordpress.com for details.
- Program committee chair, 23rd Annual ACM Symposium on Computational Geometry (SOCG 2007)
- Education Innovation Fellow, Grainger College of Engineering, 2017-2018 and 2019-2021
- Campus Award For Excellence in Undergraduate Teaching, May 2007
- Everitt Award for Teaching Excellence, College of Engineering, April 2001
- List of Teachers Ranked as Excellent by Their Students: Spring 1999, Fall 2000, Spring 2001 (outstanding rating), Fall 2001, Fall 2005, Fall 2006, Spring 2007, Spring 2008, Spring 2010, Fall 2010, Spring 2011, Fall 2012, Fall 2013, Fall 2014, Spring 2015 (outstanding rating), Fall 2015, Spring 2016, Spring 2017 (outstanding rating), Fall 2017, Spring 2018, Fall 2019, Spring 2020, and Fall 2021 (outstanding rating)
- NSF Career Award (CCR-0093348), 2001-2006
- Alfred P. Sloan Research Fellowship, 1999-2001
- CS 374 - Intro to Algs & Models of Comp
- CS 473 - Algorithms
- CS 498 - Computational Geometry
- CS 498 - Theory II
- CS 591 - Advanced Seminar
- CS 598 - Algorithms for 1D Structures
- CSE 414 - Algorithms
- ECE 374 - Intro to Algs & Models of Comp
- MATH 473 - Algorithms