Information complexity of the AND function in the two-party and multi-party settings (Q5919672): Difference between revisions

@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+From information to exact communication
@@ Property / cites work: From information to exact communication / rank @@
+Normal rank
@@ Property / cites work @@
+Information lower bounds via self-reducibility
@@ Property / cites work: Information lower bounds via self-reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Information Equals Amortized Communication
@@ Property / cites work: Information Equals Amortized Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4568116
@@ Property / cites work: Q4568116 / rank @@
+Normal rank
@@ Property / cites work @@
+NOF-Multiparty Information Complexity Bounds for Pointer Jumping
+Normal rank
@@ Property / cites work @@
+Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Some Results on Distributed Source Coding for Interactive Function Computation
+Normal rank
@@ Property / cites work @@
+The Infinite-Message Limit of Two-Terminal Interactive Source Coding
+Normal rank
@@ Property / cites work @@
+On the distributional complexity of disjointness
@@ Property / cites work: On the distributional complexity of disjointness / rank @@
+Normal rank