From post

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian.

, , и . APPROX-RANDOM, том 60 из LIPIcs, стр. 42:3-42:29. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

From Soft Classifiers to Hard Decisions: How fair can we be?, , , , , и . CoRR, (2018)How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories., , , , и . RECOMB, том 11467 из Lecture Notes in Computer Science, стр. 136-157. Springer, (2019)Relaxed Locally Correctable Codes., , и . ITCS, том 94 из LIPIcs, стр. 27:1-27:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian., , и . APPROX-RANDOM, том 60 из LIPIcs, стр. 42:3-42:29. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)From Soft Classifiers to Hard Decisions: How fair can we be?, , , , , и . FAT, стр. 309-318. ACM, (2019)Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't., , и . ITCS, том 124 из LIPIcs, стр. 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions., , и . PODC, стр. 137-146. ACM, (2019)