THIS PAGE IS NO LONGER UPDATED.

Books

• Aviezri Fraenkel, Adventures in Games and Computational Complexity, Graduate Studies in Mathematics, American Mathematical Society, to appear.
• Oded Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Springer, 1998.
• Oded Goldreich, Foundations of Cryptography, webpage with several entries.
• David Harel, First-Order Dynamic Logic, Lecture Notes in Computer Science, Vol. 68, Springer-Verlag, New York, 1979.
• David Harel, Fundamental Topics in Computer Science (in Hebrew), IDF Publishers, Israel, 1985. (2nd edn., 1986; 3rd edn., 1990; 4th edn., 1993; Russian trans., 1994.)
• David Harel, Algorithmics: The Spirit of Computing, Addison-Wesley, Reading, MA, Second edition, 1992. (First edition, 1987; Dutch trans., 1989; Hebrew trans., Open University Press, 1991; Polish trans., 1992.)
  The Science of Computing: Exploring the Nature and Power of Algorithms, Addison-Wesley, Reading, MA, 1989. (This is a revised trade edition of Algorithmics.)
• David Harel and M. Politi, Modeling Reactive Systems with Statecharts: The STATEMATE Approach, McGraw-Hill, 1998. (Early version titled: The Languages of STATEMATE, I-Logix, Inc., Andover, MA, 1991.)
• David Harel, Computers Humbled: On the Inherent Limitations of Algorithmic Devices and their Software, (tentative title), Oxford University Press, to appear.
• David Harel, D. Kozen and J. Tiuryn, Dynamic Logic, in preparation.
• David Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, 2000.
• Zohar Manna and Amir Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer, 1991.
• Zohar Manna and Amir Pnueli, Temporal Verification of Reactive Systems: Safety, Springer, 1995.

Classnotes and Monographs

• Oded Goldreich, Introduction to Complexity Theory - Lecture Notes, 1999 and 2002.
• Oded Goldreich, Randomized Methods in Computation - Lecture Notes, 2001.

Back to Foundations of Computer Science page.

This page is maintained by Oded Goldreich.