Latest revision |
Your text |
Line 75: |
Line 75: |
| | 74 = Succinct Representation for Functions on Graphs | | | 74 = Succinct Representation for Functions on Graphs |
| | 75 = Data Structure Lower Bound in the Cell Probe Model | | | 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 !!! |
| }} | | }} |