Eugene Michael Luks (born circa 1940) is an American

mathematician A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, mathematical structure, structure, space, Mathematica ...

and

computer scientist A computer scientist is a scientist who specializes in the academic study of computer science. Computer scientists typically work on the theoretical side of computation. Although computer scientists can also focus their work and research on ...

, a professor emeritus of

computer and information science Computer and information science (CIS; also known as information and computer science) is a field that emphasizes ''both'' computing and informatics, upholding the strong association between the fields of information sciences and computer scienc ...

at the

University of Oregon The University of Oregon (UO, U of O or Oregon) is a Public university, public research university in Eugene, Oregon, United States. Founded in 1876, the university is organized into nine colleges and schools and offers 420 undergraduate and gra ...

. He is known for his research on the

graph isomorphism problem The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. The problem is not known to be solvable in polynomial time nor to be NP-complete, and therefore may be in the computational c ...

and on algorithms for computational

group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...

Professional career

Luks did his undergraduate studies at the

City College of New York The City College of the City University of New York (also known as the City College of New York, or simply City College or CCNY) is a Public university, public research university within the City University of New York (CUNY) system in New York ...

, earning a bachelor's degree in 1960, and went on to graduate studies at the

Massachusetts Institute of Technology The Massachusetts Institute of Technology (MIT) is a Private university, private research university in Cambridge, Massachusetts, United States. Established in 1861, MIT has played a significant role in the development of many areas of moder ...

, earning a doctorate in mathematics in 1966 under the supervision of

Kenkichi Iwasawa Kenkichi Iwasawa ( ''Iwasawa Kenkichi'', September 11, 1917 – October 26, 1998) was a Japanese mathematician who is known for his influence on algebraic number theory. Biography Iwasawa was born in Shinshuku-mura, a town near Kiryū, in Gunm ...

. He taught at

Tufts University Tufts University is a private research university in Medford and Somerville, Massachusetts, United States, with additional facilities in Boston and Grafton, as well as Talloires, France. Tufts also has several Doctor of Physical Therapy p ...

from 1966 to 1968, and at

Bucknell University Bucknell University is a Private college, private Liberal arts colleges in the United States, liberal-arts college in Lewisburg, Pennsylvania, United States. Founded in 1846 as the University at Lewisburg, it now consists of the College of Arts a ...

from then until 1983, when he joined the University of Oregon faculty as chair of the computer and information science department. He retired in 2006, but was recalled in 2012–2013 to serve as interim chair.Prof. Eugene Luks Named to Prestigious AMS Fellows Group
U. Oregon CIS News, accessed 2013-02-03.

Awards and honors

In 1985, Luks won the

Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at e ...

for his work showing that

graph isomorphism In graph theory, an isomorphism of graphs ''G'' and ''H'' is a bijection between the vertex sets of ''G'' and ''H'' : f \colon V(G) \to V(H) such that any two vertices ''u'' and ''v'' of ''G'' are adjacent in ''G'' if and only if f(u) and f(v) a ...

could be tested in

polynomial time In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations p ...

for graphs with bounded

maximum degree This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges. Symbols A B ...

.. In 2012 he became a fellow of the

American Mathematical Society The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, ...

.List of Fellows of the American Mathematical Society
retrieved 2013-02-02.

Selected publications

*. *. *.

References

{{DEFAULTSORT:Luks, Eugene M. Year of birth missing (living people) Living people 20th-century American mathematicians American theoretical computer scientists Graph theorists Group theorists City College of New York alumni Massachusetts Institute of Technology School of Science alumni Tufts University faculty Bucknell University faculty University of Oregon faculty Fellows of the American Mathematical Society Place of birth missing (living people) 21st-century American mathematicians