Speaker: Michael Shulman - Dept. of Mathematics, University of San Diego Title: Homotopy type theory and the quest for extensionality Abstract: Over the past decades, dependent type theory has proven to be a powerful framework for verified software and formalized mathematics. However, its treatment of equality has always been somewhat uncomfortable. Recently, homotopy type theory has […]
Amit Sahai (UCLA) Title: Indistinguishability Obfuscation: How to Hide Secrets within Software Abstract: At least since the initial public proposal of public-key cryptography based on computational hardness conjectures (Diffie and Hellman, 1976), cryptographers have contemplated the possibility of a “one-way compiler” that translates computer programs into “incomprehensible” but equivalent forms. And yet, the search for such a “one-way […]
Frances Kirwan (University of Oxford) Title: Moment maps and the Yang-Mills functional Abstract: In the early 1980s Michael Atiyah and Raoul Bott wrote two influential papers, ‘The Yang-Mills equations over Riemann surfaces’ and ‘The moment map and equivariant cohomology’, bringing together ideas ranging from algebraic and symplectic geometry through algebraic topology to mathematical physics and number theory. […]
On May 3, 2021 the CMSA will be hosting a Computational Biology Symposium virtually on Zoom. This symposium will be organized by Vijay Kuchroo. The symposium will begin at 10:00am ET. There will be a morning and afternoon session, with an hour break for lunch. Videos of the talks can be found in this Youtube playlist. Links are also available in the […]
Speaker: Chaim Even-Zohar (Alan Turing Institute, London) Title: Rank-Based Independence Testing in Near Linear Time Abstract: In 1948 Hoeffding proposed a nonparametric test that detects dependence between two continuous random variables (X,Y), based on the ranking of n paired samples (Xi,Yi). The computation of this commonly-used test statistic requires O(n log n) time. Hoeffding's test is consistent […]