| Publication | Date of Publication | Type |
|---|
| A parallel algorithm for channel routing | 2024-02-28 | Paper |
| Extending the Hong-Kung model to memory hierarchies | 2023-12-12 | Paper |
| Generalized scans and tri-diagonal systems | 2017-12-04 | Paper |
| Analysis of Mask-Based Nanowire Decoders | 2017-11-10 | Paper |
| Cache-optimal algorithms for option pricing | 2017-05-19 | Paper |
| Upper and lower I/O bounds for pebbling \(r\)-pyramids | 2012-09-13 | Paper |
| Strong I/O Lower Bounds for Binomial and FFT Computation Graphs | 2011-08-17 | Paper |
| Upper and Lower I/O Bounds for Pebbling r-Pyramids | 2011-05-19 | Paper |
| Nanowire addressing with randomized-contact decoders | 2008-12-12 | Paper |
| Efficient data storage in large nanoarrays | 2006-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437492 | 2003-12-02 | Paper |
| Generalized scans and tridiagonal systems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344138 | 1997-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139386 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038712 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793690 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711762 | 1985-01-01 | Paper |
| The performance of multilective VLSI algorithms | 1984-01-01 | Paper |
| Space-Time Trade-Offs for Banded Matrix Problems | 1984-01-01 | Paper |
| Size-space tradeoffs for oblivious computations | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313787 | 1983-01-01 | Paper |
| Space-time tradeoffs for linear recursion | 1983-01-01 | Paper |
| Extreme time-space tradeoffs for graphs with small space requirements | 1982-01-01 | Paper |
| Area-time tradeoffs for matrix multiplication and related problems in VLSI models | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190139 | 1979-01-01 | Paper |
| Lower Bounds on Synchronous Combinational Complexity | 1979-01-01 | Paper |
| Space-time trade-offs on the FFT algorithm | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138141 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4172915 | 1976-01-01 | Paper |
| A class of Boolean functions with linear combinational complexity | 1975-01-01 | Paper |
| Sorting X + Y | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132405 | 1975-01-01 | Paper |
| An Algorithm for the Computation of Linear Forms | 1974-01-01 | Paper |
| Signal detection in the presence of multiple-access noise | 1974-01-01 | Paper |
| On the complexity of the marriage problem | 1972-01-01 | Paper |
| Computational Work and Time on Finite Machines | 1972-01-01 | Paper |
| The complexity of decoders--II: Computational work and decoding time | 1971-01-01 | Paper |
| A note on the performance of concatenated codes (Corresp.) | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773296 | 1969-01-01 | Paper |
| Minimum distance estimates of the performance of sequential decoders | 1969-01-01 | Paper |
| Complexity of decoders--I: Classes of decoding rules | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5582803 | 1968-01-01 | Paper |
| Some Simple Self-Synchronizing Digital Data Scramblers | 1967-01-01 | Paper |
| Sequential Decoding - The Computation Problem* | 1966-01-01 | Paper |
| Sequential Decoding - The Computation Problem* | 1966-01-01 | Paper |
