Neil Immerman
Neil Immerman (born 24 November 1953,
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[2] and of Logical Methods in Computer Science.[3] He received B.S. and M.S. degrees from Yale University in 1974 and his Ph.D. from Cornell University in 1980 under the supervision of Juris Hartmanis, a Turing Award winner at Cornell.[1][4] His book Descriptive Complexity appeared in 1999.[5]
Immerman is the winner, jointly with
Guggenheim Fellow.[8]
References
- ^ a b Faculty directory: Neil Immerman, Computer Science Department, University of Massachusetts Amherst, retrieved 2010-01-23.
- ^ Editorial board, SIAM Journal on Computing, retrieved 2010-01-23.
- ^ Editorial board, Logical Methods in Computer Science, retrieved 2010-01-23.
- ^ Neil Immerman at the Mathematics Genealogy Project.
- ^ Reviews of Descriptive Complexity:
- Dawar, Anuj (2001), )
- Klonowski, W. (2001), Discrete Dynamics in Nature and Society, 6: 57–62, doi:10.1155/S1026022601000061)
{{citation}}: CS1 maint: untitled periodical (link - Lindell, Steven (December 2001), )
- Zbl 0918.68031)
{{citation}}: CS1 maint: untitled periodical (link - SIGACT, retrieved 2010-01-23.
- ^ ACM Fellows Award / Neil Immerman, Association for Computing Machinery, retrieved 2010-01-23.
- ^ Neil Immerman Archived 2011-06-04 at the Wayback Machine, John Simon Guggenheim Memorial Foundation, retrieved 2010-01-23.
External links
- Immerman's home page at U. Mass. Amherst
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
 | This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |