Forgot your password?
Document Actions
Books on Theoretical Foundations
Legend
CLASS
TH = automata theory, formal languages, complexity
THALG = theoretically oriented presentation of algorithms
THGR = Graph Theory
THSEM = semantics of programs
THX = other miscellaneous theory
|
CLASS |
CLASS2 |
Title |
Author |
Year |
CHMyear |
|
TH |
|
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies) |
Church, A. |
1941 |
|
|
TH |
|
Cybernetics: Or Control and Communication in the Animal and the Machine |
Wiener, N. |
1948 |
|
|
TH |
|
Syntactic Structures |
Chomsky, N |
1957 |
|
|
TH |
|
An Investigation of the Laws of Thought |
Boole, G. |
1958 |
|
|
TH |
|
Sequential Machines: Selected Papers |
E. F. Moore, Ed. |
1964 |
1964 |
|
TH |
|
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions |
Davis, Martin, |
1965 |
|
|
TH |
|
Cooperating Sequential Processes, Technical Report EWD-123 |
Dijkstra, E. W. |
1965 |
|
|
TH |
|
Theory of Self-Reproducing Automata |
Neumann, J. V.; A. W. Burks,Ed. |
1966 |
|
|
TH |
|
The Mathematical Theory of Context-Free Languages |
Ginsburg, S. |
1966 |
-- |
|
TH |
|
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics) |
Hartmanis, J., Stearns, R.E. |
1966 |
-- |
|
TH |
|
Computation: Finite and Infinite Machines |
Minsky, M. L. |
1967 |
1967 |
|
TH |
|
Cellular Automata |
Codd, E. F. |
1968 |
1968 |
|
TH |
|
Programming Languages, Information Structures, and Machine Organization |
Wegner, P. |
1968 |
1968 |
|
TH |
|
Cellular Automata |
Codd, E. F. |
1968 |
1968 |
|
TH |
|
Theories of abstract automata (Prentice-Hall series in automatic computation) |
Arbib, M. A. |
1969 |
--- |
|
TH |
|
Formal Languages and Their Relation to Automata |
Hopcroft, J. E. and Ullman, J. D. |
1969 |
--- |
|
TH |
|
Theory of Automata |
Salomaa, A. and Sneddon, I. N. |
1969 |
--- |
|
TH |
|
Counter-Free Automata (M.I.T. research monograph no. 65) |
McNaughton, R. and Papert, S. A. |
1971 |
--- |
|
TH |
|
Introduction to probabilistic automata (Computer science and applied mathematics) |
Paz, A. |
1971 |
--- |
|
TH |
|
Introduction to mathematical theory of computation |
Manna, Z. |
1972 |
--- |
|
TH |
|
Introduction to Discrete Structures for Computer Science and Engineering |
Preparata, F. P. and Yeh, R. T. |
1973 |
--- |
|
TH |
|
Theory of Computation |
Brainerd, W. S. and Landweber, L. H. |
1974 |
--- |
|
TH |
|
Automata, Languages, and Machines |
Eilenberg, S. |
1974 |
--- |
|
TH |
|
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics) |
Moschovakis, Y. N. |
1974 |
--- |
|
TH |
|
Mathematical Theory of Computation |
Manna, Z. |
1974 |
|
|
TH |
|
Algebraic and Automata-Theoretic Properties of Formal Languages |
Ginsburg, S. |
1975 |
|
|
TH |
|
Introduction to Computability |
Hennie, F. C. |
1977 |
--- |
|
TH |
|
Machines, Languages and Computation |
Denning, P. J., Dennis, J. B., and Qualitz, J. E. |
1978 |
--- |
|
TH |
|
Introduction to Formal Language Theory |
Harrison, M. A. and Harrison, M. A. |
1978 |
--- |
|
TH |
|
Structure of Computers and Computations |
Kuck, D. L. |
1978 |
--- |
|
TH |
|
Computers and Intractability; A Guide to the Theory of NP-Completeness |
Garey, M. R. and Johnson, D. S. |
1979 |
|
|
TH |
|
Nature of Computation |
Pohl, I. and Shaw, A. |
1981 |
--- |
|
TH |
|
Fundamental Structures of Computer Science |
Wulf, W. A., Flon, L., Shaw,M., and Hilfinger, P. |
1981 |
--- |
|
TH |
|
Principles of Concurrent Programming |
Ari, B. and Ben-Ari, M. |
1982 |
--- |
|
TH |
|
Introduction to Mathematical Machine Theory |
Ginsburg, S. |
1982 |
--- |
|
TH |
|
Applied combinatorics |
Roberts, F. S. |
1984 |
|
|
TH |
|
Communicating sequential processes |
Hoare, C. A. |
1985 |
|
|
TH |
|
Matching Theory ( North-Holland mathematics studies) |
Lovasz, L. |
1986 |
|
|
TH |
|
Theory of recursive functions and effective computability |
Rogers,H. |
1987 |
|
|
TH |
|
Theory of computation: formal languages, automata, and complexity |
Brookshear, J. G. |
1989 |
--- |
|
TH |
|
Proofs and types |
Girard, J., Taylor, P., and Lafont, Y. |
1989 |
--- |
|
TH |
|
Communication and concurrency |
Milner, R. |
1989 |
--- |
|
TH |
|
Introduction To Automata Theory, Languages, And Computation |
Hopcroft, J. E. and Ullman, J. D. |
1990 |
|
|
TH |
|
Switching and Finite Automata Theory |
Kohavi, Z.; R. W. Hamming and E. A. Feigenbaum, Eds. |
1990 |
--- |
|
TH |
|
Programming Approach to Computability |
Kfoury, A. J., Arbib, M. A., and Moll, R. N. |
1991 |
|
|
TH |
|
The language of machines |
Floyd, R. W. and Beigel, R. |
1994 |
--- |
|
TH |
AI |
The deductive foundations of computer programming |
Manna, Z. and Waldinger, R. |
1993 |
|
|
THALG |
|
The Design and Analysis of Computer Algorithms |
Aho, A. V. and Hopcroft, J. E. |
1974 |
--- |
|
THALG |
|
A Discipline of Programming |
Dijkstra, E. W. |
1976 |
|
|
THALG |
|
Combinatorial Algorithms |
Reingold, E. M. |
1977 |
--- |
|
THALG |
|
Algorithms + Data Structures = Programs |
Wirth, N. |
1978 |
|
|
THALG |
|
Fundamentals of Computer Algorithms |
Horowitz, E. and Sahni, S. |
1978 |
--- |
|
THALG |
|
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information |
Knuth, D. E. |
1978 |
|
|
THALG |
|
Selected Writings on Computing: A Personal Perspective |
Dijkstra, E. W. |
1982 |
1982 |
|
THALG |
|
Combinatorial optimization: algorithms and complexity |
Papadimitriou, C. H. and Steiglitz, K. |
1982 |
--- |
|
THALG |
|
Data structures and algorithms 3: multi-dimensional searching and computational geometry |
Mehlhorn, K. |
1984 |
|
|
THALG |
|
Graph algorithms and NP-completeness |
Mehlhorn, K. |
1984 |
|
|
THALG |
|
A computational logic handbook |
Boyer, R. S. and Moore, J.S. |
1988 |
--- |
|
THALG |
|
Introduction to Algorithms |
Manber, U. |
1989 |
|
|
THGR |
GR |
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation) |
Deo, N. |
1974 |
--- |
|
THGR |
GR |
Graph theory |
Christofides, N. |
1975 |
--- |
|
THGR |
GR |
Graph Theory With Applications |
Bondy, J. A. |
1976 |
--- |
|
THGR |
GR |
Graphs and Hypergraphs |
Berge, C. |
1985 |
--- |
|
THSEM |
|
Computer Semantics |
Lee, J. A. |
1971 |
1972 |
|
THSEM |
|
Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics |
Stoy, J. E. |
1977 |
--- |
|
THSEM |
|
The Denotational Description of Programming Languages |
Gordon, M.J. |
1979 |
--- |
|
THSEM |
|
Denotational semantics: a methodology for language development |
Schmidt, D. A. |
1986 |
--- |
|
THSEM |
|
Essays in computing science |
Hoare, C. A.; C. B. Jones, Ed. |
1989 |
-- |
|
THX? |
|
Computer Data Structures |
Pfaltz, J. L. |
1977 |
--- |
|
THX? |
|
Computer algebra: symbolic and algebraic computation (2nd ed.) |
Buchberger, B, G. E. Collins, R. Loos, and R. Albrecht, Eds. |
1983 |
|
|
THx? |
|
Abstract Interpretation of Declarative Languages |
Abramsky, S. and Hankin, C., Eds. |
1987 |
--- |
|
THX? |
AI |
Rough Sets:? Theoretical Aspects of Reasoning about Data |
Pawlak, Z. |
1991 |
|