[LOGO] The Weizmann CS Research Day for Prospective Students

Friday, May 1st, 2009
Weizmann Institute of Science

Computer science is an exciting and growing field, spanning a broad selection of topics. Roughly speaking, it deals with the power of computing systems, both artificial and natural and their inherent limitations. A Computer Science Research day  will be held at the Weizmann Institute of Science on Friday, May 1st, 2009. The aim is to introduce recent research developments to people who are about to start their research in the area. The intended participants are exceptional students interested in graduate studies at the Weizmann Institute. The official language of the day is English.

Poster of the Day

Lecturers:

Registration and Location

Organizers

Program of Workshop

 

Faculty Members in Computer Science

  • Ronen Basri Computer Vision, Visual Object Recognition, Robot Navigation
  • Irit Dinur Computational Complexity, , Probabilisitically Checkable Proofs, Hardness of approximation, Combinatorics, Analysis of Boolean functions.
  • Uriel Feige: Algorithms, Computational Complexity, Coping With NP-hardness.
  • Tamar Flash Robotics, Motor Control, Computational Neuroscience
  • Aviezri Fraenkel: Combinatorial Games, Combinatorics, Information Retrieval.
  • Oded Goldreich: Randomness and Computation, Pseudorandomness, Probabilistic Proofs, Foundations of Cryptography, Complexity Theory, Distributed Computation.
  • Shafi Goldwasser : Probabilistic Proofs, Complexity of Approximation, Cryptography, Computational Number Theory, Fault Tolerant Distributed Computation.
  • David Harel: Computability, Program Logics, Systems/Software Engineering, Visual Languages, CS Education
  • Michal Irani: Vision motion analysis, Compact video representations, Multi-sensor image alignment.
  • Robert Krauthgamer: Analysis of Algorithms.
  • Anat Levin: Computer Vision, Computer Graphics and Machine Learning
  • Elchanan Mossel: Combinatorial Statistics, Discrete Fourier analysis and Influences, Randomized Algorithms, Computational Complexity, MCMC, Markov Random Fields, Social Choice, Game Theory, Evolution.
  • Moni Naor: Cryptography, Concrete Complexity and Combinatorial Algorithms.
  • David Peleg: Distributed Computing, Theory of Communication Networks, Graph Algorithms, Approximation Algorithms.
  • Amir Pnueli: 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 Theory.
  • Omer Reingold : Complexity Theory.
  • Eran Segal: Computational Biology, and more specifically in developing quantitative models for all levels of gene regulation, including transcription, chromatin, and translation
  • Adi Shamir: Cryptography and cryptanalysis, Complexity Theory, Algorithms.
  • Ehud Shapiro: Computational Models of Living Systems, High-Level Programming Languages
  • Amos Tanay:  Synthesis of evolution and molecular function.
  • Shimon Ullman: Vision, Computer Vision, Brain Modelling

    •