Foundations of Computer Science
at The Weizmann Institute of Science
Faculty members More
Research in Foundations of Computer Science
Foundations of computer science is an exciting and growing field, spanning
a broad selection of topics from mathematics to engineering. The Foundations
of Computer Science group at Weizmann Institute is one of the most active
in the world, consisting of ten full-time faculty, several visitors and
post-docs and many graduate students. Current areas of research which are
represented at Weizmann include:
Computational Number Theory
Program Semantics and Logic
Faculty in Foundations of Computer Science
Irit Dinur: Computational Complexity, , Probabilisitically Checkable Proofs, Hardness of approximation, Combinatorics, Analysis of Boolean functions.
Uriel Feige: Computational
Complexity, Interactive Proofs, Approximation Algorithms, Cryptography,
Combinatorial Games, Combinatorics, Information Retrieval.
Oded Goldreich: Randomness
and Computation, Pseudorandomness, Probabilistic Proofs, Foundations of
Cryptography, Complexity Theory, Distributed Computation.
Shafi Goldwasser :
Probabilistic Proofs, Complexity of Approximation, Cryptography, Computational
Number Theory, Fault Tolerant Distributed Computation.
David Harel: Computability,
Automata Theory, Logics of Programs, Database Theory, Complexity Theory,
Systems Engineering, Visual Languages.
Analysis of Algorithms.
Moni Naor: Randomness
in Computation, Cryptography, Concrete Complexity and Combinatorial Algorithms.
David Peleg: Distributed
Computing, Theory of Communication Networks, Graph Algorithms, Approximation
Amir Pnueli : Temporal
Logic. Specification, Verification, and Development of Reactive, Real-Time,
and Hybrid Systems. Algorithmic and Deductive Verification.
Ran Raz : Circuit
Complexity, Communication Complexity, Arithmetic Complexity, Proof Theory.
Omer Reingold :
Adi Shamir: Cryptography
and cryptanalysis, Complexity Theory, Algorithms.
Adi Shamir has been named the recipient of the Israel Prize (2008) in
Congratulations: The Association of Computing Machinery has announced Professor
Adi Shamir, along with Professors Len Adleman from USC and Ron Rivest from MIT,
as the recipients of the 2002 A. M. Turing Award, the top honor in computer scie
nce, considered the "Nobel Prize of Computing,"
for their contributions to cryptography.
In particular, the popular RSA algorithm (named after them) allows secure
, private and authenticated communication over public data networks.
For more information on Computer Science studies at the Weizmann Institute
All graduate studies at the Weizmann Institute are administrated by
the Feinberg Graduate School. Applications should be made using the school's
forms which can be obtained together with more detailed information from
the Feinberg Graduate School, P.O.B 26, Rehovot, Israel. E-mail:
see firstname.lastname@example.org. The Feinberg Graduate School
has a homepage.
Post doctoral Fellowships
The Weizmann Institute provides a number of post-doctoral fellowships.
They are administered through the Feinberg
Graduate School. It is strongly advised that potential candidates contact
the desired supervisor prior to their application.
Dept. of Computer Science and Applied Math
The Weizmann Institute of Science
Rehovot 76100, Israel