Research Fields

Foundations of Computer Science





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 AlonProf.Yossi AzarProf.Shiri ChechikProf. Amos FiatProf.Yossi MatiasProf.Haim KaplanProf.Shmuel SafraProf.Ron ShamirProf.Roded SharanProf.Michael TarsiProf.Amnon Ta-ShmaProf.Uri ZwickDr.Gil CohenProf.Michal FeldmanProf.Amir ShpilkaProf.Yishay Mansour, Dr.Rani HodProf.Elhanan BorensteinDr.Yair Carmon







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.


Prof.Noga AlonProf.Yossi AzarProf.Nachum DershowitzProf.Amos FiatProf.Haim KaplanProf.Roded SharanProf.Michael TarsiProf.Amnon Ta-ShmaProf.Amir ShpilkaDr.Rani HodDr.Gil Cohen







Cryptography & Security

​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.


Prof.Iftach HaitnerDr.Eyal RonenProf.Nir BitanskyDr.Omer Paneth






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 AlonProf.Yossi Azar,  Prof.Yishay MansourProf.Rotem OshmanProf.Shmuel SafraProf.Amir ShpilkaProf.Ron ShamirProf.Amnon Ta-ShmaProf.Uri ZwickProf.Michal FeldmanDr.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.


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.


Prof.Arnon AvronProf.Nachum DershowitzProf.Shahar MaozProf.Alex RabinovichProf.Amiram YehudaiProf.Ori LahavProf.Sharon Shoham Buchbinder



Tel Aviv University makes every effort to respect copyright. If you own copyright to the content contained
here and / or the use of such content is in your opinion infringing, Contact us as soon as possible >>