Eugene Michael Luks (born circa 1940)[1] is an American mathematician and computer scientist, a professor emeritus of computer and information science at the University of Oregon.
He is known for his research on the graph isomorphism problem and on algorithms for computational group theory.
Luks did his undergraduate studies at the City College of New York, earning a bachelor's degree in 1960,[2] and went on to graduate studies at the Massachusetts Institute of Technology, earning a doctorate in mathematics in 1966 under the supervision of Kenkichi Iwasawa.
[1] He retired in 2006,[4] but was recalled in 2012–2013 to serve as interim chair.
[5] In 1985, Luks won the Fulkerson Prize for his work showing that graph isomorphism could be tested in polynomial time for graphs with bounded maximum degree.