The Massachusetts Institute of Technology (MIT) is a private land-grant research university in Cambridge, Massachusetts. Established in 1861, MIT has played a significant role in the development of many areas of modern technology and science.
Amherst College is a private liberal arts college in Amherst, Massachusetts. Founded in 1821 as an attempt to relocate Williams College by its then-president Zephaniah Swift Moore, Amherst is the third oldest institution of higher education in Massachusetts. The institution was named after the town, which in turn had been named after Jeffery, Lord Amherst, Commander-in-Chief of British forces of North America during the French and Indian War. Originally established as a men's college, Amherst became coeducational in 1975.
Hampshire College is a private liberal arts college in Amherst, Massachusetts. It was opened in 1970 as an experiment in alternative education, in association with four other colleges in the Pioneer Valley: Amherst College, Smith College, Mount Holyoke College, and the University of Massachusetts Amherst. Together they are known as the Five College Consortium. The campus also houses the National Yiddish Book Center and Eric Carle Museum, and hosts the annual Hampshire College Summer Studies in Mathematics.
The University of Massachusetts Amherst is a public land-grant research university in Amherst, Massachusetts. It is the oldest, largest, and flagship campus in the University of Massachusetts system, and was founded in 1863 as an agricultural college. It is also a member of the Five College Consortium, along with four other colleges in the Pioneer Valley.
The Summer Science Program (SSP) is an academic summer program where high school students experience college-level education and do research in celestial mechanics by studying the orbits of asteroids, biochemistry by studying the kinetic properties of enzymes, or genomics by studying antibiotic resistance. The program was established in 1959 at The Thacher School in Ojai, California. It now takes place on three astrophysics campuses, New Mexico Tech in Socorro, New Mexico, the University of North Carolina at Chapel Hill in Chapel Hill, North Carolina, and University of Colorado, Boulder in Boulder, Colorado, and two biochemistry campuses, Purdue University in West Lafayette, Indiana and Indiana University Bloomington in Bloomington, Indiana.
Neil Immerman is an American theoretical computer scientist, a professor of computer science at the University of Massachusetts Amherst. He is one of the key developers of descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory.
Lenore Carol Blum is an American computer scientist and mathematician who has made contributions to the theories of real number computation, cryptography, and pseudorandom number generation. She was a distinguished career professor of computer science at Carnegie Mellon University until 2019 and is currently a professor in residence at the University of California, Berkeley. She is also known for her efforts to increase diversity in mathematics and computer science.
Andrew G. Barto is an American computer scientist, currently Professor Emeritus of computer science at University of Massachusetts Amherst. Barto is best known for his foundational contributions to the field of modern computational reinforcement learning.
Moshe Ya'akov Vardi is an Israeli mathematician and computer scientist. He is the Karen Ostrum George Distinguished Service Professor in Computational Engineering at Rice University, United States. and a faculty advisor for the Ken Kennedy Institute. His interests focus on applications of logic to computer science, including database theory, finite model theory, knowledge of multi-agent systems, computer-aided verification and reasoning, and teaching logic across the curriculum. He is an expert in model checking, constraint satisfaction and database theory, common knowledge (logic), and theoretical computer science.
Jack Keil Wolf was an American researcher in information theory and coding theory.
Arnold Leonard Rosenberg is an American computer scientist. He is a distinguished university professor emeritus at the University of Massachusetts Amherst, and despite his retirement from UMass he continues to hold research positions at Northeastern University and Colorado State University.
Alice Carmichael Harris is an American linguist. She is Professor emerita of Linguistics at the University of Massachusetts Amherst.
Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.
Sarah Jane Witherspoon is an American mathematician interested in topics in abstract algebra, including Hochschild cohomology[SW99] and quantum groups.[W96][BW04] She is a professor of mathematics at Texas A&M University
Jelani Osei Nelson is an Ethiopian-American Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of AddisCoder, a computer science summer program for Ethiopian high school students in Addis Ababa.
Claire Cardie is an American computer scientist specializing in natural language processing. Since 2006, she has been a professor of computer science and information science at Cornell University, and from 2010 to 2011 she was the first Charles and Barbara Weiss Chair of Information Science at Cornell. Her research interests include coreference resolution and sentiment analysis.
Lenore Jennifer Cowen is an American mathematician and computer scientist known for her work in graph coloring, network routing, and computational biology. She is a professor of computer science and of mathematics at Tufts University.
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.
