Research Fields
Algorithms
Sequential and parallel algorithms. Data structures. Randomized algorithms. Derandomiztion.
Approximation algorithms and approximation schemes. Combinatorial optimization.
Competitive analysis of on-line algorithms Cryptology.
Researchers:
Prof. Noga Alon, Prof. Yossi Azar, Dr. Shiri Chechik, Prof. Amos Fiat, Prof.Yossi Matias, Prof. Haim Kaplan, Prof. Ronitt Rubinfeld, Prof. Shmuel Safra, Prof. Ron Shamir, Prof. Roded Sharan, Prof. Michael Tarsi, Prof. Amnon Ta-Shma, Prof. Uri Zwick, Dr. Gil Cohen, Prof. Michal Feldman , Prof. Amir Shpilkaand, Prof. Yishay Mansour, Dr. Rani Hod and Prof. Elhanan Borenstein.
Combinatorics
Graph theory and other branches of combinatorics and their applications in Computer Science. Algorithmic graph theory. Algebraic and probabilistic methods in combinatorics. Enumeration of combinatorial structures.
Researchers:
Prof. Noga Alon, Prof. Yossi Azar, Prof. Nachum Dershowitz, Prof. Amos Fiat, Prof. Haim Kaplan, Prof. Roded Sharan, Prof. Michael Tarsi, Prof. Amnon Ta-Shma, Prof. Amir Shpilka, Dr. Rani Hod and Dr. Gil Cohen.
Cryptography
Researchers:
Prof. Ran Canetti, Dr. Iftach Haitner, Prof. Eran Tromer, Dr. Eyal Ronen and Dr. Nir Bitansky.
Foundations of Computability
The Church-Turing Thesis. Abstract state machines. Equivalence of algorithms.
Researchers:
Prof. Arnon Avron and Prof. Nachum Dershowitz.
Logic and Formal Methods
Semantics of programming languages. Verification of programs. Theory of concurrency: Methodology of concurrent and reactive systems, in particular of networks of processes and data flow systems. Logical foundations of automated reasoning and computational aspects of logical systems. Applications of Logic to relational database theory. The use of non-classical logics in CS and AI. Formalisms for specification of and reasoning about hybrid systems. Rewriting and equational reasoning. Orderings for termination proofs.Fuzzy Logic.
Researchers:
Prof. Arnon Avron, Prof. Nachum Dershowitz, Dr. Shahar Maoz, Prof. Alex Rabinovich, Prof. Amiram Yehudai, Dr. Ori Lahav and Dr. Sharon Shoham Buchbinder
Theory of Computing
Automata theory. Computational complexity. Complexity classes. Probabilistically checkable proofs. Hardness of approximation. Lower bounds. Circuit Complexity.
Go to web site here
Researchers:
Prof. Noga Alon, Prof. Yossi Azar, Prof. Benny Chor, Prof. Yishay Mansour, Dr. Rotem Oshman, Prof. Ronitt Rubinfeld, Prof. Shmuel Safra, Prof. Amir Shpilka, Prof. Ron Shamir, Prof. Amnon Ta-Shma, Prof. Uri Zwick, Prof. Yishay Mansour, Prof. Michal Feldman and Dr. Gil Cohen.
Quantum Computation
Quantum computation is a young and very active field studying computers based on the principles of quantum physics. Such computers can perform tasks that are believed to be impossible using standard computers, such as breaking many popular cryptographic codes.
Researchers:
Further Reading:
