| Publication | Date of Publication | Type |
|---|
Can We Break Symmetry with o(m) Communication?
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Byzantine Agreement and Leader Election
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Distributed MIS in O(log log n) Awake Complexity
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774278 (Why is no real title available?)
| 2023-12-08 | Paper |
Scalable and secure computation among strangers: message-competitive Byzantine protocols
| 2023-11-02 | Paper |
Singularly optimal randomized leader election
| 2023-11-02 | Paper |
Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets
| 2023-02-03 | Paper |
Time-message trade-offs in distributed algorithms
| 2022-07-21 | Paper |
Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
The complexity of leader election in diameter-two networks
Distributed Computing | 2020-04-23 | Paper |
Message lower bounds via efficient network synchronization
Theoretical Computer Science | 2020-02-06 | Paper |
The distributed minimum spanning tree problem
| 2019-12-09 | Paper |
A time- and message-optimal distributed algorithm for minimum spanning trees
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Sublinear message bounds for randomized agreement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
On the complexity of information spreading in dynamic networks
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Towards robust and efficient computation in dynamic peer-to-peer networks
| 2019-05-10 | Paper |
Fast Byzantine leader election in dynamic networks
| 2018-08-24 | Paper |
Information spreading in dynamic networks under oblivious adversaries
| 2018-08-16 | Paper |
Brief announcement: Symmetry breaking in the \textsc{Congest} model: time- and message-efficient algorithms for ruling sets
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Distributed computation of large-scale graph problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A time- and message-optimal distributed algorithm for minimum spanning trees
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Sublinear bounds for randomized leader election
Lecture Notes in Computer Science | 2016-12-19 | Paper |
Message Lower Bounds via Efficient Network Synchronization
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Static and dynamic evaluation of QoS properties
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Efficient computation of sparse structures
Random Structures & Algorithms | 2016-09-15 | Paper |
DEX: self-healing expanders
Distributed Computing | 2016-07-05 | Paper |
Discovery through gossip
Random Structures & Algorithms | 2016-06-10 | Paper |
Toward optimal bounds in the congested clique, graph connectivity and MST
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Efficient distributed computation of distance sketches in networks
Distributed Computing | 2015-10-20 | Paper |
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Xheal, localized self-healing using expanders
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Can quantum communication speed up distributed computation?
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On the Complexity of Universal Leader Election
Journal of the ACM | 2015-08-14 | Paper |
Distributed agreement in dynamic peer-to-peer networks
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Distributed computation in dynamic networks via random walks
Theoretical Computer Science | 2015-05-22 | Paper |
Fast Byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Fast distributed PageRank computation
Theoretical Computer Science | 2014-12-02 | Paper |
Sublinear bounds for randomized leader election
Theoretical Computer Science | 2014-12-02 | Paper |
The bin-covering technique for thresholding random geometric graph properties
| 2014-10-13 | Paper |
Fast distributed random walks
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Xheal: a localized self-healing algorithm using expanders
Distributed Computing | 2014-07-11 | Paper |
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Distributed random walks
Journal of the ACM | 2014-02-17 | Paper |
Efficient computation of balanced structures
Automata, Languages, and Programming | 2013-08-07 | Paper |
A fast distributed approximation algorithm for minimum spanning trees
Distributed Computing | 2013-06-20 | Paper |
Fast distributed computation in dynamic networks via random walks
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Distributed verification and hardness of distributed approximation
SIAM Journal on Computing | 2013-02-04 | Paper |
Efficient distributed approximation algorithms via probabilistic tree embeddings
Distributed Computing | 2013-02-04 | Paper |
Almost-optimal gossip-based aggregate computation
SIAM Journal on Computing | 2012-09-12 | Paper |
A universal online caching algorithm based on pattern matching
Algorithmica | 2010-03-04 | Paper |
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Information Processing Letters | 2009-12-04 | Paper |
On the Hardness of Optimization in Power Law Graphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Improved random graph isomorphism
Journal of Discrete Algorithms | 2008-11-18 | Paper |
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
Lecture Notes in Computer Science | 2008-09-09 | Paper |
On the hardness of optimization in power-law graphs
Theoretical Computer Science | 2008-04-15 | Paper |
Analysis of randomized protocols for conflict-free distributed access
Algorithmica | 2007-11-28 | Paper |
A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
Theoretical Computer Science | 2007-10-18 | Paper |
Using PageRank to Characterize Web Structure
Internet Mathematics | 2007-04-05 | Paper |
scientific article; zbMATH DE number 2089988 (Why is no real title available?)
| 2004-08-12 | Paper |
The restriction mapping problem revisited.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Can entropy characterize performance of online algorithms?
| 2002-03-24 | Paper |
