Resultado da Busca
Jeff Erickson is a computational geometer, topologist, and graphophile who teaches algorithms and theory courses. He has a free textbook, a low GPA, and a passion for computer science education research.
A free electronic version of a self-published textbook on algorithms, along with other lecture notes for theoretical computer science classes at Illinois. The book covers topics such as recursion, dynamic programming, greedy algorithms, graph algorithms, NP-hardness, and more.
Professor of Computer Science, University of Illinois Urbana-Champaign. Verified email at illinois.edu - Homepage. Algorithms data structures computational geometry computational topology.
- Education
- Biography
- Academic Positions
- Teaching Statement
- Research Statement
- Research Interests
- Books Authored Or Co-Authored
- Selected Articles in Journals
- Articles in Conference Proceedings
- Conferences Organized Or Chaired
Ph.D., Computer Science, University of California, Berkeley, July 1996M.S., Information and Computer Science, University of California, Irvine, June 1992B.A., Computer Science and Mathematical Sciences (double major), Rice University, May 1987I 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 mathemat...
Sohaib and Sara Abbasi Professor, University of Illinois at Urbana-Champaign, 2020-presentProfessor, University of Illinois at Urbana-Champaign, 2010-presentAssociate Professor (tenured), University of Illinois at Urbana-Champaign, 2004-2010Assistant Professor, University of Illinois at Urbana-Champaign, 1998-2004I 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 boundsComputational and discrete geometry and topologyComputer science educationJeff Erickson. Algorithms. 1st edition, xiv+454 pages, June 2019. A self-published open-access textbook.
Jeff Erickson and Patrick Lin. Planar and toroidal morphing made easier. Journal of Graph Algorithms and Applications27(2):95–118, 2023. special issue of invited papers from the 29th International...Jeff Erickson, Gabriel Nivasch, and Junyan Xu, Fusible numbers and Peano arithmetic. Logical Methods in Computer Science18(3:6), 2022, special issue of invited papers from the 36th Annual ACM/IEEE...Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillman Miltzow, Jérôme Urhausen, Jordi Vermeulen, and Giovanni Viglietta. Chasing puppies: Mobile beacon routing on closed curv...Jeff Erickson and Patrick Lin. A toroidal Maxwell-Cremona-Delaunay correspondence. To appear in Journal of Computational Geometry, 12(2):55–85, 2021, special special issue of invited papers from th...Jeff Erickson, Gabriel Nivasch, and Junyan Xu. Fusible numbers and Peano Arithmetic. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13, 2021. Distinguished paper.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.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, 2018Program committee, 39th International Symposium on Computational Geometry (SOCG 2023)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 forbiddenJeff Erickson's Teaching. 's Teaching. I mostly teach graduate and advanced undergraduate courses in algorithms, which is why I thought I was qualified to write an algorithms textbook. All of these links used to work, honest. Spring 2024: CS 225: Data Structures, honors section [tentative] Fall 2023: CS/ECE 374: Algorithms & Models of Computation.
Introduction to Algorithms, third edition. MIT Press/McGraw-Hill,. (I used the first edition as a teaching assistant at Berkeley.) • Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani. Algo- rithms. McGraw-Hill,. (Probably the closest in content to this book, but considerably less verbose.)
Algorithms. Jeff Erickson, 2019 - Computers - 449 pages. Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their...
