Publication | Date of Publication | Type |
---|
Distributed computations in fully-defective networks | 2024-03-26 | Paper |
The Topology of Randomized Symmetry-Breaking Distributed Computing | 2024-03-26 | Paper |
Distributed computations in fully-defective networks | 2023-11-21 | Paper |
Correction to: ``Distributed computations in fully-defective networks | 2023-11-21 | Paper |
Optimal Short-Circuit Resilient Formulas | 2023-04-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5874240 | 2023-02-07 | Paper |
Noisy beeping networks | 2022-12-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q5091761 | 2022-07-27 | Paper |
Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise | 2022-07-13 | Paper |
Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions | 2021-07-23 | Paper |
Making Asynchronous Distributed Computations Robust to Channel Noise | 2021-06-15 | Paper |
Brief Announcement: Noisy Beeping Networks | 2021-03-15 | Paper |
Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions | 2021-01-20 | Paper |
Efficient Error-Correcting Codes for Sliding Windows | 2020-03-26 | Paper |
Making asynchronous distributed computations robust to noise | 2019-11-27 | Paper |
Reliable communication over highly connected noisy networks | 2019-11-27 | Paper |
Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks | 2019-07-19 | Paper |
Secure two-party computation over unreliable channels | 2018-10-17 | Paper |
Explicit Capacity Approaching Coding for Interactive Communication | 2018-09-19 | Paper |
Security of the Bennett-Brassard quantum key distribution protocol against collective attacks | 2018-08-20 | Paper |
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible | 2018-08-02 | Paper |
Towards Optimal Deterministic Coding for Interactive Communication | 2018-07-16 | Paper |
Coding for Interactive Communication Correcting Insertions and Deletions | 2018-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4638071 | 2018-05-03 | Paper |
Coding for Interactive Communication: A Survey | 2018-01-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4598200 | 2017-12-19 | Paper |
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback | 2017-10-05 | Paper |
Constant-rate coding for multiparty interactive communication is impossible | 2017-09-29 | Paper |
Reliable Communication over Highly Connected Noisy Networks | 2017-09-29 | Paper |
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback | 2017-08-18 | Paper |
Private interactive communication across an adversarial channel | 2017-05-19 | Paper |
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback | 2017-05-19 | Paper |
Efficient Coding for Interactive Communication | 2017-05-16 | Paper |
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback | 2017-04-28 | Paper |
Private Interactive Communication Across an Adversarial Channel | 2017-04-28 | Paper |
Optimal Coding for Streaming Authentication and Interactive Communication | 2017-04-28 | Paper |
A Little Honesty Goes a Long Way | 2015-07-06 | Paper |
Efficient Error-Correcting Codes for Sliding Windows | 2015-01-13 | Paper |
How to catch \(L_2\)-heavy-hitters on sliding windows | 2014-10-06 | Paper |
Efficient and Explicit Coding for Interactive Communication | 2014-07-30 | Paper |
Position-Based Quantum Cryptography: Impossibility and Constructions | 2014-06-04 | Paper |
Optimal Coding for Streaming Authentication and Interactive Communication | 2013-09-17 | Paper |
How to Catch L 2-Heavy-Hitters on Sliding Windows | 2013-06-11 | Paper |
Attacks on Fixed Apparatus Quantum Key Distribution Schemes | 2012-11-21 | Paper |
On the Security of Interferometric Quantum Key Distribution | 2012-11-21 | Paper |
Multiparty Proximity Testing with Dishonest Majority from Equality Testing | 2012-11-01 | Paper |
Semiquantum key distribution | 2012-07-31 | Paper |
Position-Based Quantum Cryptography: Impossibility and Constructions | 2011-08-12 | Paper |