| Publication | Date of Publication | Type |
|---|
| The communication complexity of set intersection under product distributions | 2024-11-14 | Paper |
| Resilience of 3-majority dynamics to non-uniform schedulers | 2024-09-25 | Paper |
| Locally verifiable distributed SNARGs | 2024-08-01 | Paper |
| Distributed zero-knowledge proofs over networks | 2024-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128585 | 2024-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126262 | 2024-04-09 | Paper |
| Brief Announcement: On Polynomial-Time Local Decision | 2024-03-26 | Paper |
| Massively Parallel Computation in a Heterogeneous Regime | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083409 | 2023-12-08 | Paper |
| The communication complexity of multiparty set disjointness under product distributions | 2023-11-14 | Paper |
| Fast distributed algorithms for girth, cycles and small subgraphs | 2023-11-02 | Paper |
| A distributed algorithm for directed minimum-weight spanning tree | 2023-03-14 | Paper |
| Sublinear-time distributed algorithms for detecting small cliques and even cycles | 2023-02-03 | Paper |
| A distributed algorithm for directed minimum-weight spanning tree | 2023-02-03 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
| Interactive compression for multi-party protocol | 2023-02-03 | Paper |
| On the computational power of radio channels | 2023-02-03 | Paper |
| Proof labeling schemes for reachability-related problems in directed graphs | 2022-11-11 | Paper |
| Distributed Approximate Maximum Matching in the CONGEST Model. | 2022-07-21 | Paper |
| On the Communication Complexity of Key-Agreement Protocols. | 2022-07-18 | Paper |
| Sublinear-time distributed algorithms for detecting small cliques and even cycles | 2022-06-21 | Paper |
| Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets | 2021-03-15 | Paper |
| Can Distributed Uniformity Testing Be Local? | 2021-01-20 | Paper |
| Lower Bounds for Subgraph Detection in the CONGEST Model | 2020-07-30 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
| Public vs. private randomness in simultaneous multi-party communication complexity | 2020-02-06 | Paper |
| Interactive Distributed Proofs | 2019-09-19 | Paper |
| Distributed Uniformity Testing | 2019-09-19 | Paper |
| On the Multiparty Communication Complexity of Testing Triangle-Freeness | 2017-10-11 | Paper |
| Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity | 2016-12-01 | Paper |
| On information complexity in the broadcast model | 2016-03-23 | Paper |
| Coordinated consensus in dynamic networks | 2015-09-11 | Paper |
| Resilience of mutual exclusion algorithms to transient memory faults | 2015-09-11 | Paper |
| On the power of the congested clique model | 2015-09-03 | Paper |
| Optimal gradient clock synchronization in dynamic networks | 2015-03-02 | Paper |
| Broadcasting in unreliable radio networks | 2015-03-02 | Paper |
| The SkipTrie | 2015-03-02 | Paper |
| The communication complexity of distributed task allocation | 2014-12-05 | Paper |
| Distributed computation in dynamic networks | 2014-08-13 | Paper |
| Gradient clock synchronization in dynamic networks | 2012-12-10 | Paper |
| The Complexity of Data Aggregation in Directed Networks | 2011-10-28 | Paper |
| An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking | 2009-02-10 | Paper |
| A New Approach to Bounded Model Checking for Branching Time Logics | 2008-07-03 | Paper |
