About the Authors
Yuval Filmus
Yuval Filmus
Associate Professor
Technion — Israel Institute of Technology
The Henry and Marilyn Taub Faculty of Computer Science
Faculty of Mathematics
Haifa 3200003, Israel
yuvalfi[ta]cs[td]technion[td]ac[td]il
https://yuvalfilmus.cs.technion.ac.il/
Yuval Filmus received his Ph.D. from the University of Toronto under the supervision of Toni Pitassi. Subsequently, he held postdoctoral positions at the Simons Institute for the Theory of Computing and the Institute for Advanced Study. He is interested in Boolean function analysis, complexity theory, and combinatorics.
Or Meir
Or Meir
Associate Professor
Department of Computer Science
University of Haifa
Haifa 3303220, Israel
ormeir[ta]cs[td]haifa[td]ac[td]il
https://cs.haifa.ac.il/~ormeir/
Or Meir received his Ph.D. from the Weizmann Institute of Science under the supervision of Oded Goldreich. Subsequently, he held postdoctoral positions at Stanford University, the Institute for Advanced Study, and the Weizmann Institute of Science. He is interested in complexity theory, and in particular in circuit complexity, communication complexity, coding theory, probabilistic proof systems, and the theory of pseudorandomness.
Avishay Tal
Avishay Tal
Assistant Professor
Department of Electrical Engineering and Computer Sciences
University of California, Berkeley
Berkeley, CA 94720, United States
atal[ta]berkeley[td]edu
https://www.avishaytal.org/
Avishay Tal received his M.Sc. from the Technion under the supervision of Amir Shpilka, and his Ph.D. from the Weizmann Institute of Science under the supervision of Ran Raz. Subsequently, he held postdoctoral positions at the Institute for Advanced Study, the Simons Institute for the Theory of Computing, and Stanford University. He is interested in Boolean function analysis, complexity theory and combinatorics, and in particular in circuit complexity, query complexity, computational learning theory, quantum complexity, and the theory of pseudorandomness.