Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q5595624
@@ Property / cites work: Q5595624 / rank @@
+Normal rank
@@ Property / cites work @@
+The Efficient Construction of an Unbiased Random Sequence
+Normal rank
@@ Property / cites work @@
+Class of constructive asymptotically good algebraic codes
+Normal rank
@@ Property / cites work @@
+Q5823592
@@ Property / cites work: Q5823592 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating quasi-random sequences from semi-random sources
+Normal rank
@@ Property / cites work @@
+Q3702366
@@ Property / cites work: Q3702366 / rank @@
+Normal rank
@@ Property / cites work @@
+The Wire-Tap Channel
@@ Property / cites work: The Wire-Tap Channel / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02579325
+Normal rank
@@ Property / OpenAlex ID @@
+W2065392541
@@ Property / OpenAlex ID: W2065392541 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1102253