# Difference between revisions of "Template:ProblemName"

m |
(Maybe this capitalization is more consistent) |
||

(7 intermediate revisions by the same user not shown) | |||

Line 80: | Line 80: | ||

| 79 = Cryptogenography | | 79 = Cryptogenography | ||

| 80 = Merlin–Arthur Communication Complexity of Connectivity | | 80 = Merlin–Arthur Communication Complexity of Connectivity | ||

− | | 81 = | + | | 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 !!!