THIS PAGE IS NO LONGER MAINTAINED
AND SOME OF THE INFORMATION ON IT IS OUT OF DATE
Foundations of Computer Science
at The Weizmann Institute of Science
Jump to information regarding Graduate Studies
and postdoc possibilities.
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 theoretical
computer science group at Weizmann Institute is one of the most active
in the world, consisting of almost a dozen full-time faculty,
several visitors and post-docs and many graduate students.
Current areas of research that are represented at Weizmann include:
- Algorithms
- Combinatorial Constructions
- Computational Complexity
- Computational Number Theory
- Cryptography
- Distributed Computing
- Logics of Programs
- Parallel Computation
- Program Specification and Verification
- Probabilistic Methods and Randomized Computation
Faculty Members that Research the Foundations of Computer Science
-
Zvika Brakerski:
Theory of Cryptography, Computational Complexity, Algorithms.
-
Irit Dinur:
Complexity Theory, Probabilisitically Checkable Proofs, Hardness of
approximation, Combinatorics, Analysis of Boolean functions.
-
Shahar Dobzinski:
Algorithmic Game Theory, Mechanism Design, Algorithms.
-
Uriel Feige:
Computational Complexity, Interactive Proofs, Approximation Algorithms,
Cryptography, Random Walks.
-
Oded Goldreich:
Randomness and Computation, Sublinear-time Algorithms, 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.
-
Robert Krauthgamer:
Analysis and Design of Algorithms, Embeddings of Metric Spaces,
Computational Complexity.
-
Moni Naor:
Randomness in Computation, Cryptography,
Concrete Complexity and Combinatorial Algorithms.
-
David Peleg:
Distributed Computing, Theory of Communication Networks, Graph Algorithms,
Approximation Algorithms.
-
Ran Raz:
Circuit Complexity, Communication Complexity, Arithmetic Complexity,
Proof Theory.
-
Omer Reingold:
Complexity Theory, Foundations of Cryptography, Derandomization and
Explicit Combinatorial Constructions.
-
Adi Shamir:
Cryptography and cryptanalysis, Complexity Theory, Algorithms.
-
Ohad Shamir:
Machine learning, Learning Theory, Online Learning,
Learning with Partial Information, Optimization, Statistics.
Graduate Studies
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: nfhasday@weizmann.weizmann.ac.il.
See also
Note:
Applications to the PhD program should include the name
and consent of the prospective PhD adviser.
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.
(See also
FAQ.)
More Information
Location
The Weizmann Institute of Science resides in a very nice campus,
which is located about 25Km of Tel-Aviv, 55Km of Jerusalem,
and 15Km of Israel's main international airport (Ben-Gurion).
See also the homepage of the
Weizmann Institute of Science.
This page is maintained by
Oded Goldreich.