The following pages link to Franco P. Preparata (Q414867):
Displayed 50 items.
- (Q196665) (redirect page) (← links)
- Accurate and precise aggregation counting (Q414868) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- Practical constructive schemes for deterministic shared-memory access (Q675852) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- The unpredictable deviousness of models (Q959796) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- Area-time lower-bound techniques with applications to sorting (Q1091139) (← links)
- Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) (Q1091140) (← links)
- Channel routing in knock-knee mode: Simplified algorithms and proofs (Q1091149) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (Q1145508) (← links)
- Area-time optimal VLSI networks for multiplying matrices (Q1145672) (← links)
- Stabbing line segments (Q1163869) (← links)
- Optimal off-line detection of repetitions in a string (Q1170893) (← links)
- Inverting a Vandermonde matrix in minimum parallel time (Q1178241) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q1194332) (← links)
- A fast stable sorting algorithm with absolutely minimum storage (Q1225453) (← links)
- The time required to evaluate division-free arithmetic expressions (Q1231389) (← links)
- Corrigendum: A fast stable sorting algorithm with absolutely minimum storage (Q1231772) (← links)
- The densest hemisphere problem (Q1242681) (← links)
- An improved parallel processor bound in fast matrix inversion (Q1244782) (← links)
- Triangulating a simple polygon (Q1249042) (← links)
- Improved time and space bounds for Boolean matrix multiplication (Q1251068) (← links)
- Finding the intersection of two convex polyhedra (Q1253450) (← links)
- Finding the intersection of n half-spaces in time O(n log n) (Q1260355) (← links)
- A probabilistic analysis of the power of arithmetic filters (Q1275677) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds (Q1384682) (← links)
- Further results on arithmetic filters for geometric predicates (Q1807652) (← links)
- Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds (Q1818090) (← links)
- Circular cylinders through four or five points in space (Q1864130) (← links)
- Horizons of parallel computation (Q1898226) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Data structures and algorithms for the string statistics problem (Q1913702) (← links)
- Traffic analysis of a buffered digital data acquisition system (Q2394196) (← links)
- Systematic construction of optimal linear recurrent codes for burst error correction (Q2521880) (← links)
- Generation of near-optimal universal Boolean functions (Q2537976) (← links)
- An approach to artificial nonsymbolic cognition (Q2549587) (← links)
- Continuously valued logic (Q2560808) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum (Q2639639) (← links)
- Steps Toward Unraveling a Vatican Cipher of the 1930s (Q2920289) (← links)
- A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS (Q3136723) (← links)
- (Q3139120) (← links)