• USA-2002

    For contributions to complexity theory, descriptive complexity, and database theory.

Professor Neil Immerman is one of the key developers of an active research program called descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory. Professor Immerman is an editor of the SIAM Journal on Computing and of Logical Methods in Computer Science. He received B.S. and M.S. degrees from Yale University in 1974 and his Ph.D. from Cornell University in 1980. His book Descriptive Complexity appeared in 1999. Immerman is the winner, jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize in theoretical computer science. Immerman is an ACM Fellow and a Guggenheim Fellow.