Neil Immerman

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.


Recent Publications     and      Recent Talks


Summer 2013: I will be around for much of the summer, please email me if you would like to meet.
Fall 2013: I will teaching: CS513 and 690LG: Logic in Computer Science


I am a member of the Theory Group     Department of Computer Science Phone: (413) 545-1862
140 Governors Drive, Room 374 FAX: (413) 545-1249
Here is a campus map University of Massachusetts Amherst     Email: immerman at cs.umass.edu
Amherst, MA 01003-9264


Other Stuff:


Here is a diagram of the world of computability and complexity: