| Publication | Date of Publication | Type |
|---|
| Conservative algorithms for parallel and sequential integer sorting | 2023-12-12 | Paper |
| More Efficient Parallel Integer Sorting | 2023-08-15 | Paper |
| On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs | 2022-11-17 | Paper |
| Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space | 2020-02-28 | Paper |
| Optimal parallel selection | 2018-11-05 | Paper |
| An optimal linked list prefix algorithm on a local memory computer | 2018-09-14 | Paper |
| Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus | 2018-07-09 | Paper |
| Algorithms for testing occurrences of length 4 patterns in permutations | 2018-02-21 | Paper |
| Construct a perfect word hash function in time independent of the size of integers | 2017-09-19 | Paper |
| An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths | 2016-12-09 | Paper |
| A Linear Time Algorithm for Ordered Partition | 2015-11-12 | Paper |
| Algorithms for Testing Length Four Permutations | 2014-04-03 | Paper |
| Erratum to: Tight bound for matching | 2013-08-02 | Paper |
| An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths | 2012-08-14 | Paper |
| More Efficient Parallel Integer Sorting | 2012-07-16 | Paper |
| Tight bound for matching | 2012-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2885618 | 2012-06-01 | Paper |
| An efficient parallel algorithm for building the separating tree | 2012-03-07 | Paper |
| Deterministic sorting in O ( n log log n ) time and linear space | 2010-08-05 | Paper |
| A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths | 2010-03-24 | Paper |
| Improved algorithm for the symmetry number problem on trees | 2010-01-18 | Paper |
| An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path | 2008-07-01 | Paper |
| Matching for Graphs of Bounded Degree | 2008-06-19 | Paper |
| An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths | 2008-03-11 | Paper |
| Distribution of path durations in mobile ad-hoc networks -- Palm's theorem to the rescue | 2006-08-16 | Paper |
| Deterministic sorting in O(nloglogn) time and linear space | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471267 | 2004-07-28 | Paper |
| Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation | 2003-06-25 | Paper |
| Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers | 2003-05-08 | Paper |
| Improving the efficiency of parallel minimum spanning tree algorithms | 2003-03-09 | Paper |
| Improved fast integer sorting in linear space | 2003-01-14 | Paper |
| Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768383 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728853 | 2001-11-01 | Paper |
| Very fast parallel algorithms for approximate edge coloring | 2001-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252316 | 2000-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937213 | 2000-02-03 | Paper |
| Parallel PROFIT/COST algorithms through fast derandomization | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252292 | 1999-06-17 | Paper |
| Efficient parallel algorithms for computing all pair shortest paths in directed graphs | 1997-08-20 | Paper |
| An improvement on parallel computation of a maximal matching | 1997-02-28 | Paper |
| SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS | 1997-01-13 | Paper |
| A Fast Derandomization Scheme and Its Applications | 1996-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201931 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037417 | 1993-05-18 | Paper |
| Indexing functions and time lower bounds for sorting on a mesh-connected computer | 1992-09-27 | Paper |
| Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays | 1990-01-01 | Paper |
| An efficient and fast parallel-connected component algorithm | 1990-01-01 | Paper |
| Time lower bounds for parallel sorting on a mesh-connected processor array | 1989-01-01 | Paper |
