Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Neil Immerman

Theory of Computation

Neil Immerman (born 24 November 1953 in Manhasset, New York) is an American theoretical computer scientist and a professor of computer science at the University of Massachusetts Amherst. He is one of the key developers of descriptive complexity, an approach he applies to research in model checking, database theory and computational complexity theory, and he is an editor of the SIAM Journal on Computing and of Logical Methods in Computer Science. He received his bachelor's and master's degrees from Yale University in 1974 and his doctorate from Cornell University in 1980 under the supervision of Juris Hartmanis. His book Descriptive Complexity appeared in 1999. Jointly with Róbert Szelepcsényi he won the 1995 Gödel Prize for the proof of the Immerman-Szelepcsényi theorem, that nondeterministic space complexity classes are closed under complementation. He is an ACM Fellow and a Guggenheim Fellow.

Facts
Birth Year
1953 1
Connections

In Field

Source Wikipedia: Neil Immerman
In the Other Atlases

Milestones Credited

Also in Mathematics Atlas: a milestone credited to this subject.

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikipedia: Neil Immerman
  • Lead
    born 24 November 1953
  • In Group: Computational Complexity Theory, Lead section
    key developers of descriptive complexity
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.