Towards a reverse Newman's theorem in interactive information complexity (Q343858): Difference between revisions

@@ Property / author @@
-Q343857
@@ Property / author: Q343857 / rank @@
-Normal rank
@@ Property / author @@
+Nikolai K. Vereshchagin
@@ Property / author: Nikolai K. Vereshchagin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-015-0112-9
+Normal rank
@@ Property / OpenAlex ID @@
+W3001333482
@@ Property / OpenAlex ID: W3001333482 / rank @@
+Normal rank
@@ Property / cites work @@
+How to compress interactive communication
@@ Property / cites work: How to compress interactive communication / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a reverse Newman's theorem in interactive information complexity
+Normal rank
@@ Property / cites work @@
+Public vs Private Coin in Bounded-Round Information
+Normal rank
@@ Property / cites work @@
+Internal Compression of Protocols to Entropy
@@ Property / cites work: Internal Compression of Protocols to Entropy / rank @@
+Normal rank
@@ Property / cites work @@
+Information Equals Amortized Communication
@@ Property / cites work: Information Equals Amortized Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Direct Product via Round-Preserving Compression
@@ Property / cites work: Direct Product via Round-Preserving Compression / rank @@
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+Computing with Noisy Information
@@ Property / cites work: Computing with Noisy Information / rank @@
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+A direct product theorem for two-party bounded-round public-coin communication complexity
+Normal rank
@@ Property / cites work @@
+Q4449184
@@ Property / cites work: Q4449184 / rank @@
+Normal rank
@@ Property / cites work @@
+Private vs. common random bits in communication complexity
+Normal rank
@@ Property / cites work @@
+Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
+Normal rank
@@ Property / cites work @@
+Noiseless coding of correlated information sources
+Normal rank