| SIMPLE AND TIGHT DEVICE-INDEPENDENT SECURITY PROOFS |
15 |
| FASTER ALL-PAIRS SHORTEST PATHS VIA CIRCUIT COMPLEXITY |
11 |
| FORRELATION: A PROBLEM THAT OPTIMALLY SEPARATES QUANTUM FROM CLASSICAL COMPUTING |
7 |
| LOCAL SEARCH YIELDS APPROXIMATION SCHEMES FOR k-MEANS AND k-MEDIAN IN EUCLIDEAN AND MINOR-FREE METRICS |
7 |
| A HIERARCHY OF LOWER BOUNDS FOR SUBLINEAR ADDITIVE SPANNERS |
6 |
| INAPPROXIMABILITY OF NASH EQUILIBRIUM |
5 |
| PSEUDORANDOMNESS VIA THE DISCRETE FOURIER TRANSFORM |
5 |
| ROBUST ESTIMATORS IN HIGH-DIMENSIONS WITHOUT THE COMPUTATIONAL INTRACTABILITY |
5 |
| MAKING THE MOST OF YOUR SAMPLES |
4 |
| DETERMINISTIC FULLY DYNAMIC DATA STRUCTURES FOR VERTEX COVER AND MATCHING |
4 |
| COMMUNICATION LOWER BOUNDS VIA CRITICAL BLOCK SENSITIVITY |
4 |
| CONSTRUCTING LINEAR-SIZED SPECTRAL SPARSIFICATION IN ALMOST-LINEAR TIME |
4 |
| EXTENSION COMPLEXITY OF INDEPENDENT SET POLYTOPES |
4 |
| EDIT DISTANCE CANNOT BE COMPUTED IN STRONGLY SUBQUADRATIC TIME (UNLESS SETH IS FALSE) |
3 |
| APPROXIMATING THE NASH SOCIAL WELFARE WITH INDIVISIBLE ITEMS |
3 |
| CHARACTERIZING PROPOSITIONAL PROOFS AS NONCOMMUTATIVE FORMULAS |
3 |
| ON MONOTONICITY TESTING AND BOOLEAN ISOPERIMETRIC-TYPE THEOREMS |
3 |
| DETERMINISTIC COMMUNICATION VS. PARTITION NUMBER |
3 |
| LOCAL SEARCH YIELDS A PTAS FOR k-MEANS IN DOUBLING METRICS |
3 |
| A TIME HIERARCHY THEOREM FOR THE LOCAL MODEL |
3 |
| AN EXPONENTIAL SEPARATION BETWEEN RANDOMIZED AND DETERMINISTIC COMPLEXITY IN THE LOCAL MODEL |
3 |
| SMALL-DEPTH MULTILINEAR FORMULA LOWER BOUNDS FOR ITERATED MATRIX MULTIPLICATION WITH APPLICATIONS |
3 |
| PLANAR GRAPHS OF BOUNDED DEGREE HAVE BOUNDED QUEUE NUMBER |
2 |
| AN ALGORITHM FOR KOMLOS CONJECTURE MATCHING BANASZCZYK'S BOUND |
2 |
| THE CONSTANT INAPPROXIMABILITY OF THE PARAMETERIZED DOMINATING SET PROBLEM |
2 |
| A NEARLY TIGHT SUM-OF-SQUARES LOWER BOUND FOR THE PLANTED CLIQUE PROBLEM |
2 |
| A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR ALL-TERMINAL NETWORK RELIABILITY |
2 |
| SLIGHTLY SUPEREXPONENTIAL PARAMETERIZED PROBLEMS |
2 |
| PRIORITIZED METRIC STRUCTURES AND EMBEDDING |
2 |
| BREAKING THE MINSKY-PAPERT BARRIER FOR CONSTANT-DEPTH CIRCUITS |
2 |
| PRIMAL BEATS DUAL ON ONLINE PACKING LPs IN THE RANDOM-ORDER MODEL |
2 |
| ERASURE-RESILIENT PROPERTY TESTING |
2 |
| BOUNDED INDEPENDENCE PLUS NOISE FOOLS PRODUCTS |
2 |
| MATCHING TRIANGLES AND BASING HARDNESS ON AN EXTREMELY POPULAR CONJECTURE |
2 |
| MINIMUM CIRCUIT SIZE, GRAPH ISOMORPHISM, AND RELATED PROBLEMS |
2 |
| NP-HARDNESS OF REED-SOLOMON DECODING, AND THE PROUHET-TARRY-ESCOTT PROBLEM |
2 |
| A (1+epsilon)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS |
2 |
| A PTAS FOR THE STEINER FOREST PROBLEM IN DOUBLING METRICS |
2 |
| INTERLACING FAMILIES IV: BIPARTITE RAMANUJAN GRAPHS OF ALL SIZES |
2 |
| MINIMUM BISECTION IS FIXED-PARAMETER TRACTABLE |
2 |
| FAULT-TOLERANT SUBGRAPH FOR SINGLE-SOURCE REACHABILITY: GENERAL AND OPTIMAL |
2 |
| STRUCTURE OF PROTOCOLS FOR XOR FUNCTIONS |
2 |
| CONSTRAINT SATISFACTION PROBLEMS FOR REDUCTS OF HOMOGENEOUS GRAPHS |
2 |
| COUNTING HYPERGRAPH COLORINGS IN THE LOCAL LEMMA REGIME |
1 |
| THE INDEPENDENCE NUMBER OF THE BIRKHOFF POLYTOPE GRAPH, AND APPLICATIONS TO MAXIMALLY RECOVERABLE CODES |
1 |
| DETERMINISTIC COMMUNICATION IN RADIO NETWORKS |
1 |
| ALGEBRAIC ATTACKS AGAINST RANDOM LOCAL FUNCTIONS AND THEIR COUNTERMEASURES |
1 |
| APPROXIMATION VIA CORRELATION DECAY WHEN STRONG SPATIAL MIXING FAILS |
1 |
| USING PETAL-DECOMPOSITIONS TO BUILD A LOW STRETCH SPANNING TREE |
1 |
| IF THE CURRENT CLIQUE ALGORITHMS ARE OPTIMAL, SO IS VALIANT'S PARSER |
1 |
