Foundations of Computing
By publishing comprehensive books and specialized monographs on the theoretical aspects of computer science, the series on Foundations of Computing provides a forum in which important research topics can be presented in their entirety and placed in perspective for researchers, students, and practitioners alike. This series is no longer active, and the MIT Press is no longer accepting proposals for books in the series.
Series editor: Michael Garey and Albert Meyer
Search Results
Complexity Issues in VLSI
Pub Date: Mar 17, 2003
The Stable Marriage Problem
Pub Date: Jan 01, 2003
Dynamic Logic
Pub Date: Sep 29, 2000
Proof, Language, and Interaction
Pub Date: May 08, 2000
Computability and Complexity
Pub Date: Jan 23, 1997
Foundations for Programming Languages
Pub Date: Aug 29, 1996
Algorithmic Number Theory
Pub Date: Aug 26, 1996
Algebraic Semantics of Imperative Programs
Pub Date: May 22, 1996
Circuit Complexity and Neural Networks
Pub Date: Jul 27, 1994
Theoretical Aspects of Object-Oriented Programming
Pub Date: Jun 15, 1994
Logic and Information Flow
Pub Date: May 06, 1994
The Structure of Typed Programming Languages
Pub Date: Mar 01, 1994
From Logic to Logic Programming
Pub Date: Jan 11, 1994
Exploring Interior-Point Linear Programming
Pub Date: Nov 10, 1993
Hilbert's 10th Problem
Pub Date: Oct 13, 1993