| Publication | Date of Publication | Type |
|---|
| Efficient Iterations for Algebraic Numbers | 2021-07-06 | Paper |
| On nearest-neighbor graphs | 2019-12-04 | Paper |
| Optimal layout of edge-weighted forests | 1999-07-06 | Paper |
| Shallow circuits and concise formulae for multiple addition and multiplication | 1994-11-29 | Paper |
| Fishspear: a priority queue algorithm | 1994-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138883 | 1994-01-02 | Paper |
| The memory game | 1993-08-30 | Paper |
| Shrinkage of de Morgan formulae under restriction | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036708 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4003861 | 1992-09-18 | Paper |
| Optimal binary space partitions for orthogonal objects | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211252 | 1991-01-01 | Paper |
| Efficient binary space partitions for hidden-surface removal and solid modeling | 1990-01-01 | Paper |
| Computing Euclidean maximum spanning trees | 1990-01-01 | Paper |
| Partitioning Space for Range Queries | 1989-01-01 | Paper |
| Point retrieval for polygons | 1986-01-01 | Paper |
| Impossibility of distributed consensus with one faulty process | 1985-01-01 | Paper |
| On log concavity for order-preserving maps of partial orders | 1984-01-01 | Paper |
| Storage requirements for fair scheduling | 1983-01-01 | Paper |
| $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas | 1982-01-01 | Paper |
| Efficient parallel algorithms for linear recurrence computation | 1982-01-01 | Paper |
| Optimal packing and covering in the plane are NP-complete | 1981-01-01 | Paper |
| Propositional dynamic logic is weaker without tests | 1981-01-01 | Paper |
| A faster algorithm computing string edit distances | 1980-01-01 | Paper |
| Selection and sorting with limited storage | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4173431 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194459 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195945 | 1977-01-01 | Paper |
| Circuit size is nonlinear in depth | 1976-01-01 | Paper |
| Finding the median | 1976-01-01 | Paper |
| Completely Autoreducible Degrees | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4119126 | 1976-01-01 | Paper |
| Complexity of monotone networks for Boolean matrix product | 1975-01-01 | Paper |
| Deterministic one-counter automata | 1975-01-01 | Paper |
| Reversal-Bounded Acceptors and Intersections of Linear Languages | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4161258 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055156 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055196 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4135013 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777266 | 1974-01-01 | Paper |
| On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials | 1973-01-01 | Paper |
| Optimal algorithms for parallel polynomial evaluation | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109594 | 1973-01-01 | Paper |
| Tape bounds for time-bounded Turing machines | 1972-01-01 | Paper |
| Unsolvability in 3 × 3 Matrices | 1970-01-01 | Paper |
