Larry Finkelstein
Professor Emeritus, Dean Emeritus
Research interests
- Physical science
- Health science
- Digital arts and business
Education
- PhD in Mathematics, University of Birmingham — United Kingdom
- MS in Mathematics, University of Michigan
- BS in Mathematics, City College of New York
Biography
Larry Finkelstein joined the Khoury College of Computer Sciences as a professor in 1983 and served as dean from September 1994 to July 2014. During his time as dean, Khoury College grew significantly in stature and size, achieving prominence as one of the premier computing colleges in the nation.
Prior to joining Northeastern, Finkelstein was a professor of mathematics at Wayne State University in Detroit, as well as a member of the technical staffs of the Center for Communication Research in New Jersey and the MITRE Corporation in Massachusetts.
Finkelstein’s research expertise is in the development of efficient algorithms for solving large-scale computational problems in mathematics, computer science, and engineering. He co-organized two workshops in this area at the Center for Discrete Mathematics and Theoretical Computer Science — an NSF Science and Technology Center — and co-edited the proceedings of those workshops. He was a co-winner of the best paper award at the MITRE Corporation for work in signal processing.
Recent publications
-
Proceedings of the DIMACS Workshop on Groups and Computation
Citation: "Proceedings of the DIMACS Workshop on Groups and Computation", L Finkelstein and W.M. Kantor, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 28, 1997, AMS, Providence, RI. -
Nearly Linear Time Algorithms for Permutation Groups with a Small Base
Citation: "Nearly Linear Time Algorithms for Permutation Groups with a Small Base", L. Babai, G. Cooperman, L. Finkelstein and A. Seress, Proc. of the 1991 International Symposium on Symbolic and Algebraic Computation (ISSAC '91), Bonn, pp. 200-209, July, 1991. -
Fast Monte Carlo Algorithms for Permutation Groups
Citation: L. Babai, G. Cooperman, L. Finkelstein, E. Luks, and Á Seress. "Fast Monte Carlo Algorithms for Permutation Groups". 23rd ACM Symposium on Theory of Computer Science, 1991, pp. 90-100. DOI: 10.1006/jcss.1995.1024