| Publication | Date of Publication | Type |
|---|
| Oblivious routing on node-capacitated and directed graphs | 2018-11-05 | Paper |
| Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks | 2016-09-01 | Paper |
| Scalable expanders: exploiting hierarchical random wiring | 2016-09-01 | Paper |
| Resource discovery in distributed networks | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501797 | 2015-08-14 | Paper |
| Correction: ``Basic network creation games | 2014-12-22 | Paper |
| Semi-oblivious routing: lower bounds | 2014-12-18 | Paper |
| Online client-server load balancing without global information | 2014-10-13 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2014-10-13 | Paper |
| Compression using efficient multicasting | 2014-09-26 | Paper |
| The Akamai approach to achieving performance and reliability on the Internet | 2014-03-13 | Paper |
| Basic network creation games | 2013-09-26 | Paper |
| Some results on greedy embeddings in metric spaces | 2010-11-08 | Paper |
| Consistent load balancing via spread minimization | 2010-08-16 | Paper |
| Hat Guessing Games | 2009-06-11 | Paper |
| Hat Guessing Games | 2009-05-27 | Paper |
| Localized Client-Server Load Balancing without Global Information | 2008-08-14 | Paper |
| On the Max-flow min-cut ratio for directed multicommodity flows | 2006-03-24 | Paper |
| Reconstructing a three-dimensional model with arbitrary errors | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418545 | 2003-08-10 | Paper |
| New algorithmic aspects of the local lemma with applications to routing and partitioning | 2002-04-23 | Paper |
| Compression using efficient multicasting | 2002-02-27 | Paper |
| Guessing secrets. (Extended abstract) | 2002-01-30 | Paper |
| Containment properties of product and power graphs | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234092 | 2001-08-28 | Paper |
| General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate) | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527033 | 2001-03-01 | Paper |
| Guessing secrets | 2001-02-19 | Paper |
| A $2d - 1$ Lower Bound for Two-Layer Knock-Knee Channel Routing | 2000-06-21 | Paper |
| The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian | 2000-06-04 | Paper |
| Automatic Methods for Hiding Latency in Parallel and Distributed Computation | 2000-03-19 | Paper |
| Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules | 2000-02-21 | Paper |
| Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults | 1999-10-28 | Paper |
| Tight Bounds for On-Line Tree Embeddings | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228507 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228500 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228478 | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230379 | 1999-04-22 | Paper |
| Greedy Dynamic Routing on Arrays | 1999-01-17 | Paper |
| On the design of reliable Boolean circuits that contain partially unreliable gates | 1998-08-04 | Paper |
| On probabilistic networks for selection, merging, and sorting | 1998-08-03 | Paper |
| Hypercubic Sorting Networks | 1998-05-10 | Paper |
| Nearly optimal algorithms and bounds for multilayer channel routing | 1998-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343436 | 1997-08-24 | Paper |
| Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults | 1997-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341772 | 1997-07-20 | Paper |
| Analysis of Backoff Protocols for Multiple Access Channels | 1997-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886091 | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866092 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886080 | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281637 | 1996-08-20 | Paper |
| Fast approximation algorithms for multicommodity flow problems | 1995-07-05 | Paper |
| Methods for message routing in parallel machines | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138971 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201938 | 1993-09-06 | Paper |
| A Tight Lower Bound on the Size of Planar Permutation Networks | 1993-04-01 | Paper |
| Generalized planar matching | 1990-01-01 | Paper |
| A tight lower bound for the train reversal problem | 1990-01-01 | Paper |
| Tight bounds for minimax grid matching with applications to the average case analysis of algorithms | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808295 | 1988-01-01 | Paper |
| Tight Bounds on the Complexity of Parallel Sorting | 1985-01-01 | Paper |
| Wafer-Scale Integration of Systolic Arrays | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341891 | 1983-01-01 | Paper |
