| Publication | Date of Publication | Type |
|---|
| Online paging with a vanishing regret | 2026-04-15 | Paper |
Towards distributed two-stage stochastic optimization
Distributed Computing | 2026-01-20 | Paper |
Deterministic fault-tolerant connectivity labeling scheme
Distributed Computing | 2025-04-03 | Paper |
| Online algorithms with randomly infused advice | 2025-01-06 | Paper |
| Beeping shortest paths via hypergraph bipartite decomposition | 2024-09-25 | Paper |
Stateful posted pricing with vanishing regret via dynamic deterministic Markov decision processes
Mathematics of Operations Research | 2024-06-27 | Paper |
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Deterministic Fault-Tolerant Connectivity Labeling Scheme
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
SIAM Journal on Computing | 2024-03-19 | Paper |
| Communication efficient self-stabilizing leader election | 2023-11-02 | Paper |
| Twenty-two new approximate proof labeling schemes | 2023-11-02 | Paper |
| scientific article; zbMATH DE number 7650882 (Why is no real title available?) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650398 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Distributed algorithms for low stretch spanning trees | 2023-02-03 | Paper |
| Message reduction in the LOCAL model is a free lunch | 2023-02-03 | Paper |
| The Synergy of Finite State Machines | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561256 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Deterministic Leader Election in Programmable Matter
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7525481 (Why is no real title available?) | 2022-05-11 | Paper |
| Bayesian generalized network design | 2022-05-11 | Paper |
Hierarchical \(b\)-matching
(available as arXiv preprint) | 2022-03-24 | Paper |
Message Reduction in the LOCAL Model is a Free Lunch
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Message Reduction in the LOCAL Model is a Free Lunch
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency
Journal of the ACM | 2020-11-11 | Paper |
Bayesian generalized network design
Theoretical Computer Science | 2020-09-17 | Paper |
Bayesian generalized network design
Theoretical Computer Science | 2020-09-17 | Paper |
A tight lower bound for the capture time of the cops and robbers game
Theoretical Computer Science | 2020-09-03 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-05-27 | Paper |
Dynamic networks of finite state machines
Theoretical Computer Science | 2020-02-06 | Paper |
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Stable secretaries
Algorithmica | 2019-06-27 | Paper |
Minimum cost perfect matching with delays for two sources
Theoretical Computer Science | 2018-12-04 | Paper |
Space-constrained interval selection
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Semi-streaming set cover
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Exploring an infinite space with finite memory scouts
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the additive constant of the k-server work function algorithm
Information Processing Letters | 2017-11-03 | Paper |
| Approximating the statistics of various properties in randomly weighted graphs | 2017-09-29 | Paper |
Online matching: haste makes waste!
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Minimum cost perfect matching with delays for two sources
Lecture Notes in Computer Science | 2017-07-21 | Paper |
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Distributed Computing | 2017-06-22 | Paper |
Dynamic networks of finite state machines
Lecture Notes in Computer Science | 2016-12-01 | Paper |
How many ants does it take to find the food?
Theoretical Computer Science | 2015-12-11 | Paper |
The price of matching with metric preferences
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Anonymous networks, randomization = 2-hop coloring
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Economical graph discovery
Operations Research | 2015-08-28 | Paper |
| Approximating minimum MAX-stretch spanning trees on unweighted graphs | 2015-08-03 | Paper |
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Efficient threshold detection in a distributed environment (extended abstract)
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Bayesian ignorance
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
How many ants does it take to find the food?
Structural Information and Communication Complexity | 2014-08-07 | Paper |
SINR diagrams, towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Computability in anonymous networks: revocable vs. irrecovable outputs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Semi-streaming set cover (extended abstract)
Automata, Languages, and Programming | 2014-07-01 | Paper |
Solving the ANTS problem with asynchronous finite state machines
Automata, Languages, and Programming | 2014-07-01 | Paper |
Broadcasting in UDG radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
SINR diagrams, convexity and its applications in wireless networks
Journal of the ACM | 2014-02-17 | Paper |
Space-constrained interval selection
Automata, Languages, and Programming | 2013-08-12 | Paper |
Broadcasting in UDG radio networks with unknown topology
Distributed Computing | 2013-06-28 | Paper |
Adversarial Leakage in Games
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Online set packing
SIAM Journal on Computing | 2012-11-29 | Paper |
Computing optimal contracts in combinatorial agencies
Theoretical Computer Science | 2012-10-11 | Paper |
Bayesian ignorance
Theoretical Computer Science | 2012-10-11 | Paper |
Sparse reliable graph backbones
Information and Computation | 2012-05-24 | Paper |
New bounds for the controller problem
Distributed Computing | 2012-02-06 | Paper |
\(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
Algorithmica | 2011-08-16 | Paper |
Online computation with advice
Theoretical Computer Science | 2011-06-07 | Paper |
A tight upper bound on the probabilistic embedding of series-parallel graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Sparse reliable graph backbones
Automata, Languages and Programming | 2010-09-07 | Paper |
Lower-stretch spanning trees
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
A tight upper bound on the probabilistic embedding of series-parallel graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764782 (Why is no real title available?) | 2010-08-06 | Paper |
On the additive constant of the \(k\)-server work function algorithm
Approximation and Online Algorithms | 2010-05-11 | Paper |
New Bounds for the Controller Problem
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
SIAM Journal on Computing | 2009-11-06 | Paper |
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Online Computation with Advice
Automata, Languages and Programming | 2009-07-14 | Paper |
Lower-Stretch Spanning Trees
SIAM Journal on Computing | 2009-04-30 | Paper |
