| Publication | Date of Publication | Type |
|---|
| Lower bounds to processor-time tradeoffs under bounded-speed message propagation | 2022-12-16 | Paper |
| Output-sensitive generation of the perspective view of isothetic parallelepipeds | 2022-12-09 | Paper |
| Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) | 2022-08-19 | Paper |
| A simplified technique for hidden-line elimination in terrains | 2022-08-18 | Paper |
| On the boundary of a union of Rays | 2022-08-16 | Paper |
| Dynamic planar point location with optimal query time | 2022-08-16 | Paper |
| Generalized scans and tri-diagonal systems | 2017-12-04 | Paper |
| Steps Toward Unraveling a Vatican Cipher of the 1930s | 2012-10-16 | Paper |
| Accurate and precise aggregation counting | 2012-05-11 | Paper |
| ON THE REPRESENTATION OF THE POWERS OF INTEGERS IN ANY PRIME BASE | 2012-03-22 | Paper |
| Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction | 2009-11-12 | Paper |
| The unpredictable deviousness of models | 2008-12-12 | Paper |
| Beware of the Model: Reflections on Algorithmic Research | 2007-05-02 | Paper |
| Culling a Set of Points for Roundness or Cylindricity Evaluations | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410152 | 2003-07-02 | Paper |
| Circular cylinders through four or five points in space | 2003-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551348 | 2002-09-05 | Paper |
| Generalized scans and tridiagonal systems | 2001-08-20 | Paper |
| The role of arithmetic in fast parallel matrix inversion | 2001-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952661 | 2000-05-10 | Paper |
| Robust Plane Sweep for Intersecting Segments | 2000-03-19 | Paper |
| Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds | 2000-02-02 | Paper |
| Further results on arithmetic filters for geometric predicates | 1999-11-23 | Paper |
| A probabilistic analysis of the power of arithmetic filters | 1999-05-18 | Paper |
| Checking the convexity of polytopes and the planarity of subdivisions | 1999-04-11 | Paper |
| Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design | 1999-02-22 | Paper |
| Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds | 1998-05-25 | Paper |
| Practical constructive schemes for deterministic shared-memory access | 1997-09-07 | Paper |
| Evaluating signs of determinants using single-precision arithmetic | 1997-06-30 | Paper |
| A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps | 1996-07-02 | Paper |
| Data structures and algorithms for the string statistics problem | 1996-05-27 | Paper |
| A time-optimal parallel algorithm for three-dimensional convex hulls | 1996-03-11 | Paper |
| MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM | 1996-02-26 | Paper |
| Horizons of parallel computation | 1996-02-26 | Paper |
| Work-Preserving Speed-Up of Parallel Matrix Computations | 1995-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327513 | 1995-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281513 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140400 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139120 | 1993-12-07 | Paper |
| A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028870 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992847 | 1993-01-23 | Paper |
| THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED | 1993-01-16 | Paper |
| Memory requirements of first-order digital filters | 1992-10-06 | Paper |
| Output-sensitive generation of the perspective view of isothetic parallelepipeds | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002851 | 1992-09-18 | Paper |
| Parallel restructuring and evaluation of expressions | 1992-06-28 | Paper |
| Efficient Point Location in a Convex Spatial Cell-Complex | 1992-06-28 | Paper |
| COMPUTING THE UNION OF 3-COLORED TRIANGLES | 1992-06-27 | Paper |
| Inverting a Vandermonde matrix in minimum parallel time | 1992-06-26 | Paper |
| Deterministic P-RAM simulation with constant redundancy | 1991-01-01 | Paper |
| An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum | 1991-01-01 | Paper |
| Dynamic maintenance of planar digraphs, with applications | 1990-01-01 | Paper |
| An optimal algorithm for the boundary of a cell in a union of rays | 1990-01-01 | Paper |
| Dynamic planar point location with optimal query time | 1990-01-01 | Paper |
| Tetrahedrizing point sets in three dimensions | 1990-01-01 | Paper |
| PLANAR POINT LOCATION REVISITED | 1990-01-01 | Paper |
| Computation of the axial view of a set of isothetic parallelepipeds | 1990-01-01 | Paper |
| Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size | 1990-01-01 | Paper |
| Size-time complexity of Boolean networks for prefix computations | 1989-01-01 | Paper |
| Fully Dynamic Point Location in a Monotone Subdivision | 1989-01-01 | Paper |
| Minimum polygonal separation | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817602 | 1988-01-01 | Paper |
| Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) | 1987-01-01 | Paper |
| A unified approach to layout wirability | 1987-01-01 | Paper |
| Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727434 | 1986-01-01 | Paper |
| Halfspace range search: An algorithmic application of k-sets | 1986-01-01 | Paper |
| Area-time lower-bound techniques with applications to sorting | 1986-01-01 | Paper |
| Channel routing in knock-knee mode: Simplified algorithms and proofs | 1986-01-01 | Paper |
| New upper bounds for neighbor searching | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727878 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730020 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184826 | 1985-01-01 | Paper |
| Structural properties of the string statistics problem | 1985-01-01 | Paper |
| A Minimum Area VLSI Network for O(log n) Time Sorting | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677669 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687730 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3694703 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219764 | 1984-01-01 | Paper |
| An Architecture for Bitonic Sorting with Optimal VLSI Performnance | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679818 | 1984-01-01 | Paper |
| Optimal Three-Layer Channel Routing | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3720478 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3723713 | 1984-01-01 | Paper |
| Optimal three-dimensional VLSI layouts | 1983-01-01 | Paper |
| Optimal off-line detection of repetitions in a string | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3319342 | 1983-01-01 | Paper |
| Area—Time optimal VLSI integer multiplier with minimum computation time | 1983-01-01 | Paper |
| Area—Time Optimal VLSI Circuits for Convolution | 1983-01-01 | Paper |
| Corrigendum | 1982-01-01 | Paper |
| Stabbing line segments | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659137 | 1982-01-01 | Paper |
| Approximation algorithms for convex hulls | 1982-01-01 | Paper |
| Plane-sweep algorithms for intersecting geometric figures | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969895 | 1982-01-01 | Paper |
| Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems | 1981-01-01 | Paper |
| A New Approach to Planar Point Location | 1981-01-01 | Paper |
| Segments, rectangles, contours | 1981-01-01 | Paper |
| Finding the contour of a union of iso-oriented rectangies | 1980-01-01 | Paper |
| Finding the contour of a union of iso-oriented rectangies | 1980-01-01 | Paper |
| Area-time optimal VLSI networks for multiplying matrices | 1980-01-01 | Paper |
| An optimal real-time algorithm for planar convex hulls | 1979-01-01 | Paper |
| Finding the intersection of n half-spaces in time O(n log n) | 1979-01-01 | Paper |
| A Note on Locating a Set of Points in a Planar Subdivision | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3891762 | 1979-01-01 | Paper |
| New Parallel-Sorting Schemes | 1978-01-01 | Paper |
| The densest hemisphere problem | 1978-01-01 | Paper |
| An improved parallel processor bound in fast matrix inversion | 1978-01-01 | Paper |
| Triangulating a simple polygon | 1978-01-01 | Paper |
| Improved time and space bounds for Boolean matrix multiplication | 1978-01-01 | Paper |
| Finding the intersection of two convex polyhedra | 1978-01-01 | Paper |
| Spectrum Shaping with Alphabetic Codes with Finite Autocorrelation Sequence | 1978-01-01 | Paper |
| Corrigendum: A fast stable sorting algorithm with absolutely minimum storage | 1977-01-01 | Paper |
| Convex hulls of finite sets of points in two and three dimensions | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134504 | 1977-01-01 | Paper |
| Reduction of Depth of Boolean Networks with a Fan-In Constraint | 1977-01-01 | Paper |
| Computational Complexity of Fourier Transforms Over Finite Fields | 1977-01-01 | Paper |
| Efficient Parallel Evaluation of Boolean Expressions | 1976-01-01 | Paper |
| Restructuring of Arithmetic Expressions For Parallel Evaluation | 1976-01-01 | Paper |
| On Permutation-Embedding Sequences | 1976-01-01 | Paper |
| A fast stable sorting algorithm with absolutely minimum storage | 1975-01-01 | Paper |
| The time required to evaluate division-free arithmetic expressions | 1975-01-01 | Paper |
| Bounds to Complexities of Networks for Sorting and for Switching | 1975-01-01 | Paper |
| Difference-preserving codes | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4403699 | 1973-01-01 | Paper |
| Universal Logic Modules of a New Type | 1972-01-01 | Paper |
| An approach to artificial nonsymbolic cognition | 1972-01-01 | Paper |
| Continuously valued logic | 1972-01-01 | Paper |
| On the Delay Required to Realize Boolean Functions | 1971-01-01 | Paper |
| Some results in the theory of arithmetic codes | 1971-01-01 | Paper |
| On the Design of Universal Boolean Functions | 1971-01-01 | Paper |
| On the Representation of Integers in Nonadjacent Form | 1971-01-01 | Paper |
| A new look at the Golay (23, 12) code (Corresp.) | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5617448 | 1970-01-01 | Paper |
| Generation of near-optimal universal Boolean functions | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773306 | 1969-01-01 | Paper |
| A class of optimum nonlinear double-error-correcting codes | 1968-01-01 | Paper |
| Weight and distance structure of Nordstrom-Robinson quadratic code | 1968-01-01 | Paper |
| Convolutional Transformation and Recovery of Binary Sequences | 1968-01-01 | Paper |
| Optimization of Reduced Dependencies for Synchronous Sequential Machines | 1967-01-01 | Paper |
| On the Realizability of Special Classes of Autonomous Sequential Networks | 1965-01-01 | Paper |
| Traffic analysis of a buffered digital data acquisition system | 1965-01-01 | Paper |
| State-Logic Relations for Autonomous Sequential Networks | 1964-01-01 | Paper |
| Systematic construction of optimal linear recurrent codes for burst error correction | 1964-01-01 | Paper |
