Internal Program Activities Breadcrumb Home Programs & Events Internal Program Activities Upcoming Past View Events by Program - All -Sublinear Algorithms View Events by Program No Internal Activities yet. Pagination Previous page Previous Page 1 Current page 2 View Events by Program - All -Sublinear 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 ComputingQuantum Research PodMeta-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 Coda: Proof-of-stake and recursive zk-SNARKs in practice Coda: Proof-of-stake and recursive zk-SNARKs in practice Proofs, Consensus, and Decentralizing Society Izaak Meckler The Adversarial Robustness of Sampling The Adversarial Robustness of Sampling Proofs, Consensus, and Decentralizing Society Eylon Yogev Cryptocurrencies, Currency Competition, and the Impossible Trinity Cryptocurrencies, Currency Competition, and the Impossible Trinity Proofs, Consensus, and Decentralizing Society Linda Schilling First come first served online matching: theory, applications and future research First come first served online matching: theory, applications and future research Online and Matching-Based Market Design Gideon Weiss (The University of Haifa) An Economic Analysis of the Bitcoin Payment System An Economic Analysis of the Bitcoin Payment System Proofs, Consensus, and Decentralizing Society Jacob Leshno A Cryptographic Look at Token-Curated Registries A Cryptographic Look at Token-Curated Registries Proofs, Consensus, and Decentralizing Society Sarah Meiklejohn Equilibrium Existence Duality Equilibrium Existence Duality Online and Matching-Based Market Design Alex Teytelboym Stable Matching with Proportionality Constraints Stable Matching with Proportionality Constraints Online and Matching-Based Market Design Rakesh Vohra (University of Pennsylvania) Short talks + announcement of results. Short talks + announcement of results. Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion A connection between optimal AG codes and LPS Ramanujan graphs. A connection between optimal AG codes and LPS Ramanujan graphs. Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion Shai Evra (IAS) Pagination First page First Previous page Previous Page 84 Page 85 Current page 86 Page 87 Page 88 Next page Next Last page Last