The following pages link to Franco P. Preparata (Q414867):
Displayed 50 items.
- (Q3140400) (← links)
- (Q3219764) (← links)
- A Minimum Area VLSI Network for O(log n) Time Sorting (Q3219772) (← links)
- ON THE REPRESENTATION OF THE POWERS OF INTEGERS IN ANY PRIME BASE (Q3225633) (← links)
- (Q3319342) (← links)
- An Architecture for Bitonic Sorting with Optimal VLSI Performnance (Q3323284) (← links)
- Area—Time optimal VLSI integer multiplier with minimum computation time (Q3330499) (← links)
- PLANAR POINT LOCATION REVISITED (Q3348452) (← links)
- Computation of the axial view of a set of isothetic parallelepipeds (Q3359800) (← links)
- Beware of the Model: Reflections on Algorithmic Research (Q3434536) (← links)
- Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size (Q3471696) (← links)
- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction (Q3644721) (← links)
- (Q3659137) (← links)
- Area—Time Optimal VLSI Circuits for Convolution (Q3659695) (← links)
- (Q3677669) (← links)
- (Q3679818) (← links)
- Optimal Three-Layer Channel Routing (Q3684051) (← links)
- (Q3687730) (← links)
- (Q3694703) (← links)
- (Q3720478) (← links)
- (Q3723713) (← links)
- New upper bounds for neighbor searching (Q3727397) (← links)
- (Q3727878) (← links)
- (Q3730020) (← links)
- A unified approach to layout wirability (Q3754571) (← links)
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones (Q3774930) (← links)
- (Q3817602) (← links)
- A Note on Locating a Set of Points in a Planar Subdivision (Q3854625) (← links)
- (Q3891762) (← links)
- A New Approach to Planar Point Location (Q3912042) (← links)
- Segments, rectangles, contours (Q3916031) (← links)
- Approximation algorithms for convex hulls (Q3919102) (← links)
- Plane-sweep algorithms for intersecting geometric figures (Q3953198) (← links)
- (Q3969895) (← links)
- COMPUTING THE UNION OF 3-COLORED TRIANGLES (Q3986400) (← links)
- Efficient Point Location in a Convex Spatial Cell-Complex (Q3990653) (← links)
- (Q3992847) (← links)
- (Q4002851) (← links)
- Memory requirements of first-order digital filters (Q4014204) (← links)
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED (Q4017521) (← links)
- (Q4028870) (← links)
- Difference-preserving codes (Q4053468) (← links)
- Efficient Parallel Evaluation of Boolean Expressions (Q4093348) (← links)
- Bounds to Complexities of Networks for Sorting and for Switching (Q4101728) (← links)
- Restructuring of Arithmetic Expressions For Parallel Evaluation (Q4102726) (← links)
- On Permutation-Embedding Sequences (Q4103535) (← links)
- Convex hulls of finite sets of points in two and three dimensions (Q4110607) (← links)
- (Q4134504) (← links)
- Reduction of Depth of Boolean Networks with a Fan-In Constraint (Q4135413) (← links)
- Computational Complexity of Fourier Transforms Over Finite Fields (Q4140387) (← links)