| Publication | Date of Publication | Type |
|---|
| The DAG visit approach for pebbling and I/O lower bounds | 2024-09-12 | Paper |
| Bounds and estimates on the average edit distance | 2024-04-19 | Paper |
| Lower bounds to processor-time tradeoffs under bounded-speed message propagation | 2022-12-16 | Paper |
| Language learning without overgeneralization | 2022-08-18 | Paper |
| The I/O complexity of Toom-Cook integer multiplication | 2019-10-15 | Paper |
| Merging and sorting networks with the topology of the omega network | 2018-09-14 | Paper |
| Network-Oblivious Algorithms | 2018-08-02 | Paper |
| The I/O complexity of Strassen's matrix multiplication with recomputation | 2017-09-22 | Paper |
| Algorithms for computing the static single assignment form | 2015-11-12 | Paper |
| On approximating the ideal random access machine by physical machines | 2015-11-11 | Paper |
| Optimal eviction policies for stochastic address traces | 2013-12-11 | Paper |
| Area-time tradeoffs for universal VLSI circuits | 2008-12-12 | Paper |
| The role of terminal cost/reward in finite-horizon discrete-time LQ optimal control | 2007-08-27 | Paper |
| On stalling in LogP | 2005-06-30 | Paper |
| A frontal solver tuned for fully coupled non-linear hygro-thermo-mechanical problems | 2004-02-03 | Paper |
| On bufferless routing of variable length messages in leveled networks | 2003-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788551 | 2003-01-29 | Paper |
| Tight bounds on parallel list marking | 2002-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766669 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535796 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536926 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779599 | 2002-04-15 | Paper |
| BSP versus LogP | 2000-09-05 | Paper |
| A lower bound for area-universal graphs | 2000-08-02 | Paper |
| Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds | 2000-02-02 | Paper |
| Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds | 1998-05-25 | Paper |
| Deterministic on-line routing on area-universal networks | 1998-01-28 | Paper |
| Language learning without overgeneralization | 1997-02-28 | Paper |
| Horizons of parallel computation | 1996-02-26 | Paper |
| Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks | 1994-06-16 | Paper |
| On uniform learnability of language families | 1993-01-04 | Paper |
| Memory requirements of first-order digital filters | 1992-10-06 | Paper |
| Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size | 1990-01-01 | Paper |
| Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines | 1989-01-01 | Paper |
| Size-time complexity of Boolean networks for prefix computations | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733406 | 1989-01-01 | Paper |
| Area-time lower-bound techniques with applications to sorting | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727878 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687730 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3675517 | 1985-01-01 | Paper |
| A Minimum Area VLSI Network for O(log n) Time Sorting | 1985-01-01 | Paper |
| Mean value of the output of a discrete-time Volterra system driven by a Markov chain (Corresp.) | 1985-01-01 | Paper |
| An Architecture for Bitonic Sorting with Optimal VLSI Performnance | 1984-01-01 | Paper |
| Permutation-exchange graphs that emulate the binary cube | 1984-01-01 | Paper |
| Spectral Analysis of Functions of Markov Chains with Applications | 1983-01-01 | Paper |
| Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance | N/A | Paper |
