Sequential and parallel algorithms. Data structures. Randomized algorithms. Derandomiztion.
Approximation algorithms and approximation schemes. Combinatorial optimization.
Competitive analysis of on-line algorithms Cryptology.
Prof. Noga Alon, Prof. Yossi Azar, Dr. Shiri Chechik, Prof. Amos Fiat, Prof. Eran Halperin, 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 and Prof. Uri Zwick.
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.
Foundations of Computability
The Church-Turing Thesis. Abstract state machines. Equivalence of algorithms.
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.
Prof. Arnon Avron, Prof. Nachum Dershowitz, Prof. Yoram Hirshfeld (from Pure Mathematics Department, School of Math), Dr. Shahar Maoz, Prof. Alex Rabinovich, Prof. Boaz Trakhtenbrot and Prof. Amiram Yehudai.
Theory of Computing
Automata theory. Computational complexity. Complexity classes. Probabilistically checkable proofs. Hardness of approximation. Lower bounds. Circuit Complexity.
Go to web site here
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 and Prof. Uri Zwick.
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.