Difference between revisions of "Template:ProblemName"
(Created page with "{{#switch: {{{1}}} | 1 = Fast $L_1$ Difference | 2 = Quantiles | 3 = $L_\infty$ Estimation | 4 = Deterministic Summary Structures | 5 = Characterizing Sketchable Distances | 6...") |
(Maybe this capitalization is more consistent) |
||
| (15 intermediate revisions by 2 users not shown) | |||
| Line 8: | Line 8: | ||
| 7 = Estimating Earth-Mover Distance | | 7 = Estimating Earth-Mover Distance | ||
| 8 = Mixed Norms | | 8 = Mixed Norms | ||
| − | | 9 = Open-Shortest-Path-First | + | | 9 = Open-Shortest-Path-First Routing |
| 10 = Multi-Round Communication of Gap-Hamming Distance | | 10 = Multi-Round Communication of Gap-Hamming Distance | ||
| 11 = Counting Triangles | | 11 = Counting Triangles | ||
| Line 60: | Line 60: | ||
| 59 = Low Expansion Encoding of Edit Distance | | 59 = Low Expansion Encoding of Edit Distance | ||
| 60 = Single-Pass Unweighted Matchings | | 60 = Single-Pass Unweighted Matchings | ||
| + | | 61 = RNA Folding | ||
| + | | 62 = Principal Component Analysis with Nonnegativity Constraints | ||
| + | | 63 = Submodular Matching Maximization | ||
| + | | 64 = Matchings in the Turnstile Model | ||
| + | | 65 = Communication Complexity of Connectivity | ||
| + | | 66 = Distinguishing Distributions with Conditional Samples | ||
| + | | 67 = Difficult Instance for Max-Cut in the Streaming Model | ||
| + | | 68 = Approximating Rank in the Bounded-Degree Model | ||
| + | | 69 = Correcting Independence of Distributions | ||
| + | | 70 = Open Problems in $L_p$-Testing | ||
| + | | 71 = Metric TSP Cost Approximation | ||
| + | | 72 = Communication Complexity of Approximating Set-Intersection Join | ||
| + | | 73 = Streaming Online Algorithms | ||
| + | | 74 = Succinct Representation for Functions on Graphs | ||
| + | | 75 = Data Structure Lower Bound in the Cell Probe Model | ||
| + | | 76 = External Information and Amortized Expected Communication | ||
| + | | 77 = Frontiers in Structural Communication Complexity | ||
| + | | 78 = Linear Sketching Over $F_2$ | ||
| + | | 79 = Cryptogenography | ||
| + | | 80 = Merlin–Arthur Communication Complexity of Connectivity | ||
| + | | 81 = Rényi Entropy Estimation | ||
| + | | 82 = Beyond Identity Testing | ||
| + | | 83 = Instance-Specific Hellinger Testing | ||
| + | | 84 = Efficient Profile Maximum Likelihood Computation | ||
| + | | 85 = Sample Stretching | ||
| + | | 86 = Equivalence Testing Lower Bound via Communication Complexity | ||
| + | | 87 = Equivalence Testing with Conditional Samples | ||
| + | | 88 = Separating PDF and CDF Query Models | ||
| + | | 89 = AM vs. NP for Proofs of Proximity in Distribution Testing | ||
| + | | 90 = Dense Graph Property Testing “Tradeoffs” | ||
| + | | 91 = Cut-Sparsification of Hypergraphs | ||
| + | | 92 = Streaming Algorithms for Approximating the Number of $H$-Subgraphs | ||
| + | | 93 = Locally Private Heavy Hitters and Other Problems in Streaming | ||
| + | | 94 = Ads, Impressions, and Statistics | ||
| + | | 95 = Non-Adaptive Group Testing | ||
| + | | 96 = Identity Testing up to Coarsenings | ||
| + | | 97 = Local Computation Algorithm for MIS | ||
| + | | 98 = Estimating a Graph's Degree Distribution | ||
| + | | 99 = Vertex-Distribution-Free Graph Testing | ||
| + | | 100 = Effective Support Size Estimation in the Dual Model | ||
| + | | 101 = Vertex Connectivity in the LOCAL Model | ||
| + | | 102 = Making Edges Happy in the LOCAL Model | ||
| !!! ADD THE PROBLEM NAME TO Template:ProblemName !!! | | !!! ADD THE PROBLEM NAME TO Template:ProblemName !!! | ||
}} | }} | ||
Latest revision as of 18:05, 26 August 2019
!!! ADD THE PROBLEM NAME TO Template:ProblemName !!!
