Model theory. Proof theory. Recursion theory (Computability theory). Set theory. Applications.

Gal Binyamini

Weizmann Institute of Science, Israel

Joint lecture with Dmitry Novikov

Gal Binyamini is a Professor at the Weizmann Institute of Science, Department of Mathematics. His main interests lie in tame geometry and its connections to differential equations, model theory and Diophantine geometry. He has also worked on planar differential equations and Hilbert’s sixteenth problem.

Natasha Dobrinen

University of Denver, USA

Natasha Dobrinen is a Professor of Mathematics in the Department of Mathematics of the University of Denver. Her interests include set theory and logic, combinatorics, topology, and their interconnections. In particular, she is known for developing the method of coding trees and applications of set theory to find big Ramsey degrees for infinite structures. Other interests include connections between large cardinals and infinitary combinatorial properties, structural properties of ultrafilters, and topological Ramsey space theory. She is an editor for Annals of Pure and Applied Logic, a co-founder of the BLAST conference series, and has served in various capacities for the Association for Symbolic Logic, including as Chair of the Committee on Logic in North America. She was a panelist for the National Academy of Sciences, Engineering, and Medicine webinar on «Logic and Foundations» for Mathematical Frontiers.

Georges Gonthier

Inria - Saclay Île de France, France

Lecture on the state of the art of computer-assisted proofs

Also in section 14

Georges Gonthier is a researcher at Inria — Saclay Île de France.

Huijia (Rachel) Lin

University of Washington, USA

Lecture on obfuscation schemes

Joint lecture with Amit Sahai

Jointly in sections 2, 14

Huijia (Rachel) Lin is an Associate Professor in the Paul G. Allen School of Computer Science and Engineering at the University of Washington, where she co-leads the Cryptography Lab. Before joining the University of Washington, she was an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara.

Earlier, she obtained a PhD in Computer Science from Cornell University, and was a postdoctoral researcher at MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) and Department of Computer Science at Boston University.

Her research interests are in Cryptography, and broadly its interplay with theory of computer science and security. She is known for her works on program obfuscation, functional encryption, secure multiparty computation, non-malleability and concurrent security. She is a recipient of a US National Science Foundation CAREER award, a Hellman Fellowship, a JP Morgan Faculty award, and a Microsoft Research PhD Fellowship.

She has won a best paper award honorable mention at Eurocrypt 2016, a best paper award at Eurocrypt 2018, and a best paper award at STOC 2021. Her papers have been many times invited to special issues of journals for selected papers at cryptography and theory of computing conferences, and covered by media such as the Quanta Magazine and Forbes.

Andrew Marks

UCLA, USA

Andrew Marks is a Professor of Mathematics at the University of California, Los Angeles. His interests include descriptive set theory and its connection to computability theory, ergodic theory, and operator algebras.

Dmitry Novikov

Weizmann Institute of Science, Israel

Joint lecture with Gal Binyamini

Dmitry Novikov is a Professor of Mathematics at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science.

He is keenly interested in ordinary differential equations in all their manifestations and reincarnations, from Diophantine geometry and model theory to real and complex algebraic geometry and singularity theory.

Together with G. Binyamini he invented complex cellular structures. Also, he succeeded in solving the Tangential Hilbert’s 16th problem and made decisive progress toward proving the Wilkie conjecture in transcendental number theory.

Amit Sahai

UCLA, USA

Lecture on obfuscation schemes

Joint lecture with Huijia (Rachel) Lin

Jointly in sections 2, 14

Amit Sahai is a Fellow of the ACM (2018) and a Fellow of the IACR (2019). He is also a Fellow of the Royal Society of Arts (2021), and Advisor to the Prison Mathematics Project. He is the incumbent of the Symantec Endowed Chair in Computer Science. He received his Ph.D. in Computer Science from MIT in 2000. From 2000 to 2004, he was on the faculty at Princeton University; in 2004 he joined UCLA, where he currently holds the position of Professor of Computer Science. He serves as an editor of J. Cryptology (Springer-Nature). His research interests are in security and cryptography, and theoretical computer science more broadly. He is the co-inventor of Attribute-Based Encryption, Functional Encryption, and Indistinguishability Obfuscation. He has published more than 150 original technical research papers at venues such as the ACM Symposium on Theory of Computing (STOC), CRYPTO, and the Journal of the ACM. He has given a number of invited talks at institutions such as MIT, Stanford, and Berkeley, including the 2004 Distinguished Cryptographer Lecture Series at NTT Labs, Japan. Professor Sahai is the recipient of numerous honors; he was named an Alfred P. Sloan Foundation Research Fellow in 2002, received an Okawa Research Grant Award in 2007, a Xerox Foundation Faculty Award in 2010, a Google Faculty Research Award in 2010, a 2012 Pazy Memorial Award, a 2016 ACM CCS Test of Time Award, a 2019 AWS Machine Learning Research Award, and a 2020 IACR Test of Time Award (Eurocrypt). For his teaching, he was given the 2016 Lockheed Martin Excellence in Teaching Award from the Samueli School of Engineering at UCLA. His research has been covered by several news agencies including the BBC World Service, Quanta Magazine, Wired, and IEEE Spectrum.

Keita Yokoyama

Tohoku University, Japan

Keita Yokoyama is a professor at the Mathematical Institute of Tohoku University.

His interests include the proof theory and model theory of arithmetic, computability theory, and their interactions. He has integrated arguments from those fields and developed several new approaches to reverse mathematics, an ongoing program in logic that aims to investigate the logical strength of mathematical theorems. One of his recent results characterizes the proof-theoretic strength of Ramsey’s theorem for pairs, which was a long-standing open question in the field of reverse mathematics.

Dmitriy Zhuk

Lomonosov Moscow State University, Russia

Dmitriy Zhuk is a researcher at Lomonosov Moscow State University and National Research University Higher School of Economics.

He is interested in automata theory, universal algebra, and computational complexity. In his Ph.D. thesis he studied the decidability of decision problems in automata theory.

Then he focused on clone theory and universal algebra and their application in computational complexity.

He received the «Outstanding Contribute Paper Award» at ISMVL 2011 for the complete description of all clones of self-dual operations on a 3-element domain. In 2017 he characterized the complexity of the Constraint Satisfaction Problem for every constraint language on a finite set. For this result he received the «Best Paper Award» at FOCS 2017 and the Presburger Award 2020.

Thu Nov 18 2021 13:32:14 GMT+0300 (Moscow Standard Time)