| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5875724 | 2023-02-03 | Paper |
| Restoration by path concatenation: fast recovery of MPLS paths | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633941 | 2019-05-06 | Paper |
| Stream Sampling Framework and Application for Frequency Cap Statistics | 2019-03-28 | Paper |
| On optimizing multiplications of sparse matrices | 2019-01-11 | Paper |
| On the Tradeoff between Stability and Fit | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351928 | 2017-08-31 | Paper |
| Exploiting regularities in Web traffic patterns for cache replacement | 2016-09-29 | Paper |
| Connection caching | 2016-09-29 | Paper |
| Polylog-time and near-linear work approximation scheme for undirected shortest paths | 2016-09-01 | Paper |
| Restoration by path concatenation | 2016-03-04 | Paper |
| Estimation for monotone sampling | 2015-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501785 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501848 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501254 | 2015-08-03 | Paper |
| Algorithms and estimators for summarization of unaggregated data streams | 2014-06-10 | Paper |
| Summarizing data using bottom-k sketches | 2014-03-13 | Paper |
| Scheduling Subset Tests: One-Time, Continuous, and How They Relate | 2013-10-04 | Paper |
| What You Can Do with Coordinated Samples | 2013-10-04 | Paper |
| Envy-Free Makespan Approximation | 2012-05-30 | Paper |
| Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums | 2012-02-11 | Paper |
| Labeling Dynamic XML Trees | 2010-11-04 | Paper |
| Optimal oblivious routing in polynomial time | 2010-08-16 | Paper |
| Processing top-\(k\) queries from samples | 2008-10-08 | Paper |
| Associative search in peer to peer networks: Harnessing latent semantics | 2007-04-26 | Paper |
| Spatially-decaying aggregation over a network | 2007-04-26 | Paper |
| Maintaining time-decaying stream aggregates | 2006-10-05 | Paper |
| A short walk in the blogistan | 2006-06-30 | Paper |
| Performance aspects of distributed caches using TTL-based consistency | 2005-04-06 | Paper |
| Balanced-Replication Algorithms for Distribution Trees | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829033 | 2004-11-29 | Paper |
| Optimal oblivious routing in polynomial time | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471366 | 2004-07-28 | Paper |
| Reachability and Distance Queries via 2-Hop Labels | 2003-09-28 | Paper |
| Connection caching: Model and algorithms. | 2003-08-19 | Paper |
| Proactive caching of DNS records: Addressing a performance bottleneck. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411367 | 2003-07-08 | Paper |
| Polylog-time and near-linear work approximation scheme for undirected shortest paths | 2003-06-25 | Paper |
| Competitive analysis of the LRFU paging algorithm | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778550 | 2002-11-18 | Paper |
| Exploiting regularities in web traffic patterns for cache replacement | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535061 | 2002-06-12 | Paper |
| Caching documents with variable sizes and fetching costs: an LP-based approach | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743984 | 2001-09-18 | Paper |
| All-Pairs Small-Stretch Paths | 2001-07-23 | Paper |
| Structure prediction and computation of sparse matrix products | 2001-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252388 | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228439 | 1999-07-05 | Paper |
| Approximating Matrix Multiplication for Pattern Recognition Tasks | 1999-03-30 | Paper |
| Fast Algorithms for Constructing t-Spanners and Paths with Stretch t | 1998-09-21 | Paper |
| Size-estimation framework with applications to transitive closure and reachability | 1998-08-04 | Paper |
| Using Selective Path-Doubling for Parallel Shortest-Path Computations | 1997-10-19 | Paper |
| Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition | 1997-03-03 | Paper |
| Approximate Max-Flow on Small Depth Networks | 1995-07-26 | Paper |
| Improved Algorithms For Linear Inequalities with Two Variables Per Inequality | 1995-04-06 | Paper |
| New algorithms for generalized network flows | 1994-10-10 | Paper |
| Algorithms and complexity analysis for some flow problems | 1994-09-11 | Paper |
| Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138946 | 1993-10-20 | Paper |
| NP-completeness of graph decomposition problems | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974963 | 1992-06-26 | Paper |
