Канал: FOCS Conference - Смотреть видео c канала или скачать видео c канала в MP4, музыку MP3 на телефон или компьютер.

$2.3.B: Finding forbidden minors in sublinear time: an n^{1/2+o(1)}-query one-sided tester for ...$

3.4.B: Near log-convexity of measured heat in (discrete) time and consequences

FOCS Conference

FOCS Conference

3.4.B: Near log-convexity of measured heat in (discrete) time and consequences

3.4.B: Indistinguishability by adaptive procedures with advice, and lower bounds on hardness ...

3.4.B: Pseudorandom Generators for Read-Once Branching Programs, in any Order

3.3.B: PanORAMa: Oblivious RAM with Logarithms Overhead

3.3.B: Laconic Function Evaluation and Applications

3.3.B: Cryptographic hashing from Strong One-Way function or One Way Functions (Or: Product ...

3.2.B: Spatial Isolation Implies Zero Knowledge Even in a Quantum World

3.3.B: Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and ...

3.2.B: Constant overhead quantum fault tolerance Wuth quantum expander codes

3.3.B: Non-Malleable Codes for Small-Depth Circuits

3.2.B: Low Degree Testing for quantum states, and a quantum entangled games PCP for QMA

3.1.B: A Faster Distributed Single-Source Shortest Paths Algorithm

3.1.B: Parallel Graph Connectivity in Log Diameter Rounds

3.1.B: On Derandomizing Local Distributed Algorithms

3.1.B: Planar Graph Perfect Matching is in NC

1.2.B: Computations Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

1.1.B: Counting t-cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof ...

1.2.B: Delegating Computations With (almost) Minimal Time and Space Overhead

1.3.B: Deterministic Documents Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors

1.3.B: Improved decoding of Folded Reed-Solomon and Multiplicity Codes

1.3.B: MDS matrices over small fields: A proof of the GM-MDS conjecture

1.2.B: PPP Completeness With Corrections to Cryptography

1.4.B: The complexity of general valued CSPS seen from the other side

2.1.B: A Cryptographic Test of Quantummess and Certifiable Randommess from a Single Quantum Device

2.2.B: An End-to-end Argument in Mechanism Design (Prior-independent Auctions for Budgeted Agents)

2.1.B: Classical Homomorphic Encryption for quantum Circuits

2.1.B: Classical lower bounds from quantum upper bounds

2.3.B: Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

2.4.B: EPTAS for Max Clique on Disks and Unit Balls

2.3.B: Finding forbidden minors in sublinear time: an n^{1/2+o(1)}-query one-sided tester for ...

2.4.B: Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication

2.2.B: Near-optimal Communication Lower Bounds for Approximate Nash Equilibria

2.3.B: Privacy Amplification by Iteration

2.1.B: Quantum algorithm for simulating real evoution of lattice Hamiltonians

2.3.B: Revealing network structure, confidentially: Improved Rates for Node-private Graphon ...

2.3.B: Testing Graph Clusterability: Algorithms and Lower Bounds

2.2.B: The Sample Complexity of Up-to-𝓔 Multi-Dimensional Revenue Maximization

A Faster Isomophism test for Graphs of Small Degree 2

An Improved Bound for Weak Epsilon Nets in the Plane part1

An Improved Bound for Weak Epsilon Nets in the Plane part2 2

1.1.A: Balancing Vectors in Any Norms

1.3.A: Bloom Filters, Adaptivity, and the Dictionary Problem

1.5: Classical Verification of Quantum Computation

1.2.A: Faster Exact and Approximate Algorithms for k-Cut

1.2.A: Graph Sketching Against Adaptive Adversaires Applied to the Minimun Degree Algorithm

1.3.A: Hölder-Homeomorphisms and Approximate Nearest Neighbors

1.3.A: Near-Optimal Approximate Decremental All Pairs Shortest Paths

1.5: Non-black-box Worst-case to Average-case Reductions within NP

2.3.A: 0/1/all CSPs, Half Integral A-path Packing, and Linear-Time FPT Algorithms

2.2.A: A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from ...

2.3.A: An ETH-Tight Exact Algorithm for Euclidean TSP

2.1.A: Contextual Search via Intrinsic Volumes

2.3.A: Fusible HSTs and the randomized k-server conjecture

2.2.A: Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short ...

2.3.A: Improved Online Algorithm for Weighted Flow Time

2.1.A: Learning Sums of Independent Random Variables With Sparse Collective Support

2.3.A: On subexponential parmeterized algorithms for Steiner Tree and Directed Subset TSP on ...

2.6: (Knuth Prize Lecture) On the difficulty of approximating Boolean Max-CSPs

2.4.A: Perfect Lp Sampling in a Data

2.1.A: Recharging Bandits

2.2.A: Spectral Subspace Sparsification

2.4.A: The Sketching Complexity of Graph and Hypergraph Counting

2.1.A: Towards Learning Sparsely Used Dictionaries With Arbitrary Supports

3.2.A: 1-factorizations of pseudorandom graph

3.5: Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time

3.3.A: Beating the integrality ratio s-t-tours in graph

3.3.A: Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in ...

3.1.A: Dispersion for Data Driven Algorithm Design Online Learning andPrivate Optimization

3.3.A: ℰ-Coresets for Clutering in Doubling Metrics

3.1.A: Efficiently Learning Mixtures of Mallows Model

3.4.A: Efficient algorithms of tensor scaling Quantum marginals and moment polytopes

3.1.A: Efficient Density Evaluation for Smooth Kernels

3.2.A: Efficient polynomial time approximation scheme for the genus of dense graphs

3.1.A: Efficient Statistics in High Dimensions from Truncated Samples

3.3.A: Random Order Contention Resolution Schemes

3.4.A: Solving Directed Laplacian Systems in Nearly Linear Time Through Sparse LU Factorizations

3.3.A: Stong Coresets for k Median and Subspace Approximation Goodbye Dimension