| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147384 | 2024-01-15 | Paper |
| Finding the saddlepoint faster than sorting | 2023-10-25 | Paper |
| Fragile complexity of adaptive algorithms | 2023-03-22 | Paper |
| Formal language constrained path problems | 2022-12-09 | Paper |
| Fragile complexity of comparison-based algorithms | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075805 | 2022-05-11 | Paper |
| Fragile complexity of adaptive algorithms | 2022-05-10 | Paper |
| Cache oblivious sparse matrix multiplication | 2020-02-12 | Paper |
| Lower Bounds for Oblivious Data Structures | 2019-10-15 | Paper |
| A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm | 2016-05-26 | Paper |
| Fast Output-Sensitive Matrix Multiplication | 2015-11-19 | Paper |
| SKIP + | 2015-08-14 | Paper |
| Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids | 2015-06-10 | Paper |
| Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout | 2015-06-10 | Paper |
| A note on the parallel runtime of self-stabilizing graph linearization | 2015-02-05 | Paper |
| On the Complexity of List Ranking in the Parallel External Memory Model | 2014-10-14 | Paper |
| Treewidth Computation and Kernelization in the Parallel External Memory Model | 2014-09-15 | Paper |
| A distributed polylogarithmic time algorithm for self-stabilizing skip graphs | 2014-07-23 | Paper |
| Data Delivery by Energy-Constrained Mobile Agents on a Line | 2014-07-01 | Paper |
| Time-dependent networks as models to achieve fast exact time-table queries | 2013-09-09 | Paper |
| Tight Bounds for Low Dimensional Star Stencils in the External Memory Model | 2013-08-12 | Paper |
| Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs | 2012-10-11 | Paper |
| Multistage methods for freight train classification | 2012-09-28 | Paper |
| The Efficiency of MapReduce in Parallel External Memory | 2012-06-29 | Paper |
| Multistage methods for freight train classification | 2011-02-17 | Paper |
| Optimal sparse matrix dense vector multiplication in the I/O-model | 2010-12-17 | Paper |
| Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model | 2010-09-03 | Paper |
| Approximate shortest paths guided by a small index | 2010-05-28 | Paper |
| Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization | 2010-04-27 | Paper |
| The I/O Complexity of Sparse Matrix Dense Matrix Multiplication | 2010-04-27 | Paper |
| A self-stabilizing and local Delaunay graph construction | 2009-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396008 | 2009-09-15 | Paper |
| Sequential Vector Packing | 2009-03-03 | Paper |
| Approximate Shortest Paths Guided by a Small Index | 2009-02-17 | Paper |
| Sequential vector packing | 2009-01-08 | Paper |
| Optimal Randomized Comparison Based Algorithms for Collision | 2008-09-17 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| An algorithmic view on OVSF code assignment | 2007-04-26 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Network Analysis | 2005-11-11 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| A memetic algorithm to schedule planned maintenance for the national grid | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828913 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411352 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721968 | 2001-07-11 | Paper |
| Formal-Language-Constrained Path Problems | 2000-10-18 | Paper |
| An Optimal Randomized Algorithm for Finding the Saddlepoint | N/A | Paper |
