| Publication | Date of Publication | Type |
|---|
| Optimal Synchronous Approximate Agreement with Asynchronous Fallback | 2024-03-26 | Paper |
| The impact of core constraints on truthful bidding in combinatorial auctions | 2024-03-15 | Paper |
| \textsc{FnF-BFT}: a BFT protocol with provable performance under attack | 2024-01-11 | Paper |
| Divide \& Scale: formalization and roadmap to robust sharding | 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 | 2023-08-08 | Paper |
| Consensus on demand | 2023-06-12 | Paper |
| Better incentives for proof-of-work | 2023-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875606 | 2023-02-03 | Paper |
| Space complexity of streaming algorithms on universal quantum computers | 2022-12-22 | Paper |
| A tight lower bound for semi-synchronous collaborative grid exploration | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091006 | 2022-07-21 | Paper |
| Impatient Online Matching | 2022-07-21 | Paper |
| Stabilization Time in Weighted Minority Processes | 2022-07-18 | Paper |
| Default ambiguity: finding the best solution to the clearing problem | 2022-07-06 | Paper |
| \textsc{Brick}: asynchronous incentive-compatible payment channels | 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 | 2021-03-15 | Paper |
| Ride the lightning: the game theory of payment channels | 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 | 2021-01-22 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-09-03 | Paper |
| Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs | 2020-09-03 | Paper |
| piChain: When a Blockchain meets Paxos | 2020-07-30 | Paper |
| Byzantine preferential voting | 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 | 2020-02-13 | Paper |
| Fast size approximation of a radio network in beeping model | 2020-02-06 | Paper |
| Approximating small balanced vertex separators in almost linear time | 2019-09-10 | Paper |
| The Power of Non-Uniform Wireless Power | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743466 | 2019-05-10 | Paper |
| Randomness vs. time in anonymous networks | 2018-08-24 | Paper |
| Local Computation | 2018-08-02 | Paper |
| Distributed stable matching with similar preference lists | 2018-07-18 | Paper |
| Wireless evacuation on \(m\) rays with \(k\) searchers | 2018-04-12 | Paper |
| Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs | 2017-12-20 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| An inherent bottleneck in distributed counting | 2017-09-29 | Paper |
| Online matching: haste makes waste! | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363800 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363813 | 2017-09-29 | Paper |
| Approximating small balanced vertex separators in almost linear time | 2017-09-22 | Paper |
| Collaboration Without Communication: Evacuating Two Robots from a Disk | 2017-07-21 | Paper |
| The Power of Oblivious Wireless Power | 2017-06-28 | Paper |
| Deterministic multi-channel information exchange | 2017-05-24 | Paper |
| Approximating the Size of a Radio Network in Beeping Model | 2016-12-01 | Paper |
| Lower and upper competitive bounds for online directed graph exploration | 2016-11-29 | Paper |
| Clairvoyant Mechanisms for Online Auctions | 2016-09-02 | Paper |
| Tight bounds for parallel randomized load balancing | 2016-05-23 | Paper |
| Competitive concurrent distributed queuing | 2016-03-04 | Paper |
| Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks | 2016-03-04 | Paper |
| On competitive recommendations | 2016-02-26 | Paper |
| Toehold DNA Languages are Regular (Extended Abstract) | 2016-01-11 | Paper |
| Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond | 2016-01-08 | Paper |
| How many ants does it take to find the food? | 2015-12-11 | Paper |
| The Price of Matching with Metric Preferences | 2015-11-19 | Paper |
| Ignorant vs. Anonymous Recommendations | 2015-11-19 | Paper |
| MIS on trees | 2015-09-11 | Paper |
| Constant-time distributed dominating set approximation | 2015-09-04 | Paper |
| Geometric ad-hoc routing | 2015-09-04 | Paper |
| Anonymous networks | 2015-09-03 | Paper |
| What cannot be computed locally! | 2015-08-03 | Paper |
| On the locality of bounded growth | 2015-03-10 | Paper |
| Facility location | 2015-03-10 | Paper |
| Maximal independent sets in radio networks | 2015-03-10 | Paper |
| Efficient multi-word locking using randomization | 2015-03-10 | Paper |
| On the complexity of distributed graph coloring | 2015-03-10 | Paper |
| When selfish meets evil | 2015-03-10 | Paper |
| On the topologies formed by selfish peers | 2015-03-10 | Paper |
| Stone age distributed computing | 2015-03-02 | Paper |
| Tight bounds for delay-sensitive aggregation | 2014-12-12 | Paper |
| Optimal distributed all pairs shortest paths and applications | 2014-12-05 | Paper |
| Convergence in (Social) Influence Networks | 2014-09-29 | Paper |
| Hard-Potato routing | 2014-09-26 | Paper |
| Distributed Approximation of Minimum Routing Cost Trees | 2014-08-07 | Paper |
| How Many Ants Does It Take to Find the Food? | 2014-08-07 | Paper |
| Tight bounds for clock synchronization | 2014-07-23 | Paper |
| Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs | 2014-07-01 | Paper |
| Solving the ANTS Problem with Asynchronous Finite State Machines | 2014-07-01 | Paper |
| Tight bounds for parallel randomized load balancing | 2014-06-05 | Paper |
| Distributed verification and hardness of distributed approximation | 2014-06-05 | Paper |
| On Competitive Recommendations | 2013-11-06 | Paper |
| Distributed minimum dominating set approximations in restricted families of graphs | 2013-08-26 | Paper |
| Towards worst-case churn resistant peer-to-peer systems | 2013-06-28 | Paper |
| Coloring unstructured radio networks | 2013-06-28 | Paper |
| Constant-time distributed dominating set approximation | 2013-06-07 | Paper |
| Distributed Verification and Hardness of Distributed Approximation | 2013-02-04 | Paper |
| Monitoring churn in wireless networks | 2012-10-11 | Paper |
| COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS | 2012-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2889027 | 2012-06-04 | Paper |
| Topological implications of selfish neighbor selection in unstructured peer-to-peer networks | 2011-09-20 | Paper |
| Good programming in transactional memory: game theory meets multicore architecture | 2011-07-27 | Paper |
| The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems | 2011-01-31 | Paper |
| Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model | 2011-01-24 | Paper |
| Minimum Dominating Set Approximation in Graphs of Bounded Arboricity | 2010-09-10 | Paper |
| The price of being near-sighted | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575468 | 2010-07-27 | Paper |
| Tight bounds for clock synchronization | 2010-07-14 | Paper |
| Good Programming in Transactional Memory | 2009-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396596 | 2009-09-19 | Paper |
| Wireless Communication Is in APX | 2009-07-14 | Paper |
| Mechanism Design by Creditability | 2009-03-03 | Paper |
| Leveraging Linial’s Locality Limit | 2008-11-20 | Paper |
| Oblivious Gradient Clock Synchronization | 2008-09-09 | Paper |
| Push-to-Pull Peer-to-Peer Live Streaming | 2008-09-02 | Paper |
| Distributed Disaster Disclosure | 2008-07-15 | Paper |
| Word of Mouth: Rumor Dissemination in Social Networks | 2008-07-10 | Paper |
| Manipulation in Games | 2008-05-27 | Paper |
| Fast and Simple Algorithms for Weighted Perfect Matching | 2007-05-29 | Paper |
| Dynamic analysis of the arrow distributed protocol | 2007-01-25 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Theoretical aspects of connectivity-based multi-hop positioning | 2005-12-05 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Efficient Adaptive Collect Using Randomization | 2005-08-17 | Paper |
| Distributed Weighted Matching | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673403 | 2005-04-29 | Paper |
| The counting pyramid: an adaptive distributed counting scheme | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436040 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796187 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952652 | 2000-05-10 | Paper |
| An inherent bottleneck in distributed counting | 1998-08-20 | Paper |
