| Publication | Date of Publication | Type |
|---|
| Robustness in geometric algorithms | 2024-06-21 | Paper |
Lower bounds to processor-time tradeoffs under bounded-speed message propagation
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Output-sensitive generation of the perspective view of isothetic parallelepipeds
SWAT 90 | 2022-12-09 | Paper |
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
Lecture Notes in Computer Science | 2022-08-19 | Paper |
A simplified technique for hidden-line elimination in terrains
STACS 92 | 2022-08-18 | Paper |
Dynamic planar point location with optimal query time (extended abstract)
STACS 89 | 2022-08-16 | Paper |
On the boundary of a union of Rays
STACS 89 | 2022-08-16 | Paper |
Generalized scans and tri-diagonal systems
STACS 95 | 2017-12-04 | Paper |
Steps toward unraveling a Vatican cipher of the 1930s
Cryptologia | 2012-10-16 | Paper |
Accurate and precise aggregation counting
Journal of Computer and System Sciences | 2012-05-11 | Paper |
On the representation of the powers of integers in any prime base
International Journal of Number Theory | 2012-03-22 | Paper |
Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction
Lecture Notes in Computer Science | 2009-11-12 | Paper |
The unpredictable deviousness of models
Theoretical Computer Science | 2008-12-12 | Paper |
Beware of the Model: Reflections on Algorithmic Research
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Culling a Set of Points for Roundness or Cylindricity Evaluations
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 1945178 (Why is no real title available?) | 2003-07-02 | Paper |
Circular cylinders through four or five points in space
Discrete & Computational Geometry | 2003-03-17 | Paper |
| scientific article; zbMATH DE number 1796954 (Why is no real title available?) | 2002-09-05 | Paper |
Generalized scans and tridiagonal systems
Theoretical Computer Science | 2001-08-20 | Paper |
The role of arithmetic in fast parallel matrix inversion
Algorithmica | 2001-08-09 | Paper |
| scientific article; zbMATH DE number 1445344 (Why is no real title available?) | 2000-05-10 | Paper |
Robust Plane Sweep for Intersecting Segments
SIAM Journal on Computing | 2000-03-19 | Paper |
Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds
Theory of Computing Systems | 2000-02-02 | Paper |
Further results on arithmetic filters for geometric predicates
Computational Geometry | 1999-11-23 | Paper |
A probabilistic analysis of the power of arithmetic filters
Discrete & Computational Geometry | 1999-05-18 | Paper |
Checking the convexity of polytopes and the planarity of subdivisions
Computational Geometry | 1999-04-11 | Paper |
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
SIAM Journal on Computing | 1999-02-22 | Paper |
Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds
Theory of Computing Systems | 1998-05-25 | Paper |
Practical constructive schemes for deterministic shared-memory access
Theory of Computing Systems | 1997-09-07 | Paper |
Evaluating signs of determinants using single-precision arithmetic
Algorithmica | 1997-06-30 | Paper |
A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
SIAM Journal on Computing | 1996-07-02 | Paper |
Data structures and algorithms for the string statistics problem
Algorithmica | 1996-05-27 | Paper |
A time-optimal parallel algorithm for three-dimensional convex hulls
Algorithmica | 1996-03-11 | Paper |
Horizons of parallel computation
Journal of Parallel and Distributed Computing | 1996-02-26 | Paper |
MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM
International Journal of Computational Geometry & Applications | 1996-02-26 | Paper |
Work-Preserving Speed-Up of Parallel Matrix Computations
SIAM Journal on Computing | 1995-11-01 | Paper |
| scientific article; zbMATH DE number 741169 (Why is no real title available?) | 1995-04-09 | Paper |
| scientific article; zbMATH DE number 512820 (Why is no real title available?) | 1994-04-07 | Paper |
| scientific article; zbMATH DE number 437528 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 432983 (Why is no real title available?) | 1993-12-07 | Paper |
A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
International Journal of Computational Geometry & Applications | 1993-10-24 | Paper |
| scientific article; zbMATH DE number 140454 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 43279 (Why is no real title available?) | 1993-01-23 | Paper |
THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
Memory requirements of first-order digital filters
IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing | 1992-10-06 | Paper |
Output-sensitive generation of the perspective view of isothetic parallelepipeds
Algorithmica | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 52552 (Why is no real title available?) | 1992-09-18 | Paper |
Efficient Point Location in a Convex Spatial Cell-Complex
SIAM Journal on Computing | 1992-06-28 | Paper |
Parallel restructuring and evaluation of expressions
Journal of Computer and System Sciences | 1992-06-28 | Paper |
COMPUTING THE UNION OF 3-COLORED TRIANGLES
International Journal of Computational Geometry & Applications | 1992-06-27 | Paper |
Inverting a Vandermonde matrix in minimum parallel time
Information Processing Letters | 1992-06-26 | Paper |
Deterministic P-RAM simulation with constant redundancy
Information and Computation | 1991-01-01 | Paper |
An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum
Algorithmica | 1991-01-01 | Paper |
PLANAR POINT LOCATION REVISITED
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics | 1990-01-01 | Paper |
Dynamic maintenance of planar digraphs, with applications
Algorithmica | 1990-01-01 | Paper |
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation | 1990-01-01 | Paper |
Dynamic planar point location with optimal query time
Theoretical Computer Science | 1990-01-01 | Paper |
An optimal algorithm for the boundary of a cell in a union of rays
Algorithmica | 1990-01-01 | Paper |
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
SIAM Journal on Computing | 1990-01-01 | Paper |
Size-time complexity of Boolean networks for prefix computations
Journal of the ACM | 1989-01-01 | Paper |
Fully Dynamic Point Location in a Monotone Subdivision
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4090792 (Why is no real title available?) | 1988-01-01 | Paper |
Minimum polygonal separation
Information and Computation | 1988-01-01 | Paper |
A unified approach to layout wirability
Mathematical Systems Theory | 1987-01-01 | Paper |
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
SIAM Journal on Computing | 1987-01-01 | Paper |
Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
Information and Computation | 1987-01-01 | Paper |
New upper bounds for neighbor searching
Information and Control | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001488 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3959293 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3960996 (Why is no real title available?) | 1986-01-01 | Paper |
Halfspace range search: An algorithmic application of k-sets
Discrete & Computational Geometry | 1986-01-01 | Paper |
Area-time lower-bound techniques with applications to sorting
Algorithmica | 1986-01-01 | Paper |
Channel routing in knock-knee mode: Simplified algorithms and proofs
Algorithmica | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3919830 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3911723 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3898776 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3893100 (Why is no real title available?) | 1985-01-01 | Paper |
Structural properties of the string statistics problem
Journal of Computer and System Sciences | 1985-01-01 | Paper |
A Minimum Area VLSI Network for O(log n) Time Sorting
IEEE Transactions on Computers | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3887073 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3950392 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3954290 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3901534 (Why is no real title available?) | 1984-01-01 | Paper |
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers | 1984-01-01 | Paper |
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
IEEE Transactions on Computers | 1984-01-01 | Paper |
Optimal three-dimensional VLSI layouts
Mathematical Systems Theory | 1983-01-01 | Paper |
Area—Time optimal VLSI integer multiplier with minimum computation time
Information and Control | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3849983 (Why is no real title available?) | 1983-01-01 | Paper |
Optimal off-line detection of repetitions in a string
Theoretical Computer Science | 1983-01-01 | Paper |
Area—Time Optimal VLSI Circuits for Convolution
IEEE Transactions on Computers | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3793440 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3810920 (Why is no real title available?) | 1982-01-01 | Paper |
Stabbing line segments
BIT | 1982-01-01 | Paper |
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM | 1982-01-01 | Paper |
Approximation algorithms for convex hulls
Communications of the ACM | 1982-01-01 | Paper |
Corrigendum
Journal of Algorithms | 1982-01-01 | Paper |
Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
Acta Informatica | 1981-01-01 | Paper |
A New Approach to Planar Point Location
SIAM Journal on Computing | 1981-01-01 | Paper |
Segments, rectangles, contours
Journal of Algorithms | 1981-01-01 | Paper |
Area-time optimal VLSI networks for multiplying matrices
Information Processing Letters | 1980-01-01 | Paper |
Finding the contour of a union of iso-oriented rectangies
Journal of Algorithms | 1980-01-01 | Paper |
Finding the contour of a union of iso-oriented rectangies
Journal of Algorithms | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3698377 (Why is no real title available?) | 1979-01-01 | Paper |
An optimal real-time algorithm for planar convex hulls
Communications of the ACM | 1979-01-01 | Paper |
Finding the intersection of n half-spaces in time O(n log n)
Theoretical Computer Science | 1979-01-01 | Paper |
A Note on Locating a Set of Points in a Planar Subdivision
SIAM Journal on Computing | 1979-01-01 | Paper |
The densest hemisphere problem
Theoretical Computer Science | 1978-01-01 | Paper |
Improved time and space bounds for Boolean matrix multiplication
Acta Informatica | 1978-01-01 | Paper |
Triangulating a simple polygon
Information Processing Letters | 1978-01-01 | Paper |
Finding the intersection of two convex polyhedra
Theoretical Computer Science | 1978-01-01 | Paper |
New Parallel-Sorting Schemes
IEEE Transactions on Computers | 1978-01-01 | Paper |
An improved parallel processor bound in fast matrix inversion
Information Processing Letters | 1978-01-01 | Paper |
Spectrum Shaping with Alphabetic Codes with Finite Autocorrelation Sequence
IEEE Transactions on Communications | 1978-01-01 | Paper |
| Computational Complexity of Fourier Transforms Over Finite Fields | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3562002 (Why is no real title available?) | 1977-01-01 | Paper |
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM | 1977-01-01 | Paper |
Corrigendum: A fast stable sorting algorithm with absolutely minimum storage
Theoretical Computer Science | 1977-01-01 | Paper |
Reduction of Depth of Boolean Networks with a Fan-In Constraint
IEEE Transactions on Computers | 1977-01-01 | Paper |
Restructuring of Arithmetic Expressions For Parallel Evaluation
Journal of the ACM | 1976-01-01 | Paper |
On Permutation-Embedding Sequences
SIAM Journal on Applied Mathematics | 1976-01-01 | Paper |
Efficient Parallel Evaluation of Boolean Expressions
IEEE Transactions on Computers | 1976-01-01 | Paper |
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM | 1975-01-01 | Paper |
A fast stable sorting algorithm with absolutely minimum storage
Theoretical Computer Science | 1975-01-01 | Paper |
The time required to evaluate division-free arithmetic expressions
Information Processing Letters | 1975-01-01 | Paper |
Difference-preserving codes
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3436590 (Why is no real title available?) | 1973-01-01 | Paper |
Continuously valued logic
Journal of Computer and System Sciences | 1972-01-01 | Paper |
An approach to artificial nonsymbolic cognition
Information Sciences | 1972-01-01 | Paper |
Universal Logic Modules of a New Type
IEEE Transactions on Computers | 1972-01-01 | Paper |
On the Delay Required to Realize Boolean Functions
IEEE Transactions on Computers | 1971-01-01 | Paper |
On the Representation of Integers in Nonadjacent Form
SIAM Journal on Applied Mathematics | 1971-01-01 | Paper |
Some results in the theory of arithmetic codes
Information and Control | 1971-01-01 | Paper |
On the Design of Universal Boolean Functions
IEEE Transactions on Computers | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3340918 (Why is no real title available?) | 1970-01-01 | Paper |
A new look at the Golay (23, 12) code (Corresp.)
IEEE Transactions on Information Theory | 1970-01-01 | Paper |
Generation of near-optimal universal Boolean functions
Journal of Computer and System Sciences | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3449767 (Why is no real title available?) | 1969-01-01 | Paper |
A class of optimum nonlinear double-error-correcting codes
Information and Control | 1968-01-01 | Paper |
Weight and distance structure of Nordstrom-Robinson quadratic code
Information and Control | 1968-01-01 | Paper |
Convolutional Transformation and Recovery of Binary Sequences
IEEE Transactions on Computers | 1968-01-01 | Paper |
Optimization of Reduced Dependencies for Synchronous Sequential Machines
IEEE Transactions on Electronic Computers | 1967-01-01 | Paper |
On the Realizability of Special Classes of Autonomous Sequential Networks
IEEE Transactions on Electronic Computers | 1965-01-01 | Paper |
Traffic analysis of a buffered digital data acquisition system
Calcolo | 1965-01-01 | Paper |
State-Logic Relations for Autonomous Sequential Networks
IEEE Transactions on Electronic Computers | 1964-01-01 | Paper |
Systematic construction of optimal linear recurrent codes for burst error correction
Calcolo | 1964-01-01 | Paper |
