| Publication | Date of Publication | Type |
|---|
| Lockless blockchain sharding with multiversion control | 2024-01-11 | Paper |
| Flexible scheduling of transactional memory on trees | 2023-10-12 | Paper |
| Load balanced distributed directories | 2023-08-02 | Paper |
| Flexible scheduling of transactional memory on trees | 2023-06-12 | Paper |
| Load balanced distributed directories | 2022-05-17 | Paper |
| Dynamic scheduling in distributed transactional memory | 2022-04-01 | Paper |
| Time-communication impossibility results for distributed transactional memory | 2022-02-15 | Paper |
| Fast scheduling in distributed transactional memory | 2021-06-24 | Paper |
| Complete visibility for robots with lights in \(\mathrm{O}(1)\) time | 2019-11-22 | Paper |
| Optimal nearest neighbor queries in sensor networks | 2018-10-17 | Paper |
| The Bursty Steiner Tree Problem | 2018-05-14 | Paper |
| Distributed Queuing in Dynamic Networks | 2017-12-15 | Paper |
| Optimal Oblivious Path Selection on the Mesh | 2017-11-10 | Paper |
| A combinatorial treatment of balancing networks | 2017-09-29 | Paper |
| Approximating Congestion + Dilation in Networks via "Quality of Routing” Games | 2017-07-12 | Paper |
| An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs | 2017-07-12 | Paper |
| Impossibility results for weak threshold networks | 2016-05-26 | Paper |
| Impossibility results for distributed transactional memory | 2016-03-23 | Paper |
| Efficient transformations for Klee's measure problem in the streaming model | 2016-01-15 | Paper |
| Optimal nearest neighbor queries in sensor networks | 2015-12-11 | Paper |
| An analysis framework for distributed hierarchical directories | 2015-05-26 | Paper |
| Sketching asynchronous streams over a sliding window | 2015-03-10 | Paper |
| Distributed transactional memory for general networks | 2015-02-23 | Paper |
| Hard-Potato routing | 2014-09-26 | Paper |
| Sparse covers for planar graphs and graphs that exclude a fixed minor | 2014-07-03 | Paper |
| Improved sparse covers for graphs excluding a fixed minor | 2014-03-13 | Paper |
| Contention-free MAC protocols for asynchronous wireless sensor networks | 2013-06-28 | Paper |
| Sketching asynchronous data streams over sliding windows | 2013-06-20 | Paper |
| Window-based greedy contention management for transactional memory: theory and practice | 2013-02-04 | Paper |
| Stretch in Bottleneck Games | 2012-09-25 | Paper |
| A competitive analysis for balanced transactional memory workloads | 2012-04-26 | Paper |
| Oblivious Routing for Sensor Network Topologies | 2011-04-05 | Paper |
| Oblivious Buy-at-Bulk in Planar Graphs | 2011-02-20 | Paper |
| Concurrent counting is harder than queuing | 2010-11-11 | Paper |
| Bottleneck Congestion Games with Logarithmic Price of Anarchy | 2010-10-19 | Paper |
| Window-Based Greedy Contention Management for Transactional Memory | 2010-09-10 | Paper |
| An efficient counting network | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396596 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396550 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396559 | 2009-09-19 | Paper |
| Atomic routing games on maximum congestion | 2009-08-21 | Paper |
| Universal Bufferless Packet Switching | 2008-08-14 | Paper |
| Atomic Routing Games on Maximum Congestion | 2008-01-04 | Paper |
| Efficient bufferless packet switching on trees and leveled networks | 2007-10-24 | Paper |
| A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window | 2007-09-03 | Paper |
| Direct routing: Algorithms and complexity | 2007-06-21 | Paper |
| Analysis of Link Reversal Routing Algorithms | 2006-06-01 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Contention-Free MAC Protocols for Wireless Sensor Networks | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668734 | 2005-04-15 | Paper |
| The cost of concurrent, low-contention Read \& Modify \& Write | 2005-04-06 | Paper |
| \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks | 2005-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418684 | 2003-08-11 | Paper |
| Sorting and counting networks of arbitrary width and small depth | 2002-06-27 | Paper |
| Threshold counters with increments and decrements | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503829 | 2001-09-04 | Paper |
| Supporting increment and decrement operations in balancing networks | 2001-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952652 | 2000-05-10 | Paper |
| A combinatorial treatment of balancing networks | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859226 | 1996-11-04 | Paper |
