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 Watermarking and Traitor Tracing for PRFs Watermarking and Traitor Tracing for PRFs Lattices: Algorithms, Complexity, and Cryptography David Wu (UT Austin) Quantum Coupon Collector Quantum Coupon Collector The Quantum Wave in Computing Ronald de Wolf (QuSoft, CWI and University of Amsterdam) Post-Quantum Multi-Party Computation in Constant Rounds Post-Quantum Multi-Party Computation in Constant Rounds Lattices: Algorithms, Complexity, and Cryptography James Bartusek (UC Berkeley) Laconic Function Evaluation Laconic Function Evaluation Lattices: Algorithms, Complexity, and Cryptography Willy Quach (CISPA) Robust Polynomial Method and a Sub-Volume Law for Locally Gapped Frustration-Free Spin Systems Robust Polynomial Method and a Sub-Volume Law for Locally Gapped Frustration-Free Spin Systems The Quantum Wave in Computing Anurag Anshu (IQC) Self-Dual BKZ Self-Dual BKZ Lattices: Algorithms, Complexity, and Cryptography Michael Walter (IST Austria) Optimal Broadcast Encryption from Pairings and LWE Optimal Broadcast Encryption from Pairings and LWE Lattices: Algorithms, Complexity, and Cryptography Shota Yamada (AIST) Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving The Quantum Wave in Computing Simon Apers (INRIA) Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography Lattices: Algorithms, Complexity, and Cryptography Nicholas Genise (UC San Diego) Quantum-for-crypto-dummies Quantum-for-crypto-dummies Lattices: Algorithms, Complexity, and Cryptography Pagination First page First Previous page Previous Page 84 Page 85 Current page 86 Page 87 Page 88 Next page Next Last page Last
