Previous Faculty members
 |
RAN RAZFaculty member between: 1994 - 2022 Research area: Computational complexity theory most notably proving lower bounds on the resources needed to perform tasks in different computational models. More specifically, Boolean and arithmetic circuit complexity, communication complexity, randomness and derandomization, probabilistically checkable proofs and delegation of computation, quantum computation and communication, classical and quantum information, and lower bounds on the number of samples needed for learning under memory constraints. |
 |
OMER REINGOLDFaculty member between: 2004 - 2015 Research area: Foundations of computer science most notably in computational complexity, cryptography, pseudorandomness, algorithmic fairness, and the societal impact of computation. |