Q5121896 (Q5121896): Difference between revisions

@@ Property / cites work @@
+Q5368755
@@ Property / cites work: Q5368755 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Reed–Muller Codes
@@ Property / cites work: Testing Reed–Muller Codes / rank @@
+Normal rank
@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+Normal rank
@@ Property / cites work @@
+On Estimating Maximum Matching Size in Graph Streams
+Normal rank
@@ Property / cites work @@
+Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
+Normal rank
@@ Property / cites work @@
+Sparse and Lopsided Set Disjointness via Information Theory
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+MST in Log-Star Rounds of Congested Clique
@@ Property / cites work: MST in Log-Star Rounds of Congested Clique / rank @@
+Normal rank
@@ Property / cites work @@
+Q5368739
@@ Property / cites work: Q5368739 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangles Are Nonnegative Juntas
@@ Property / cites work: Rectangles Are Nonnegative Juntas / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Fourier Dimensionality and Sparsity
@@ Property / cites work: Testing Fourier Dimensionality and Sparsity / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of circuits with gates of low \(L_{1}\) norms.
+Normal rank
@@ Property / cites work @@
+Toward Optimal Bounds in the Congested Clique
@@ Property / cites work: Toward Optimal Bounds in the Congested Clique / rank @@
+Normal rank
@@ Property / cites work @@
+The communication complexity of the Hamming distance problem
+Normal rank
@@ Property / cites work @@
+Two applications of information complexity
@@ Property / cites work: Two applications of information complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4608063
@@ Property / cites work: Q4608063 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Decision Trees Using the Fourier Spectrum
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Composition Theorems in Communication Complexity
@@ Property / cites work: Composition Theorems in Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
+Normal rank
@@ Property / cites work @@
+Turnstile streaming algorithms might as well be linear sketches
+Normal rank
@@ Property / cites work @@
+Q5302079
@@ Property / cites work: Q5302079 / rank @@
+Normal rank
@@ Property / cites work @@
+Recent advances on the log-rank conjecture in communication complexity
+Normal rank
@@ Property / cites work @@
+Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
+Normal rank
@@ Property / cites work @@
+Learning juntas
@@ Property / cites work: Learning juntas / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
+Normal rank
@@ Property / cites work @@
+On the structure of Boolean functions with small spectral norm
+Normal rank
@@ Property / cites work @@
+Q2904786
@@ Property / cites work: Q2904786 / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-Streaming Algorithms for Annotated Graph Streams
+Normal rank
@@ Property / cites work @@
+The Simultaneous Communication of Disjointness with Applications to Data Streams
+Normal rank
@@ Property / cites work @@
+On the parity complexity measures of Boolean functions
+Normal rank