Rotem Oshman

Distributed Comput., March, 2023

Locally Verifiable Distributed SNARGs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

On Polynomial Time Local Decision.

[BibT_eX]

[DOI]

Eden Aldema Tshuva

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Resilience of 3-Majority Dynamics to Non-Uniform Schedulers.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

The Communication Complexity of Set Intersection Under Product Distributions.

[BibT_eX]

[DOI]

Tal Roth

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Sublinear-time distributed algorithms for detecting small cliques and even cycles.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Distributed Zero-Knowledge Proofs Over Networks.

[BibT_eX]

[DOI]

Aviv Bick

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs.

[BibT_eX]

[DOI]

Yoav Ben Shimon

Proceedings of the Structural Information and Communication Complexity, 2022

Brief Announcement: On Polynomial-Time Local Decision.

[BibT_eX]

[DOI]

Eden Aldema Tshuva

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Massively Parallel Computation in a Heterogeneous Regime.

[BibT_eX]

[DOI]

Adi Horowitz

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Quantum Distributed Algorithms for Detection of Cliques.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

On the Interactive Capacity of Finite-State Protocols.

[BibT_eX]

[DOI]

Entropy, 2021

Truthful Information Dissemination in General Asynchronous Networks.

[BibT_eX]

[DOI]

Lior Solodkin

Proceedings of the 35th International Symposium on Distributed Computing, 2021

The communication complexity of multiparty set disjointness under product distributions.

[BibT_eX]

[DOI]

Nachum Dershowitz

Tal Roth

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators.

[BibT_eX]

[DOI]

Dana Shamir

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

Public vs. private randomness in simultaneous multi-party communication complexity.

[BibT_eX]

[DOI]

Uri Zwick

Theor. Comput. Sci., 2020

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets.

[BibT_eX]

[DOI]

Sepehr Assadi

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

On the Computational Power of Radio Channels.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

On Distributed Merlin-Arthur Decision Protocols.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Can Distributed Uniformity Testing Be Local?

[BibT_eX]

[DOI]

Uri Meir

Dor Minzer

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

On the Communication Complexity of Key-Agreement Protocols.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Distributed Approximate Maximum Matching in the CONGEST Model.

[BibT_eX]

[DOI]

Mohamad Ahmadi

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Possibilities and Impossibilities for Distributed Subgraph Detection.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Interactive Distributed Proofs.

[BibT_eX]

[DOI]

Raghuvansh R. Saxena

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Distributed Uniformity Testing.

[BibT_eX]

[DOI]

Uri Meir

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Superlinear Lower Bounds for Distributed Subgraph Detection.

[BibT_eX]

[DOI]

Tzlil Gonen

CoRR, 2017

Distributed Property Testing for Subgraph-Freeness Revisited.

[BibT_eX]

[DOI]

Tzlil Gonen

CoRR, 2017

Interactive Compression for Multi-Party Protocol.

[BibT_eX]

[DOI]

Dafna Sadeh

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Three Notes on Distributed Property Testing.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

On the Multiparty Communication Complexity of Testing Triangle-Freeness.

[BibT_eX]

[DOI]

Shay Gershtein

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Lower Bounds for Subgraph Detection in the CONGEST Model.

[BibT_eX]

[DOI]

Tzlil Gonen

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness.

[BibT_eX]

[DOI]

Mark Braverman

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2015

The Communication Complexity of Number-In-Hand Set Disjointness with No Promise.

[BibT_eX]

[DOI]

Mark Braverman

Electron. Colloquium Comput. Complex., 2015

On Information Complexity in the Broadcast Model.

[BibT_eX]

[DOI]

Mark Braverman

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

Communication Complexity Lower Bounds in Distributed Message-Passing.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

On the power of the congested clique model.

[BibT_eX]

[DOI]

Andrew Drucker

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013

Tight Bounds for Set Disjointness in the Message Passing Model

[BibT_eX]

[DOI]

CoRR, 2013

The SkipTrie: low-depth concurrent search without rebalancing.

[BibT_eX]

[DOI]

Nir Shavit

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

A Tight Bound for Set Disjointness in the Message-Passing Model.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

The communication complexity of distributed task allocation.

[BibT_eX]

[DOI]

Andrew Drucker

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011

Dynamic networks: models and algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2011

Gradient Clock Synchronization in Dynamic Networks.

[BibT_eX]

[DOI]

Thomas Locher

Theory Comput. Syst., 2011

The Complexity of Data Aggregation in Directed Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Resilience of mutual exclusion algorithms to transient memory faults.

[BibT_eX]

[DOI]

Thomas Moscibroda

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Coordinated consensus in dynamic networks.

[BibT_eX]

[DOI]

Yoram Moses

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010

Distributed computation in dynamic networks.

[BibT_eX]

[DOI]

Nancy A. Lynch

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Broadcasting in unreliable radio networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Optimal gradient clock synchronization in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2009

Gradient Clock Synchronization Using Reference Broadcasts.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2007

A New Approach to Bounded Model Checking for Branching Time Logics.

[BibT_eX]

[DOI]