| Publication | Date of Publication | Type |
|---|
| Toward self-adjusting k-ary search tree networks | 2026-05-26 | Paper |
Know the person behind the papers. Today: Don Knuth
Bulletin of the European Association for Theoretical Computer Science EATCS | 2026-05-12 | Paper |
| Maximally resilient replacement paths for a family of product graphs | 2026-03-31 | Paper |
| A subquadratic bound for online bisection | 2025-11-10 | Paper |
| Brief announcement: Musketeer -- incentive-compatible rebalancing for payment channel networks | 2025-06-13 | Paper |
Know the person behind the papers. Today: Antoine Amarilli
Bulletin of the European Association for Theoretical Computer Science EATCS | 2025-04-22 | Paper |
Know the person behind the papers. Today: Bruce Maggs
Bulletin of the European Association for Theoretical Computer Science EATCS | 2025-04-22 | Paper |
| Online algorithms with randomly infused advice | 2025-01-06 | Paper |
| Dynamic maintenance of monotone dynamic programs and applications | 2024-10-08 | Paper |
| Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks | 2024-09-25 | Paper |
| The time complexity of consensus under oblivious message adversaries | 2024-09-25 | Paper |
Know the person behind the papers. Today: Laura Kovács
Bulletin of the European Association for Theoretical Computer Science EATCS | 2024-08-21 | Paper |
Know the person behind the papers. Today: Moshe Vardi
Bulletin of the European Association for Theoretical Computer Science EATCS | 2024-08-21 | Paper |
Know the person behind the papers. Today: Sergio Rajsbaum
Bulletin of the European Association for Theoretical Computer Science EATCS | 2024-08-21 | Paper |
| R2: boosting liquidity in payment channel networks with online admission control | 2024-07-17 | Paper |
The time complexity of consensus under oblivious message adversaries
Algorithmica | 2024-05-30 | Paper |
| Sinkless orientation made simple | 2024-05-14 | Paper |
| Self-adjusting linear networks | 2024-04-19 | Paper |
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
Theoretical Computer Science | 2024-02-20 | Paper |
| scientific article; zbMATH DE number 7800874 (Why is no real title available?) | 2024-02-06 | Paper |
| scientific article; zbMATH DE number 7800882 (Why is no real title available?) | 2024-02-06 | Paper |
scientific article; zbMATH DE number 7788504 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Self-adjusting linear networks with ladder demand graph
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model | 2023-12-08 | Paper |
| Brief announcement: What can(not) be perfectly rerouted locally | 2023-11-02 | Paper |
| scientific article; zbMATH DE number 7701414 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701415 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701416 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701417 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701418 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701419 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701420 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701421 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701422 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701428 (Why is no real title available?) | 2023-06-26 | Paper |
| scientific article; zbMATH DE number 7701435 (Why is no real title available?) | 2023-06-26 | Paper |
\textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
Financial Cryptography and Data Security | 2023-05-26 | Paper |
Self-adjusting grid networks
Information and Computation | 2023-05-19 | Paper |
scientific article; zbMATH DE number 7650871 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Demand-aware network designs of bounded degree | 2023-02-03 | Paper |
| Dynamically optimal self-adjusting single-source tree networks | 2022-10-13 | Paper |
Integrality Properties in the Moduli Space of Elliptic Curves: Isogeny Case
The Quarterly Journal of Mathematics | 2022-09-22 | Paper |
The Value of Information in Selfish Routing
Structural Information and Communication Complexity | 2022-09-01 | Paper |
The Value of Information in Selfish Routing
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| Local Fast Segment Rerouting on Hypercubes | 2022-07-21 | Paper |
| Faster pushdown reachability analysis with applications in network verification | 2022-06-22 | Paper |
scientific article; zbMATH DE number 7525512 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
| scientific article; zbMATH DE number 7515758 (Why is no real title available?) | 2022-04-28 | Paper |
| scientific article; zbMATH DE number 7515764 (Why is no real title available?) | 2022-04-28 | Paper |
\textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications
Journal of Computer and System Sciences | 2022-04-04 | Paper |
Integrality properties In the moduli space of elliptic curves: CM case
International Journal of Number Theory | 2021-08-19 | Paper |
| Resilient capacity-aware routing | 2021-08-04 | Paper |
Congestion-free rerouting of flows on DAGs
(available as arXiv preprint) | 2021-07-28 | Paper |
Conic formation in presence of faulty robots
(available as arXiv preprint) | 2021-07-08 | Paper |
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Does Preprocessing Help under Congestion?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Competitive clustering of stochastic communication patterns on a ring
Computing | 2021-01-15 | Paper |
Dynamic balanced graph partitioning
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
The many faces of graph dynamics
Journal of Statistical Mechanics: Theory and Experiment | 2020-08-11 | Paper |
Demand-aware network designs of bounded degree
Distributed Computing | 2020-06-15 | Paper |
Demand-aware network designs of bounded degree
Distributed Computing | 2020-06-15 | Paper |
Walking through waypoints
Algorithmica | 2020-05-21 | Paper |
Self-adjusting linear networks
(available as arXiv preprint) | 2020-03-03 | Paper |
Walking through waypoints
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Distributed Dominating Set Approximations beyond Planar Graphs
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Principles of robust medium access and an application to leader election
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Online balanced repartitioning | 2018-08-16 | Paper |
scientific article; zbMATH DE number 6905198 (Why is no real title available?)
(available as arXiv preprint) | 2018-07-18 | Paper |
Sade: competitive MAC under adversarial SINR
Distributed Computing | 2018-06-01 | Paper |
| Topological Self-Stabilization with Name-Passing Process Calculi | 2018-03-21 | Paper |
rDAN: toward robust demand-aware network designs
Information Processing Letters | 2018-03-16 | Paper |
Large cuts with local algorithms on triangle-free graphs
The Electronic Journal of Combinatorics | 2017-10-24 | Paper |
Large cuts with local algorithms on triangle-free graphs
The Electronic Journal of Combinatorics | 2017-10-24 | Paper |
A local constant factor MDS approximation for bounded genus graphs
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Data locality and replica aware virtual cluster embeddings
Theoretical Computer Science | 2017-09-28 | Paper |
Transiently consistent SDN updates: being greedy is hard
Structural Information and Communication Complexity | 2016-12-01 | Paper |
An approximation algorithm for path computation and function placement in SDNs
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Upper and lower bounds for deterministic broadcast in powerline communication networks
Distributed Computing | 2016-10-17 | Paper |
Scheduling loop-free network updates: it's good to relax!
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Online admission control and embedding of service chains
Structural Information and Communication Complexity | 2016-01-08 | Paper |
\(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
Journal of the ACM | 2015-08-14 | Paper |
Adversarial topology discovery in network virtualization environments: a threat for ISPs?
Distributed Computing | 2015-07-08 | 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 |
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 |
A note on the parallel runtime of self-stabilizing graph linearization
Theory of Computing Systems | 2015-02-05 | Paper |
Small strain elasto-plastic multiphase-field model
Computational Mechanics | 2015-01-23 | Paper |
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Tight bounds for delay-sensitive aggregation
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Competitive and fair throughput for co-existing networks under adversarial interference
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Misleading stars: what cannot be measured in the internet?
Distributed Computing | 2014-03-25 | Paper |
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science | 2014-01-10 | Paper |
Competitive FIB aggregation for independent prefixes: online ski rental on the trie
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Competitive throughput in multi-hop wireless networks despite adaptive jamming
Distributed Computing | 2013-08-26 | Paper |
Towards worst-case churn resistant peer-to-peer systems
Distributed Computing | 2013-06-28 | Paper |
Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
Theoretical Computer Science | 2012-10-11 | Paper |
Cost and complexity of harnessing games with payments
International Game Theory Review | 2012-09-04 | Paper |
Misleading stars: what cannot be measured in the internet?
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
Algorithmica | 2011-09-20 | Paper |
The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems
Internet Mathematics | 2011-01-31 | Paper |
A jamming-resistant MAC protocol for multi-hop wireless networks
Lecture Notes in Computer Science | 2010-09-10 | Paper |
| Tight bounds for delay-sensitive aggregation | 2010-07-27 | Paper |
Online function tracking with generalized penalties
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Towards network games with social preferences
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Event Extent Estimation
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Time complexity of distributed topological self-stabilization: the case of graph linearization
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
A self-stabilizing and local Delaunay graph construction
Algorithms and Computation | 2009-12-17 | Paper |
A Distributed and Oblivious Heap
Automata, Languages and Programming | 2009-07-14 | Paper |
Mechanism Design by Creditability
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Push-to-Pull Peer-to-Peer Live Streaming
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Distributed Disaster Disclosure
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Manipulation in Games
Algorithms and Computation | 2008-05-27 | Paper |
A highly flexible service composition framework for real-life networks
Computer Networks | 2006-10-10 | Paper |
| scientific article; zbMATH DE number 1964972 (Why is no real title available?) | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1893031 (Why is no real title available?) | 2003-04-06 | Paper |
