Logic in Computer Science, computer-aided verification, complexity theory, database theory.
Ph.D., Cornell University (1980), M.S., Yale University (1974), B.S., Yale University (1974). Professor Immerman has been on the faculty of the University of Massachusetts Amherst since 1989, and is currently a Professor of Computer Science. Visiting Professor, Computer Science Dept., University of
Wisconsin-Madison, 2003-2004, Visiting Professor, Computer Science Dept., Cornell University, 1995-1996, and Visitor, Mathematical Sciences Research Institute, Berkeley, CA, Fall 1985.
Professor 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.
Awards & Activities
Professor Immerman is the winner, jointly with Robert Szelepcsnyi, of the 1995 Gödel Prize in theoretical computer science. He is an editor of the SIAM Journal on Computing and of Logical Methods in Computer Science. Professor Immerman is the author of Descriptive Complexity, Springer Graduate Texts in Computer Science. He is an ACM Fellow (elected in 2002) and a Guggenheim Fellow (2003-04).