| 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 |
scientific article; zbMATH DE number 7832762 (Why is no real title available?)
| 2024-04-15 | Paper |
scientific article; zbMATH DE number 7829267 (Why is no real title available?)
| 2024-04-09 | Paper |
Brief Announcement: On Polynomial-Time Local Decision
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Massively Parallel Computation in a Heterogeneous Regime
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774288 (Why is no real title available?)
| 2023-12-08 | Paper |
The communication complexity of multiparty set disjointness under product distributions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 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
Distributed Computing | 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
Distributed Computing | 2022-06-21 | Paper |
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Can Distributed Uniformity Testing Be Local?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 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
Theoretical Computer Science | 2020-02-06 | Paper |
Interactive distributed proofs
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Distributed uniformity testing
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
On the multiparty communication complexity of testing triangle-freeness
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Public vs. private randomness in simultaneous multi-party communication complexity
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On information complexity in the broadcast model
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Resilience of mutual exclusion algorithms to transient memory faults
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
On the power of the congested clique model
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
The SkipTrie, low-depth concurrent search without rebalancing
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
The communication complexity of distributed task allocation
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Gradient clock synchronization in dynamic networks
Theory of Computing Systems | 2012-12-10 | Paper |
The complexity of data aggregation in directed networks
Lecture Notes in Computer Science | 2011-10-28 | Paper |
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
Lecture Notes in Computer Science | 2009-02-10 | Paper |
A New Approach to Bounded Model Checking for Branching Time Logics
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
