| Publication | Date of Publication | Type |
|---|
| On the spanning trees of weighted graphs | 2024-02-28 | Paper |
| A super-logarithmic lower bound for hypercubic sorting networks | 2019-04-29 | Paper |
| Fair on-line scheduling of a dynamic set of tasks on a single resource | 2016-05-26 | Paper |
| Proportionate progress | 2015-05-07 | Paper |
| Optimal cover time for a graph-based coupon collector process | 2014-02-03 | Paper |
| Concurrent maintenance of rings | 2013-06-20 | Paper |
| Efficient adaptive collect using randomization | 2013-06-07 | Paper |
| Competitive weighted matching in transversal matroids | 2012-04-26 | Paper |
| Maintaining the Ranch topology | 2012-03-07 | Paper |
| Buyer-supplier games: optimization over the core | 2011-02-21 | Paper |
| Approximation algorithms for hierarchical location problems | 2010-08-16 | Paper |
| Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines | 2008-08-28 | Paper |
| Competitive Weighted Matching in Transversal Matroids | 2008-08-28 | Paper |
| Online Compression Caching | 2008-07-15 | Paper |
| Buyer-Supplier Games: Optimization over the Core | 2008-02-20 | Paper |
| Online hierarchical cooperative caching | 2007-01-25 | Paper |
| Approximation algorithms for hierarchical location problems | 2006-06-30 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Active and Concurrent Topology Maintenance | 2005-08-17 | Paper |
| Optimal time bounds for approximate clustering | 2005-01-19 | Paper |
| The Online Median Problem | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230344 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234092 | 2001-08-28 | Paper |
| Placement Algorithms for Hierarchical Cooperative Caching | 2001-04-17 | Paper |
| A superlogarithmic lower bound for shuffle-unshuffle sorting networks | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231916 | 2000-04-26 | Paper |
| Accessing nearby copies of replicated objects in a distributed environment | 2000-01-25 | Paper |
| Analysis of a Local Search Heuristic for Facility Location Problems | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250157 | 1999-10-18 | Paper |
| Rapid convergence of a local load balancing algorithm for asynchronous rings | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252337 | 1999-06-17 | Paper |
| Hypercubic Sorting Networks | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128929 | 1997-10-05 | Paper |
| Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults | 1997-08-03 | Paper |
| Lower Bounds for Shellsort | 1997-06-04 | Paper |
| Proportionate progress: A notion of fairness in resource allocation | 1996-10-08 | Paper |
| A lower bound for sorting networks based on the shuffle permutation | 1994-10-30 | Paper |
| Deterministic sorting in nearly logarithmic time on the hypercube and related computers | 1994-07-27 | Paper |
| Pipelined parallel prefix computations, and sorting on a pipelined hypercube | 1993-06-29 | Paper |
| On the spanning trees of weighted graphs | 1993-03-10 | Paper |
