of Math and Computer Science
Institute of Science
Computer Science Studies
Computer Science in Israel has its origins at The Weizmann Institute:
Weizac, the first computer in Israel, was built here; it can still
be seen at the entrance
to the Ziskind building. The Weizmann Institute was also
the first academic institute
in Israel to award degrees
in Computer Science.
The Weizmann Institute has a world-leading group of Computer Science faculty
members with research interests covering diverse areas such as:
Algorithms, Computational Complexity,
Computer Vision, Cryptography, Distributed Computing, Program Semantics
and Logic, Programming Languages, Robotics, Scientific Computation,
Software Engineering and Specification and Verification.
Prospective students are expected to have earned a Bachelor's
degree in Computer
Science, but promising candidates in related areas (Mathematics, Electrical
Engineering) will be considered as well.
Several Research groups
have their own Web-pages:
David Harel has been named the recipient of the Israel Prize (2004) in Computer Science.
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 science, 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.
Faculty Members in Computer Science
Achi Brandt Scientific
Computation, Computational Fluid Dynamics, Computational Chemistry, Computational
Computer Vision, Visual Object Recognition, Robot Navigation
Computational Complexity, , Probabilisitically Checkable Proofs, Hardness of
approximation, Combinatorics, Analysis of Boolean functions.
Algorithms, Computational Complexity, Coping With NP-hardness.
Robotics, Motor Control, Computational Neuroscience
Combinatorial Games, Combinatorics, Information Retrieval.
Randomness and Computation, Pseudorandomness, Probabilistic Proofs,
Foundations of Cryptography, Complexity Theory, Distributed Computation.
: Probabilistic Proofs, Complexity of Approximation, Cryptography,
Computational Number Theory, Fault Tolerant Distributed Computation.
Computability, Program Logics, Systems/Software Engineering, Visual Languages,
Vision motion analysis, Compact video representations, Multi-sensor
Analysis of Algorithms.
Cryptography, Concrete Complexity and Combinatorial Algorithms.
Distributed Computing, Theory of Communication Networks, Graph Algorithms,
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
Omer Reingold :
Cryptography and cryptanalysis, Complexity Theory, Algorithms.
Computational Models of Living Systems, High-Level Programming Languages
Vision, Computer Vision, Brain Modelling
The Faculty of Mathematics and Computer Science graduate studies
To the Weizmann Institute of Science Home Page
Faculty of Mathematics and Computer Science
The Weizmann Institute of Science
Rehovot 76100, Israel
To comment on this service, send feedback to the webmaster.