William Paul Thurston was an American mathematician. He was a pioneer in the field of low-dimensional topology. In 1982, he was awarded the Fields Medal for his contributions to the study of 3-manifolds. From 2003 until his death he was a professor of mathematics and computer science at Cornell University.
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, advocacy and other programs.
Delbert Ray Fulkerson was an American mathematician who co-developed the Ford–Fulkerson algorithm, one of the most well-known algorithms to solve the maximum flow problem in networks.
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 each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.
Society for Industrial and Applied Mathematics (SIAM) is an academic association dedicated to the use of mathematics in industry. SIAM is the world's largest professional association devoted to applied mathematics, and roughly two-thirds of its membership resides within the United States. Founded in 1951, the organization began holding annual national meetings in 1954, and now hosts conferences, publishes books and scholarly journals, and engages in lobbying in issues of interest to its membership. The focus for the society is applied, computational, and industrial mathematics, and the society often promotes its acronym as "Science and Industry Advance with Mathematics". Members include engineers, scientists, and mathematicians, both those employed in academia and those working in industry. The society supports educational institutions promoting applied mathematics.
Herbert Saul Wilf was a mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics in Combinatorial Analysis and Computing at the University of Pennsylvania. He wrote numerous books and research papers. Together with Neil Calkin he founded The Electronic Journal of Combinatorics in 1994 and was its editor-in-chief until 2001.
Hendrik Willem Lenstra Jr. is a Dutch mathematician.
Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.
Robert Duncan MacPherson is an American mathematician at the Institute for Advanced Study and Princeton University. He is best known for the invention of intersection homology with Mark Goresky, whose thesis he directed at Brown University. MacPherson previously taught at Brown University, the University of Paris, and the Massachusetts Institute of Technology. In 1983 he gave a plenary address at the International Congress of Mathematicians in Warsaw.
George Daniel Mostow was an American mathematician, renowned for his contributions to Lie theory. He was the Henry Ford II (emeritus) Professor of Mathematics at Yale University, a member of the National Academy of Sciences, the 49th president of the American Mathematical Society (1987–1988), and a trustee of the Institute for Advanced Study from 1982 to 1992.
Louis Joseph Billera is a Professor of Mathematics at Cornell University.
Andrew Joseph Majda was an American mathematician and the Morse Professor of Arts and Sciences at the Courant Institute of Mathematical Sciences of New York University. He was known for his theoretical contributions to partial differential equations as well as his applied contributions to diverse areas including shock waves, combustion, incompressible flow, vortex dynamics, and atmospheric sciences. Majda was listed as an ISI highly cited researcher in mathematics.
Andrei Vladlenovich Zelevinsky was a Russian-American mathematician who made important contributions to algebra, combinatorics, and representation theory, among other areas.
Sergey Vladimirovich Fomin is a Russian American mathematician who has made important contributions in combinatorics and its relations with algebra, geometry, and representation theory. Together with Andrei Zelevinsky, he introduced cluster algebras.
Michel Xavier Goemans is a Belgian-American professor of applied mathematics and the RSA Professor of Mathematics at MIT working in discrete mathematics and combinatorial optimization at CSAIL and MIT Operations Research Center.
Alexander (Lex) Schrijver is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the Centrum Wiskunde & Informatica in Amsterdam. Since 1993 he has been co-editor in chief of the journal Combinatorica.
Jesús Antonio De Loera is a Mexican-American mathematician at the University of California, Davis, specializing in discrete mathematics and discrete geometry.
Gérard Pierre Cornuéjols is the IBM University Professor of Operations Research in the Carnegie Mellon University Tepper School of Business. His research interests include facility location, integer programming, balanced matrices, and perfect graphs.
Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference.
Jin-Yi Cai is a Chinese American mathematician and computer scientist. He is a professor of computer science, and also the Steenbock Professor of Mathematical Sciences at the University of Wisconsin–Madison. His research is in theoretical computer science, especially computational complexity theory. In recent years he has concentrated on the classification of computational counting problems, especially counting graph homomorphisms, counting constraint satisfaction problems, and Holant problems as related to holographic algorithms.
