Research Fields

Foundations of Computer Science

Algorithms
Combinatorics
Cryptography
Theory of Computing
Quantum Computation
Logic and Formal Methods & Computability

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, Prof.Shiri Chechik, Prof. Amos Fiat, Prof.Yossi Matias, Prof.Haim Kaplan, 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 Shpilka, Prof.Yishay Mansour, Dr.Rani Hod, Prof.Elhanan Borenstein, Dr.Yair Carmon, Dr. Tal Wagner, Dr. Yuval Dagan, Dr. Inbar Seroussi, Prof. Inbal Talgam-Cohen

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, Prof.Shiri Chechik, Prof. Amos Fiat, Prof.Yossi Matias, Prof.Haim Kaplan, 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 Shpilka, Prof.Yishay Mansour, Dr.Rani Hod, Prof.Elhanan Borenstein, Dr.Yair Carmon, Dr. Tal Wagner, Dr. Yuval Dagan, Dr. Inbar Seroussi, Prof. Inbal Talgam-Cohen

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, Prof.Gil Cohen, Dr. Yotam Dikstein

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, Prof.Gil Cohen, Dr. Yotam Dikstein

Cryptography
	Cryptography is the backbone of securing all our digital interactions. It solves paradoxical problems such as communicating privately without ever meeting, proving you know a secret without revealing it, or computing over encrypted data. This is based on a rigorous theory founded on computational complexity.
Researchers: Prof.Iftach Haitner, Dr.Eyal Ronen, Prof.Nir Bitansky, Dr.Omer Paneth, Prof. Rafael Pass

Cryptography

Cryptography is the backbone of securing all our digital interactions. It solves paradoxical problems such as communicating privately without ever meeting, proving you know a secret without revealing it, or computing over encrypted data. This is based on a rigorous theory founded on computational complexity.

Researchers:

Prof.Iftach Haitner, Dr.Eyal Ronen, Prof.Nir Bitansky, Dr.Omer Paneth, Prof. Rafael Pass

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.Yishay Mansour, Prof.Rotem Oshman, Prof.Shmuel Safra, Prof.Amir Shpilka, Prof.Ron Shamir, Prof.Amnon Ta-Shma, Prof.Uri Zwick, Prof.Michal Feldman, Prof.Gil Cohen, Prof. Rafael Pass, Dr. Yuval Dagan, Dr. Inbar Seroussi, Prof. Inbal Talgam-Cohen, Dr. Yotam Dikstein

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.Yishay Mansour, Prof.Rotem Oshman, Prof.Shmuel Safra, Prof.Amir Shpilka, Prof.Ron Shamir, Prof.Amnon Ta-Shma, Prof.Uri Zwick, Prof.Michal Feldman, Prof.Gil Cohen, Prof. Rafael Pass, Dr. Yuval Dagan, Dr. Inbar Seroussi, Prof. Inbal Talgam-Cohen, Dr. Yotam Dikstein

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: Prof.Amnon Ta-Shma

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:

Prof.Amnon Ta-Shma

Logic and Formal Methods & Computability
	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, Prof.Shahar Maoz, Prof.Alex Rabinovich, Prof.Amiram Yehudai, Prof.Ori Lahav, Prof.Sharon Shoham Buchbinder

Logic and Formal Methods & Computability

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, Prof.Shahar Maoz, Prof.Alex Rabinovich, Prof.Amiram Yehudai, Prof.Ori Lahav, Prof.Sharon Shoham Buchbinder