Internal Program Activities Breadcrumb Home Programs & Events Internal Program Activities Upcoming Past View Events by Program - All - View Events by Program No Internal Activities yet. View Events by Program - All -Quantum Research PodModern Paradigms in GeneralizationSublinear AlgorithmsError-Correcting Codes: Theory and PracticeLogic and Algorithms in Database Theory and AIData Structures and Optimization for Fast AlgorithmsAnalysis and TCS: New FrontiersSummer Cluster on Quantum ComputingMeta-ComplexityExtended Reunion: SatisfiabilityData-Driven Decision ProcessesGraph Limits and Processes on Networks: From Epidemics to MisinformationSummer Cluster: AI and HumanitySummer Cluster: Interpretable Machine LearningComputational Innovation and Data-Driven BiologySummer Cluster: Deep Learning TheoryCausalityLearning and GamesGeometric Methods in Optimization and SamplingComputational Complexity of Statistical InferenceTheoretical Foundations of Computer SystemsSatisfiability: Theory, Practice, and BeyondTheory of Reinforcement LearningProbability, Geometry, and Computation in High DimensionsLattices: Algorithms, Complexity, and CryptographyThe Quantum Wave in ComputingProofs, Consensus, and Decentralizing SocietyOnline and Matching-Based Market DesignSummer Cluster: Error-Correcting Codes and High-Dimensional ExpansionFoundations of Deep LearningData Privacy: Foundations and ApplicationsGeometry of PolynomialsFoundations of Data ScienceLower Bounds in Computational ComplexityThe Brain and ComputationReal-Time Decision MakingBridging Continuous and Discrete OptimizationFoundations of Machine LearningPseudorandomnessLogical Structures in ComputationAlgorithms and UncertaintyAlgorithmic Challenges in GenomicsCounting Complexity and Phase TransitionsFine-Grained Complexity and Algorithm DesignEconomics and ComputationCryptographyInformation TheoryAlgorithmic Spectral Graph TheoryAlgorithms and Complexity in Algebraic GeometryEvolutionary Biology and the Theory of ComputingQuantum Hamiltonian ComplexityReal Analysis in Computer ScienceTheoretical Foundations of Big Data Analysis View Events by Program Disentangled Interpretations and How We Can Use Them Disentangled Interpretations and How We Can Use Them Summer Cluster: Interpretable Machine Learning Chandan Singh (UC Berkeley) Verifiably Truthful Mechanisms Verifiably Truthful Mechanisms Summer Cluster: Interpretable Machine Learning Simina Branzei (Purdue University) A Unifying Philosophical Theory of AI Explanations A Unifying Philosophical Theory of AI Explanations Summer Cluster: Interpretable Machine Learning Atoosa Kasirzadeh (University of Toronto & Australian National University) Learning from Simple Explanations Learning from Simple Explanations Summer Cluster: Interpretable Machine Learning Sanjoy Dasgupta (UCSD) Kickoff Meeting Kickoff Meeting Summer Cluster: Interpretable Machine Learning Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification Lattices: Algorithms, Complexity, and Cryptography Aayush Jain (UCLA) Quantum Linear Algebra With Near-Optimal Complexities Quantum Linear Algebra With Near-Optimal Complexities The Quantum Wave in Computing Lin Lin (UC Berkeley) Candidate iO from Homomorphic Encryption Schemes Candidate iO from Homomorphic Encryption Schemes Lattices: Algorithms, Complexity, and Cryptography Sanjam Garg (UC Berkeley) Sieving in practice: The Generalized Sieve Kernel (G6K) Sieving in practice: The Generalized Sieve Kernel (G6K) Lattices: Algorithms, Complexity, and Cryptography Elena Kirshanova (Immanuel Kant Baltic Federal University) A Theory of Trotter Error A Theory of Trotter Error The Quantum Wave in Computing Yuan Su (UMD) Pagination First page First Previous page Previous Page 83 Page 84 Current page 85 Page 86 Page 87 Next page Next Last page Last
