( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Computational Power of Radio Channels.

, , , и . DISC, том 146 из LIPIcs, стр. 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Florian Koller-Meinfelder

Analysis of incomplete survey data: multiple imputation via Bayesian bootstrap predictive mean matching. Uni Bamberg, (2009)

Michael Kolde

Bernd Kollert

Evelin Kolende

Peter Koll

 

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

Circuits resilient to short-circuit errors., , , , , , и . STOC, стр. 582-594. ACM, (2022)Exponential Separation of Information and Communication for Boolean Functions., , и . STOC, стр. 557-566. ACM, (2015)Binary Interactive Error Resilience Beyond $^1\!/\!_8$ (or why $(^1\!/\!_2)^3 > ^1\!/\!_8)$., , и . FOCS, стр. 470-481. IEEE, (2020)Statistically Near-Optimal Hypothesis Selection., , , , и . FOCS, стр. 909-919. IEEE, (2021)Interactive Coding Over the Noisy Broadcast Channel., , и . Electron. Colloquium Comput. Complex., (2017)Games for exchanging information., и . STOC, стр. 423-432. ACM, (2008)Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound., , , и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 701-712. Springer, (2014)Computation over the Noisy Broadcast Channel with Malicious Parties., , , и . ITCS, том 185 из LIPIcs, стр. 82:1-82:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems., , , и . FOCS, стр. 354-364. IEEE, (2020)Binary Codes with Resilience Beyond 1/4 via Interaction., , , и . FOCS, стр. 1-12. IEEE, (2022)