| Publication | Date of Publication | Type |
|---|
| Universality frontier for asynchronous cellular automata | 2026-08-05 | Paper |
| Sequential defaulting in financial networks | 2026-04-15 | Paper |
| Network-aware strategies in financial systems | 2026-03-18 | Paper |
| A general stabilization bound for influence propagation in graphs | 2026-03-18 | Paper |
| Brief announcement: Communication-optimal convex agreement | 2025-06-13 | Paper |
| Active learning supported iterative combinatorial auctions | 2025-04-29 | Paper |
Optimizing resource allocation: an active learning approach to iterative combinatorial auctions
Theoretical Computer Science | 2025-02-26 | Paper |
| Stable dinner party seating arrangements | 2024-09-20 | Paper |
| Recovering single-crossing preferences from approval ballots | 2024-09-20 | Paper |
| Randomized algorithm for MPMD on two sources | 2024-09-20 | Paper |
| Defi and NFTs hinder blockchain scalability | 2024-07-17 | Paper |
Optimal Synchronous Approximate Agreement with Asynchronous Fallback
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The impact of core constraints on truthful bidding in combinatorial auctions
Theoretical Computer Science | 2024-03-15 | Paper |
| Understanding the relationship between core constraints and core-selecting payment rules in combinatorial auctions | 2024-02-28 | Paper |
\textsc{FnF-BFT}: a BFT protocol with provable performance under attack
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Divide \& Scale: formalization and roadmap to robust sharding
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| The k-Server Problem with Delays on the Uniform Metric Space | 2023-11-14 | Paper |
Stabilization Bounds for Influence Propagation from a Random Initial State
(available as arXiv preprint) | 2023-08-08 | Paper |
Consensus on demand
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Better incentives for proof-of-work
Lecture Notes in Computer Science | 2023-06-12 | Paper |
scientific article; zbMATH DE number 7650276 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Space complexity of streaming algorithms on universal quantum computers
(available as arXiv preprint) | 2022-12-22 | Paper |
| A tight lower bound for semi-synchronous collaborative grid exploration | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561370 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Impatient Online Matching | 2022-07-21 | Paper |
Stabilization Time in Weighted Minority Processes
(available as arXiv preprint) | 2022-07-18 | Paper |
Default ambiguity: finding the best solution to the clearing problem
(available as arXiv preprint) | 2022-07-06 | Paper |
\textsc{Brick}: asynchronous incentive-compatible payment channels
(available as arXiv preprint) | 2022-06-22 | Paper |
| Timelocked bribing | 2022-06-17 | Paper |
| Two-agent tree evacuation | 2022-03-22 | Paper |
| Wireless network algorithmics | 2022-02-16 | Paper |
| Min-cost bipartite perfect matching with delays | 2021-07-28 | Paper |
Brief Announcement: Byzantine Agreement with Unknown Participants and Failures
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Ride the lightning: the game theory of payment channels
(available as arXiv preprint) | 2021-02-08 | Paper |
| \textsc{Cerberus} channels: incentivizing watchtowers for Bitcoin | 2021-02-08 | Paper |
A tight lower bound for semi-synchronous collaborative grid exploration
Distributed Computing | 2021-01-22 | Paper |
A tight lower bound for the capture time of the cops and robbers game
Theoretical Computer Science | 2020-09-03 | Paper |
Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs
Theoretical Computer Science | 2020-09-03 | Paper |
| piChain: when a blockchain meets Paxos | 2020-07-30 | Paper |
Byzantine preferential voting
(available as arXiv preprint) | 2020-06-18 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-05-27 | Paper |
Wireless evacuation on \(m\) rays with \(k\) searchers
Theoretical Computer Science | 2020-02-13 | Paper |
Fast size approximation of a radio network in beeping model
Theoretical Computer Science | 2020-02-06 | Paper |
Approximating small balanced vertex separators in almost linear time
Algorithmica | 2019-09-10 | Paper |
The power of non-uniform wireless power
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Networks cannot compute their diameter in sublinear time | 2019-05-10 | Paper |
| Randomness vs. time in anonymous networks | 2018-08-24 | Paper |
Local computation: lower and upper bounds
Journal of the ACM | 2018-08-02 | Paper |
| Distributed stable matching with similar preference lists | 2018-07-18 | Paper |
Wireless evacuation on m rays with k searchers
Structural Information and Communication Complexity | 2018-04-12 | Paper |
Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
Theoretical Computer Science | 2017-12-20 | Paper |
Brief announcement: Fast shared counting using \(O(n)\) compare-and-swap registers
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
An inherent bottleneck in distributed counting
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 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 |
| scientific article; zbMATH DE number 6784996 (Why is no real title available?) | 2017-09-29 | Paper |
| Byzantine agreement with median validity | 2017-09-29 | Paper |
Approximating small balanced vertex separators in almost linear time
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Collaboration without communication: evacuating two robots from a disk
Lecture Notes in Computer Science | 2017-07-21 | Paper |
The power of oblivious wireless power
SIAM Journal on Computing | 2017-06-28 | Paper |
Deterministic multi-channel information exchange
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Approximating the size of a radio network in beeping model
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Lower and upper competitive bounds for online directed graph exploration
Theoretical Computer Science | 2016-11-29 | Paper |
Clairvoyant mechanisms for online auctions
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Tight bounds for parallel randomized load balancing
Distributed Computing | 2016-05-23 | Paper |
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
On competitive recommendations
Theoretical Computer Science | 2016-02-26 | Paper |
Toehold DNA languages are regular (extended abstract)
Algorithms and Computation | 2016-01-11 | Paper |
Lower bounds for the capture time: linear, quadratic, and beyond
Structural Information and Communication Complexity | 2016-01-08 | 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 |
Ignorant vs. anonymous recommendations
Algorithms - ESA 2015 | 2015-11-19 | Paper |
MIS on trees
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Geometric ad-hoc routing, of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Anonymous networks, randomization = 2-hop coloring
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Facility location, distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
\textsc{Maximal Independent Sets} in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Efficient multi-word locking using randomization
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
When selfish meets evil, Byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Tight bounds for delay-sensitive aggregation
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Optimal distributed all pairs shortest paths and applications
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Convergence in (social) influence networks
Lecture Notes in Computer Science | 2014-09-29 | Paper |
Hard-potato routing
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Distributed approximation of minimum routing cost trees
Structural Information and Communication Complexity | 2014-08-07 | Paper |
How many ants does it take to find the food?
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Tight bounds for clock synchronization
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 |
Solving the ANTS problem with asynchronous finite state machines
Automata, Languages, and Programming | 2014-07-01 | Paper |
Tight bounds for parallel randomized load balancing, extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science | 2014-01-13 | Paper |
On competitive recommendations
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Distributed minimum dominating set approximations in restricted families of graphs
Distributed Computing | 2013-08-26 | Paper |
Towards worst-case churn resistant peer-to-peer systems
Distributed Computing | 2013-06-28 | Paper |
