Event owner lens
Use this record to benchmark whether a comparable event makes the work after the room visible. The score is 28/100, so the next move is to benchmark the weakest pillars before repeating the format.
broadcast-heavy conference agenda analysis
Ieee Focs 2015
This broadcast-heavy conference in Technology / AI / Startup shows 80 visible agenda rows from ieee-focs.org and scores 28/100: a weak visible outcome architecture. The clearest public signals sit in Future-of-Work Fit and Problem Specificity; the main limits are Follow Through and Learning Transfer. Visible mechanisms include Participant work, Network design, and Learning transfer. The public record does not show follow-up or tracking, so the score should be read as design intent rather than durable impact. A practical reading: For a reader, this is a comparison record more than a model to copy: it reads as a broadcast-heavy conference, with the strongest visible signal in future-of-work fit and problem specificity and the biggest open question around follow through and learning transfer. The practical test is whether the published agenda connects the room to post-event continuation and evidence. This page is an original public-evidence analysis, not a copy of the source agenda or an endorsement of the event. The score places the visible agenda in the weak visible effectiveness evidence band. The strongest visible pillars are Future-of-Work Fit, Problem Specificity, and Network Design; the thinnest visible pillars are Follow Through, Learning Transfer, and Participation Architecture. Visible mechanisms include Participant work, Network design, and Learning transfer. The extracted agenda preview includes 155 visible rows. The most common formats are Unknown, Presentation, and Break; the most common inferred purposes are Unknown, Knowledge Transfer, and Wellbeing.
Eight-pillar fingerprint
Hover any pillar to see what it measures and, where it scored low, what the agenda is missing.
Participation Architecture?25
Participation Architecture - 25/100. Participant work, contribution, interaction, and alternatives to passive broadcast.Missing: Turn passive airtime into participant work: practice, sensemaking, decisions, critique, or artifact creation.
Follow Through?5
Follow Through - 5/100. Owners, dates, commitments, progress checks, and accountability after the room.Missing: Add named owners, dates, implementation checkpoints, and a visible post-event continuation path.
Problem Specificity?48
Problem Specificity - 48/100. A clear costly problem, objective, decision, or performance target.
Personalization?27
Personalization - 27/100. Role, path, goal, preparation, or connection tailoring for participants.
Network Design?44
Network Design - 44/100. Structured weak ties, bridge-building, mixers, and relationship persistence.
Learning Transfer?22
Learning Transfer - 22/100. Applied practice, feedback, workplace use, refreshers, and 30-90 day transfer.Missing: Build transfer into the agenda through practice, feedback, job aids, reflection, and 30-90 day use cases.
Evidence Maturity?35
Evidence Maturity - 35/100. Baseline, comparison, follow-up, isolation, and attribution confidence.
Future-of-Work Fit?56
Future-of-Work Fit - 56/100. Value against time, hybrid reality, accessibility, AI, and meeting load.
Fix the gaps
Field-tested exercises matched to this agenda's weakest pillars, from the exercise library.
Follow Through (5/100)
Exercises that strengthen it: Mental Toughness Workshop • WorkshopBank · 15% Solutions • WorkshopBank · Network Patches
Learning Transfer (22/100)
Exercises that strengthen it: Team Challenge Activity for Group Problem-Solving: Don't... · Thrilling, Quick Elimination Game to Boost Energy - Match... · Creative Brain Teaser & Fun Geometric Team Puzzle - T-Puzzle
Participation Architecture (25/100)
Exercises that strengthen it: Make A World · Awestruck 3 Minutes · Spectrum Mapping
Agenda Preview
The actual agenda we captured. Every block is classified by format and purpose. Open any block to see how we read it; the colored edge shows whether it is participant work, broadcast, logistics, or a showcase.
Room vs wrapper
1 percent of the 155 classified blocks put participants to work; the rest broadcast, show, or handle logistics. That mix is what drives the participation score.
Participant workBroadcastShowcaseLogistics
6:00-9:00 p.m. ReceptionReceptionRelationship building+
Format · LogisticsReceptionA social or hospitality block. Pacing and informal connection, not participant work.
Evidence basisOutcome inferred from formatInferred from format
8:00-8:45BreakfastMealPacing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisOutcome inferred from formatInferred from format
8:45-9:05Approximating ATSP by Relaxing Connectivity Ola Svensson (EPFL)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:10-9:30Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP Nima Anari (UC Berkeley), Shayan Oveis Gharan (University of Washington)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:35-9:55Compressing and teaching for low VC-dimension Shay Moran (Technion), Amir Shpilka (Tel Aviv University), Avi Wigderson (IAS, Princeton), Amir Yehudayoff (Technion)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:00-10:20On Monotonicity Testing and Boolean Isoperimetric type Theorems Subhash Khot (New York University), Dor Minzer, Muli Safra (Tel Aviv University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:20-10:50Coffee breakBreakPacing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisOutcome inferred from formatInferred from format
10:50-11:10Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann (ETH Zurich), Marvin Kunnemann (Max Planck Institute, Saarbrucken) Joint With Tight Hardness Results for LCS and other Sequence Similarity Measures Amir Abboud...PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:15-11:35If the Current Clique Algorithms are Optimal, so is Valiant's Parser Amir Abboud (Stanford University), Arturs Backurs (MIT), Virginia Vassilevska Williams (Stanford University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:40-12:00Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph Problems Barna Saha (University of Massachusetts Amherst)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
12:05-12:25Probabilistic Polynomials and Hamming Nearest Neighbors Josh Alman and Ryan Williams (Stanford University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
12:30-1:45Lunch breakBreakPacing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisOutcome inferred from formatInferred from format
2:00-2:20Efficient Inverse Maintenance and Faster Algorithms for Linear Programming Yin Tat Lee and Aaron Sidford (MIT)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:25-2:45Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time Yin Tat Lee (MIT), He Sun (University of Bristol)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:50-3:10Guaranteed Matrix Completion via Non-convex Factorization Ruoyu Sun and Zhi-Quan Luo (University of Minnesota)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:15-3:35Heavy-tailed Independent Component Analysis Joseph Anderson (Ohio State University), Navin Goyal (Microsoft Research), Anupama Nandi and Luis Rademacher (Ohio State University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:40-4:00Input Sparsity and Hardness for Robust Subspace Approximation Kenneth L. Clarkson and David P. Woodruff (IBM Almaden Research Center)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
4:30-4:50The Average Sensitivity of Bounded-Depth Formulas Benjamin Rossman (NII, Tokyo and Simons Institute)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
4:55-5:15The Power of Asymmetry in Constant-Depth Circuits Alexander Sherstov (UCLA)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
5:20-5:40Deterministic Divisibility Testing via Shifted Partial Derivatives Michael A. Forbes (Institute for Advanced Study)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
5:45-6:05Hardness of Approximation in PSPACE and Separation Results for Pebble Games Siu Man Chan (University of Toronto), Massimo Lauria, Jakob Nordstrom, and Marc Vinyals (KTH Royal Institute of Technology)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9 p.m. Business meetingPresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:50-11:10Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption Craig Gentry (IBM), Allison Bishop Lewko (Columbia University), Amit Sahai (UCLA), Brent Waters (University of Texas at Austin)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:15-11:35Indistinguishability Obfuscation from Functional Encryption Nir Bitansky and Vinod Vaikuntanathan (MIT)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:40-12:00Limits on the Power of Indistinguishability Obfuscation and Functional Encryption Gilad Asharov and Gil Segev (Hebrew University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
12:05-12:25Black-Box Garbled RAM Sanjam Garg (UC Berkeley), Steve Lu and Rafail Ostrovsky (UCLA)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:00-2:20The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication Erez Kantor (MIT), Zvi Lotker (Ben Gurion University), Merav Parter (Weizmann Institute), David Peleg (Weizmann Institute)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:25-2:45Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks John Augustine (IIT Madras), Gopal Pandurangan (University of Houston), Peter Robinson (Queen's University Belfast), Scott Roche (Northeastern University), Eli Upfal...PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:50-3:10Planar Reachability in Linear Space and Constant Time Jacob Holm, Eva Rotenberg, and Mikkel Thorup (University of Copenhagen)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:15-3:35Towards an Optimal Method for Dynamic Planar Point Location Timothy M. Chan and Yakov Nekrich (University of Waterloo)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:40-4:00Pattern-avoiding access in binary search trees Parinya Chalermsook, Mayank Goswami (Max Planck Institute, Saarbrucken), Laszlo Kozma (Saarland University), Kurt Mehlhorn (Max-Planck Institute, Saarbrucken), Thatchaphol Saranurak (KTH Royal Institute of...PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
4:30-4:50The Submodular Secretary Problem Goes Linear Moran Feldman (EPFL), Rico Zenklusen (ETH Zurich)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
4:55-5:15Competitive Flow Time Algorithms for Polyhedral Scheduling Sungjin Im (University of California, Merced), Janardhan Kulkarni, Kamesh Munagala (Duke University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
5:20-5:40Tight Bounds for Online Vector Scheduling Sungjin Im (University of California, Merced), Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi (Duke University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
5:45-6:05Online Buy-at-Bulk Network Design Deeparnab Chakrabarty (Microsoft Research), Alina Ene (University of Warwick), Ravishankar Krishnaswamy (Microsoft Research), Debmalya Panigrahi (Duke Univiersity)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
8:45-9:05Solving the Closest Vector Problem in 2^n Time : The Discrete Gaussian Strikes Again! Divesh Aggarwal (EPFL), Daniel Dadush (CWI), Noah Stephens-Davidowitz (NYU)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:10-9:30A Robust Sparse Fourier Transform in the Continuous Setting Eric Price and Zhao Song (University of Texas at Austin)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:35-9:55Breaking the Variance: Approximating the Hamming Distance in O~{1/epsilon} Time Per Alignment Tsvi Kopelowitz (University of Michigan), Ely Porat (Bar Ilan University)PresentationPacing+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:00-10:20Approximately Counting Triangles in Sublinear Time Talya Eden, Amit Levi, Dana Ron (Tel Aviv University), C. Seshadhri (UC Santa Cruz)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:50-11:10An O{1}-Approximation for Minimum Spanning Tree Interdiction Rico Zenklusen (ETH Zurich)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:15-11:35Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line Amir Nayyeri (Oregon State University), Benjamin Raichel (University of Illinois, Urbana-Champaign)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:40-12:00Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem Bruce Shepherd (McGill), Adrian Vetta (McGill), Gordon Wilfong (Bell Labs)WorkshopParticipant work+
Format · Participant workWorkshopParticipants work on a problem and produce something. The strongest signal of participation architecture.
Evidence basisParticipant work is implied by the formatInferred from format
12:05-12:25A light metric spanner Lee-Ad Gottlieb (Ariel University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:00-2:20Local Correlation Breakers and Applications to Three-Source Extractors and Mergers Gil Cohen (Weizmann Institute of Science)PresentationPacing+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:25-2:45Three-Source Extractors for Polylogarithmic Min-Entropy Xin Li (Johns Hopkins University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:50-3:10Beyond the central limit theorem: Asymptotic expansions and pseudorandomness for combinatorial sums Anindya De (IAS / DIMACS)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:15-3:35Pseudorandomness via the discrete Fourier transform Parikshit Gopalan (Microsoft Research), Daniel M. Kane (UC San Diego), Raghu Meka (UCLA)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:40-4:00Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions Vitaly Feldman and Jan Vondrak (IBM Almaden Research Center)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
4:30-4:50[ An average-case depth hierarchy theorem for Boolean circuits [best paper award] Benjamin Rossman (NII, Tokyo and Simons Institute), Rocco A. Servedio (Columbia University), Li-Yang Tan (Simons Institute)...PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
8:45-9:05Differentially Private Release and Learning of Threshold Functions Mark Bun (Harvard University), Kobbi Nissim (Ben-Gurion University and Harvard University), Uri Stemmer (Ben-Gurion University), Salil Vadhan (Harvard University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:10-9:30Robust Traceability from Trace Amounts Cynthia Dwork (Microsoft Research), Adam Smith (Pennsylvania State University), Thomas Steinke (Harvard University), Jonathan Ullman (Columbia University), Salil Vadhan (Harvard University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:35-9:55Community detection in the general stochastic block model: fundamental limits and efficient algorithms for recovery Emmanuel Abbe and Colin Sandon (Princeton University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:00-10:20How to refute a random CSP Sarah R. Allen, Ryan O'Donnell, and David Witmer (Carnegie Mellon University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:50-11:10Near-optimal bounds on bounded-round quantum communication complexity of disjointness Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao (Princeton University), Dave Touchette (Universite de Montreal)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:15-11:35Hamiltonian simulation with nearly optimal dependence on all parameters Dominic W. Berry (Macquarie University), Andrew M. Childs (University of Waterloo and University of Maryland), Robin Kothari (University of Waterloo and Massachusetts Institute of...PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:40-12:00Quantum Expander Codes Anthony Leverrier, Jean-Pierre Tillich (INRIA), Gilles Zemor (Bordeaux University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
12:05-12:25Robust testing of lifted codes with applications to low-degree testing Alan Guo (MIT), Elad Haramaty (Northeastern University), Madhu Sudan (Microsoft Research)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:00-2:20Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable Helmut Seidl (TU Munchen), Sebastian Maneth (University of Edinburgh), Gregor Kemper (TU Munchen)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:25-2:45FO Model Checking on Posets of Bounded Width Jakub Gajarsky (Masaryk University), Petr Hlineny (Masaryk University), Daniel Lokshtanov (University of Bergen), Jan Obdrzalek (Masaryk University), Sebastian Ordyniak (Masaryk University), M. S. Ramanujan...PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:50-3:10Satisfiability of Ordering CSPs Above Average Is Fixed-Parameter Tractable Konstantin Makarychev (Microsoft Research), Yury Makarychev (TTI Chicago), Yuan Zhou (MIT)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:15-3:35Parameterizing the Permanent: genus, apices, minors, evaluation mod 2^k Radu Curticapean (Saarland University), Mingji Xia (Chinese Academy of Sciences)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:40-4:00Isomorphism Testing for Graphs of Bounded Rank Width Martin Grohe and Pascal Schweitzer (RWTH Aachen University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
8:45-9:05Deterministic Communication vs. Partition Number Mika Göös, Toniann Pitassi, and Thomas Watson (University of Toronto)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:10-9:30New Unconditional Hardness Results for Dynamic and Online Problems Raphael Clifford (Bristol University), Allan GrÌünlund (Aarhus University), Kasper Green Larsen (Aarhus University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
9:35-9:55Tight Hardness of the Non-commutative Grothendieck Problem Jop Briet (CWI), Oded Regev (NYU), Rishi Saket (IBM Research)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:00-10:20No Small Linear Program Approximates Vertex Cover within a Factor 2 - epsilon Abbas Bazzi (EPFL), Samuel Fiorini (Universite libre de Bruxelles), Sebastian Pokutta (Georgia Tech), Ola Svensson (EPFL)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
10:50-11:10Uniform generation of random regular graphs Pu Gao (University of Waterloo), Nicholas Wormald (Monash University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:15-11:35Symbolic integration and the complexity of computing averages Leonard Schulman (Caltech), Alistair Sinclair (UC Berkeley), Piyush Srivastava (Caltech)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
11:40-12:00The Complexity of General-Valued CSPs Vladimir Kolmogorov (IST Austria), Andrei Krokhin (Durham University, UK), Michal Rolinek (IST Austria)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
12:05-12:25A Holant Dichotomy: Is the FKT Algorithm Universal? Jin-Yi Cai (University of Wisconsin-Madison), Zhiguo Fu (Jilin University), Heng Guo, Tyson Williams (University of Wisconsin-Madison)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:00-2:20Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs Charles Bordenave (CNRS), Marc Lelarge (INRIA-ENS), Laurent Massoulie (INRIA-MSR)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:25-2:45Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes Adam W. Marcus (Crisply, Yale University), Daniel A. Spielman (Yale University), Nikhil Srivastava (UC Berkeley)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
2:50-3:10Incidences between points and lines in R^4 Micha Sharir and Noam Solomon (Tel Aviv University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:15-3:35Talagrand's convolution conjecture on Gaussian space Ronen Eldan and James R. Lee (University of Washington)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
3:40-4:00Random Matrices: l1 Concentration and Dictionary Learning with Few Samples Kyle Luh and Van Vu (Yale University)PresentationKnowledge transfer+
Format · BroadcastPresentationSpeakers present, the audience receives. Awareness only unless paired with practice or follow-up.
Evidence basisNo participant output visible from this rowRead from source, no work signal
all eventPrintUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisLowRead from source
6:00-9:00 p.m. ReceptionReceptionRelationship Building+
Format · LogisticsReceptionA social or hospitality block. Pacing and informal connection, not participant work.
Evidence basisMediumRead from source
8:00-8:45 BreakfastMealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
8:45-9:05Approximating ATSP by Relaxing Connectivity Ola Svensson (EPFL)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
all eventeprintUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisLowRead from source
9:10-9:30Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP Nima Anari (UC Berkeley), Shayan Oveis Gharan (University of Washington)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:35-9:55Compressing and teaching for low VC-dimension Shay Moran (Technion), Amir Shpilka (Tel Aviv University), Avi Wigderson (IAS, Princeton), Amir Yehudayoff (Technion)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:00-10:20On Monotonicity Testing and Boolean Isoperimetric type Theorems Subhash Khot (New York University), Dor Minzer, Muli Safra (Tel Aviv University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:20-10:50 Coffee breakBreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
10:50-11:10Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann (ETH Zurich), Marvin Kunnemann (Max Planck Institute, Saarbrucken) Joint With Tight Hardness Results for LCS and other Sequence Similarity Measures Amir Abboud (Stanford University), Arturs Backurs (MIT), Virginia Vassilevska Williams (Stanford University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15-11:35If the Current Clique Algorithms are Optimal, so is Valiant's Parser Amir Abboud (Stanford University), Arturs Backurs (MIT), Virginia Vassilevska Williams (Stanford University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40-12:00Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph Problems Barna Saha (University of Massachusetts Amherst)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-12:25Probabilistic Polynomials and Hamming Nearest Neighbors Josh Alman and Ryan Williams (Stanford University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:30-1:45 Lunch breakMealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
2:00-2:20Efficient Inverse Maintenance and Faster Algorithms for Linear Programming Yin Tat Lee and Aaron Sidford (MIT)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:25-2:45Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time Yin Tat Lee (MIT), He Sun (University of Bristol)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:50-3:10Guaranteed Matrix Completion via Non-convex Factorization Ruoyu Sun and Zhi-Quan Luo (University of Minnesota)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:15-3:35Heavy-tailed Independent Component Analysis Joseph Anderson (Ohio State University), Navin Goyal (Microsoft Research), Anupama Nandi and Luis Rademacher (Ohio State University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:40-4:00Input Sparsity and Hardness for Robust Subspace Approximation Kenneth L. Clarkson and David P. Woodruff (IBM Almaden Research Center)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:30-4:50The Average Sensitivity of Bounded-Depth Formulas Benjamin Rossman (NII, Tokyo and Simons Institute)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:55-5:15The Power of Asymmetry in Constant-Depth Circuits Alexander Sherstov (UCLA)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:20-5:40Deterministic Divisibility Testing via Shifted Partial Derivatives Michael A. Forbes (Institute for Advanced Study)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:45-6:05Hardness of Approximation in PSPACE and Separation Results for Pebble Games Siu Man Chan (University of Toronto), Massimo Lauria, Jakob Nordstrom, and Marc Vinyals (KTH Royal Institute of Technology)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9 p.m. Business meetingUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50-11:10Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption Craig Gentry (IBM), Allison Bishop Lewko (Columbia University), Amit Sahai (UCLA), Brent Waters (University of Texas at Austin)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15-11:35Indistinguishability Obfuscation from Functional Encryption Nir Bitansky and Vinod Vaikuntanathan (MIT)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40-12:00Limits on the Power of Indistinguishability Obfuscation and Functional Encryption Gilad Asharov and Gil Segev (Hebrew University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-12:25Black-Box Garbled RAM Sanjam Garg (UC Berkeley), Steve Lu and Rafail Ostrovsky (UCLA)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:00-2:20The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication Erez Kantor (MIT), Zvi Lotker (Ben Gurion University), Merav Parter (Weizmann Institute), David Peleg (Weizmann Institute)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:25-2:45Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks John Augustine (IIT Madras), Gopal Pandurangan (University of Houston), Peter Robinson (Queen's University Belfast), Scott Roche (Northeastern University), Eli Upfal (Brown University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:50-3:10Planar Reachability in Linear Space and Constant Time Jacob Holm, Eva Rotenberg, and Mikkel Thorup (University of Copenhagen)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:15-3:35Towards an Optimal Method for Dynamic Planar Point Location Timothy M. Chan and Yakov Nekrich (University of Waterloo)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:40-4:00Pattern-avoiding access in binary search trees Parinya Chalermsook, Mayank Goswami (Max Planck Institute, Saarbrucken), Laszlo Kozma (Saarland University), Kurt Mehlhorn (Max-Planck Institute, Saarbrucken), Thatchaphol Saranurak (KTH Royal Institute of Technology)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:30-4:50The Submodular Secretary Problem Goes Linear Moran Feldman (EPFL), Rico Zenklusen (ETH Zurich)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:55-5:15Competitive Flow Time Algorithms for Polyhedral Scheduling Sungjin Im (University of California, Merced), Janardhan Kulkarni, Kamesh Munagala (Duke University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:20-5:40Tight Bounds for Online Vector Scheduling Sungjin Im (University of California, Merced), Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi (Duke University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:45-6:05Online Buy-at-Bulk Network Design Deeparnab Chakrabarty (Microsoft Research), Alina Ene (University of Warwick), Ravishankar Krishnaswamy (Microsoft Research), Debmalya Panigrahi (Duke Univiersity)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:45-9:05Solving the Closest Vector Problem in 2^n Time : The Discrete Gaussian Strikes Again! Divesh Aggarwal (EPFL), Daniel Dadush (CWI), Noah Stephens-Davidowitz (NYU)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:10-9:30A Robust Sparse Fourier Transform in the Continuous Setting Eric Price and Zhao Song (University of Texas at Austin)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:35-9:55Breaking the Variance: Approximating the Hamming Distance in O~{1/\epsilon} Time Per Alignment Tsvi Kopelowitz (University of Michigan), Ely Porat (Bar Ilan University)BreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
10:00-10:20Approximately Counting Triangles in Sublinear Time Talya Eden, Amit Levi, Dana Ron (Tel Aviv University), C. Seshadhri (UC Santa Cruz)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50-11:10An O{1}-Approximation for Minimum Spanning Tree Interdiction Rico Zenklusen (ETH Zurich)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15-11:35Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line Amir Nayyeri (Oregon State University), Benjamin Raichel (University of Illinois, Urbana-Champaign)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40-12:00Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem Bruce Shepherd (McGill), Adrian Vetta (McGill), Gordon Wilfong (Bell Labs)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-12:25A light metric spanner Lee-Ad Gottlieb (Ariel University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:00-2:20Local Correlation Breakers and Applications to Three-Source Extractors and Mergers Gil Cohen (Weizmann Institute of Science)BreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
all eventWe introduce and construct a pseudorandom object which we call a local correlation breaker (LCB). Informally speaking, an LCB is a function that gets as input a sequence of r (arbitrarily correlated) random variables and an independent weak-source. The output of the LCB is a sequence of r random variables with the following property. If the i'th input random variable is uniform then the i'th output variable is uniform even given a bounded number of any other output variables. That is, an LCB uses the weak-source to break local correlations between random variables. Our construction of LCBs has applications to three-source extractors, mergers with weak-seeds, and a variant of non-malleable extractors, that we introduce.BreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
2:25-2:45Three-Source Extractors for Polylogarithmic Min-Entropy Xin Li (Johns Hopkins University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:50-3:10Beyond the central limit theorem: Asymptotic expansions and pseudorandomness for combinatorial sums Anindya De (IAS / DIMACS)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:15-3:35Pseudorandomness via the discrete Fourier transform Parikshit Gopalan (Microsoft Research), Daniel M. Kane (UC San Diego), Raghu Meka (UCLA)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:40-4:00Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions Vitaly Feldman and Jan Vondrak (IBM Almaden Research Center)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:30-4:50[ An average-case depth hierarchy theorem for Boolean circuits [best paper award] Benjamin Rossman (NII, Tokyo and Simons Institute), Rocco A. Servedio (Columbia University), Li-Yang Tan (Simons Institute) ](https://ieee-focs.org/focs2015/program.html#Asion81A)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:55-5:15[ A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization [best student paper award] Yin Tat Lee (MIT), Aaron Sidford (MIT), Sam Chiu-wai Wong (UC Berkeley) ](https://ieee-focs.org/focs2015/program.html#Asion82A)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:20-5:40[ Lower Bounds for Clique vs. Independent Set [best student paper award] Mika Göös (University of Toronto) ](https://ieee-focs.org/focs2015/program.html#Asion83A)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:45-9:05Differentially Private Release and Learning of Threshold Functions Mark Bun (Harvard University), Kobbi Nissim (Ben-Gurion University and Harvard University), Uri Stemmer (Ben-Gurion University), Salil Vadhan (Harvard University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:10-9:30Robust Traceability from Trace Amounts Cynthia Dwork (Microsoft Research), Adam Smith (Pennsylvania State University), Thomas Steinke (Harvard University), Jonathan Ullman (Columbia University), Salil Vadhan (Harvard University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:35-9:55Community detection in the general stochastic block model: fundamental limits and efficient algorithms for recovery Emmanuel Abbe and Colin Sandon (Princeton University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:00-10:20How to refute a random CSP Sarah R. Allen, Ryan O'Donnell, and David Witmer (Carnegie Mellon University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50-11:10Near-optimal bounds on bounded-round quantum communication complexity of disjointness Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao (Princeton University), Dave Touchette (Universite de Montreal)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15-11:35Hamiltonian simulation with nearly optimal dependence on all parameters Dominic W. Berry (Macquarie University), Andrew M. Childs (University of Waterloo and University of Maryland), Robin Kothari (University of Waterloo and Massachusetts Institute of Technology)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40-12:00Quantum Expander Codes Anthony Leverrier, Jean-Pierre Tillich (INRIA), Gilles Zemor (Bordeaux University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-12:25Robust testing of lifted codes with applications to low-degree testing Alan Guo (MIT), Elad Haramaty (Northeastern University), Madhu Sudan (Microsoft Research)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:00-2:20Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable Helmut Seidl (TU Munchen), Sebastian Maneth (University of Edinburgh), Gregor Kemper (TU Munchen)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:25-2:45FO Model Checking on Posets of Bounded Width Jakub Gajarsky (Masaryk University), Petr Hlineny (Masaryk University), Daniel Lokshtanov (University of Bergen), Jan Obdrzalek (Masaryk University), Sebastian Ordyniak (Masaryk University), M. S. Ramanujan (University of Bergen), Saket Saurabh (UniversitUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:50-3:10Satisfiability of Ordering CSPs Above Average Is Fixed-Parameter Tractable Konstantin Makarychev (Microsoft Research), Yury Makarychev (TTI Chicago), Yuan Zhou (MIT)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:15-3:35Parameterizing the Permanent: genus, apices, minors, evaluation mod 2^k Radu Curticapean (Saarland University), Mingji Xia (Chinese Academy of Sciences)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:40-4:00Isomorphism Testing for Graphs of Bounded Rank Width Martin Grohe and Pascal Schweitzer (RWTH Aachen University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:45-9:05Deterministic Communication vs. Partition Number Mika Göös, Toniann Pitassi, and Thomas Watson (University of Toronto)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:10-9:30New Unconditional Hardness Results for Dynamic and Online Problems Raphael Clifford (Bristol University), Allan GrÌünlund (Aarhus University), Kasper Green Larsen (Aarhus University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:35-9:55Tight Hardness of the Non-commutative Grothendieck Problem Jop Briet (CWI), Oded Regev (NYU), Rishi Saket (IBM Research)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:00-10:20No Small Linear Program Approximates Vertex Cover within a Factor 2 - \epsilon Abbas Bazzi (EPFL), Samuel Fiorini (Universite libre de Bruxelles), Sebastian Pokutta (Georgia Tech), Ola Svensson (EPFL)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50-11:10Uniform generation of random regular graphs Pu Gao (University of Waterloo), Nicholas Wormald (Monash University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15-11:35Symbolic integration and the complexity of computing averages Leonard Schulman (Caltech), Alistair Sinclair (UC Berkeley), Piyush Srivastava (Caltech)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40-12:00The Complexity of General-Valued CSPs Vladimir Kolmogorov (IST Austria), Andrei Krokhin (Durham University, UK), Michal Rolinek (IST Austria)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-12:25A Holant Dichotomy: Is the FKT Algorithm Universal? Jin-Yi Cai (University of Wisconsin-Madison), Zhiguo Fu (Jilin University), Heng Guo, Tyson Williams (University of Wisconsin-Madison)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:00-2:20Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs Charles Bordenave (CNRS), Marc Lelarge (INRIA-ENS), Laurent Massoulie (INRIA-MSR)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:25-2:45Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes Adam W. Marcus (Crisply, Yale University), Daniel A. Spielman (Yale University), Nikhil Srivastava (UC Berkeley)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:50-3:10Incidences between points and lines in R^4 Micha Sharir and Noam Solomon (Tel Aviv University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:15-3:35Talagrand's convolution conjecture on Gaussian space Ronen Eldan and James R. Lee (University of Washington)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:40-4:00Random Matrices: l1 Concentration and Dictionary Learning with Few Samples Kyle Luh and Van Vu (Yale University)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
The Full Reading
Why It Ranks This Way +
Calibrated from GES design 33/100 and verified 33/100 with no fourth-loop cap.
Reader Takeaway. For a reader, this is a comparison record more than a model to copy: it reads as a broadcast-heavy conference, with the strongest visible signal in future-of-work fit and problem specificity and the biggest open question around follow through and learning transfer. The practical test is whether the published agenda connects the room to post-event continuation and evidence.
Strongest signals: Future-of-Work Fit, Problem Specificity, and Network Design. Weakest signals: Follow Through, Learning Transfer, and Participation Architecture.
How This Agenda Could Improve +
- Add named owners, dates, implementation checkpoints, and a visible post-event continuation path.
- Build transfer into the agenda through practice, feedback, job aids, reflection, and 30-90 day use cases.
- Turn passive airtime into participant work: practice, sensemaking, decisions, critique, or artifact creation.
Fastest next move: Add named owners, dated next steps, and a visible continuation path before treating the event as outcome-ready.
Role-Specific Reading +
Sponsor lens
Look beyond exposure. Strong sponsor value would show qualified interaction, problem work, buyer learning, customer evidence, or follow-up. The practical sponsor move is to look for structured introductions, buyer-seller fit, and relationship persistence.
Designer lens
The agenda is useful as a pattern sample from ieee-focs.org. Redesign attention should go first to the lowest-scoring pillars; in practice, turn the thinnest agenda blocks into participant work.
Executive lens
Treat the visible agenda as an operating plan. The executive move is to require owners, dates, and evidence before treating the event as strategic. If owners, proof, and follow-through are not visible, the public record does not yet prove strategic movement.
Aggregator lens
Treat the source URL as evidence, not decoration. The data-product move is to label the source boundary clearly before ranking the record before ranking or syndicating the record.
What GES Means Here +
The Gathering Effectiveness Score is a strict 0-100 public-evidence reading of the agenda across eight pillars. It rewards visible participant work, follow-through, transfer, network design, and proof mechanisms more than polish, speaker fame, attendance, or satisfaction.
Visible mechanisms: Participant work, Network design, Learning transfer.
Evidence boundary: Scores reflect visible agenda/source evidence and should not be read as proof of causal event impact.
Limitations, Score Caps, and Review Flags +
Limitations
- No visible follow-up, progress monitoring, or longitudinal tracking.
- Passive stage formats dominate the visible agenda.
- No baseline measurement is visible.
Score caps
- No fourth-loop score cap applied.
Review flags
- No source-backed follow-up, validation, baseline, tracking, or impact evidence.
- Satisfaction/NPS signal found, but it is excluded from effectiveness scoring.
- No tracking, validation, feedback, or impact measurement found in the visible source text.
- Original category was unknown; publication category is inferred.
Is this proof the event worked? +
No. This is a strict public-evidence reading of the agenda. Proof would require baseline, comparison, follow-up, attribution, and impact evidence beyond the listing.
What should a reader inspect first? +
Start with the source URL, then compare the eight pillar scores against the agenda rows. The biggest opportunities usually sit in follow-through, evidence maturity, and participant work.
Why publish weak records? +
Weak records are part of the map. They show where public agendas still describe sessions and speakers more often than outcomes, commitments, transfer, or proof.
How should I use the rows? +
Read the agenda rows as the visible design trace: formats, purposes, and evidence labels show what the public source made inspectable, not everything that happened in the room. This is a source-grounded interpretation of the public agenda record, not a copy of the source, and not an endorsement of the event.
Embed the verified badge +
This record is in the hand-verified gold set. Copy the snippet below to embed the verified badge on your own site.
<a href="https://unitedwetransform.com/events/evt_2015_ieee_focs_org_focs2015_program_html_6_00_9_00_p_m_reception_ieee_focs_org"><img src="https://unitedwetransform.com/badge/ges-verified.svg" alt="GES verified by United We Transform" height="40"></a>Where To Go Next
Compare this agenda against other Technology / AI / Startup events scored on the same eight pillars.