Editing Template:ProblemName

{{#switch: {{{1}}}
| 1 = Fast $L_1$ Difference
| 2 = Quantiles
| 3 = $L_\infty$ Estimation
| 4 = Deterministic Summary Structures
| 5 = Characterizing Sketchable Distances
| 6 = Filtering Irrelevant Data
| 7 = Estimating Earth-Mover Distance
| 8 = Mixed Norms
| 9 = Open-Shortest-Path-First Routing
| 10 = Multi-Round Communication of Gap-Hamming Distance
| 11 = Counting Triangles
| 12 = Deterministic $CUR$-Type Decompositions
| 13 = Effects of Subsampling
| 14 = Graph Distances
| 15 = Semi-Random Streams
| 16 = Graph Matchings
| 17 = The Massive, Unordered, Distributed-Data Model
| 18 = Finite Cursor Machines
| 19 = Sketching vs. Streaming
| 20 = Relations between Streaming Models
| 21 = Deterministic Heavy-Hitters & Fast Matrix Algorithms
| 22 = Random Walks
| 23 = Approximate 2D Width
| 24 = &ldquo;Ultimate&rdquo; Deterministic Sparse Recovery
| 25 = Communication Complexity and Metric Spaces
| 26 = Equivalence of Two MapReduce Models
| 27 = Modeling of Distributed Computation
| 28 = Randomness of Partially Random Streams
| 29 = Strong Lower Bounds for Graph Problems
| 30 = Universal Sketching
| 31 = Gap-Hamming Information Cost
| 32 = The Value of a Reverse Pass
| 33 = Group Testing
| 34 = Linear Algebra Computation
| 35 = Maximal Complex Equiangular Tight Frames
| 36 = Learning an $f$-Transformed Product Distribution
| 37 = Testing Submodularity
| 38 = Query Complexity of Local Partitioning Oracles
| 39 = Approximating Maximum Matching Size
| 40 = Testing Monotonicity and the Lipschitz Property
| 41 = Testing Acyclicity
| 42 = Graph Frequency Vectors
| 43 = Rank Lower Bound
| 44 = Approximating LIS Length in the Streaming Model
| 45 = Streaming Max-Cut/Max-CSP
| 46 = Fast JL Transform  for Sparse Vectors
| 47 = Annotated Streaming
| 48 = Sketching Shift Metrics
| 49 = Sketching Earth Mover Distance
| 50 = Sparse Recovery for Tree Models
| 51 = &ldquo;For All&rdquo; Guarantee for Computationally Bounded Adversaries
| 52 = TSP in the Streaming Model
| 53 = Homomorphic Hash Functions
| 54 = Faster JL Dimensionality Reduction
| 55 = Applications of Clifford Algebras in Graph Streams
| 56 = Efficient Measures of &ldquo;Surprisingness&rdquo; of Sequences
| 57 = Coding Theory in the Streaming Model
| 58 = Signatures for Set Equality
| 59 = Low Expansion Encoding of Edit Distance
| 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 <odels
| 89 = Proofs of Proximity, AM vs. NP
| !!! ADD THE PROBLEM NAME TO Template:ProblemName !!!
}}
@@ Line 87: / Line 87: @@
 | 86 = Equivalence Testing Lower Bound via Communication Complexity
 | 87 = Equivalence Testing with Conditional Samples
-| 88 = Separating PDF and CDF Query Models
+| 88 = Separating PDF and CDF Query <odels
-| 89 = AM vs. NP for Proofs of Proximity in Distribution Testing
+| 89 = Proofs of Proximity, AM vs. NP
-| 90 = Dense Graph Property Testing &ldquo;Tradeoffs&rdquo;
-| 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 !!!
 }}