Franco P. Preparata

Franco P. Preparata's AcademicInfluence.com Rankings

Franco P. Preparata

Computer Science

#701

World Rank

#722

Historical Rank

#377

USA Rank

Database

#598

World Rank

#628

Historical Rank

#220

USA Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Franco P. Preparata Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Franco P. Preparata is a computer scientist, the An Wang Professor, Emeritus, of Computer Science at Brown University. He is best known for his 1985 book "Computational Geometry: An Introduction" into which he blended salient parts of M. I. Shamos' doctoral thesis . This book, which represents a snapshot of the disciplines as of 1985, has been for many years the standard textbook in the field, and has been translated into four foreign Languages . He has made several contributions to the computational geometry, the most recent being the notion of "algorithmic degree" as a key feature to control robust implementations of geometric algorithms.

(See a Problem?)

Franco P. Preparata's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Computational geometry: an introduction (1985) (7018)
On the Connection Assignment Problem of Diagnosable Systems (1967) (1373)
The cube-connected-cycles: A versatile network for parallel computation (1979) (1111)
On Finding the Maxima of a Set of Vectors (1975) (982)
Euclidean shortest paths in the presence of rectilinear barriers (1984) (405)
Finding the Intersection of two Convex Polyhedra (1978) (341)
Computational Geometry (1985) (328)
Triangulating a Simple Polygon (1978) (314)
Plane-sweep algorithms for intersecting geometric figures (1982) (272)
Computational Geometry—A Survey (1984) (256)
Location of a point in a planar subdivision and its applications (1976) (253)
Optimal Off-Line Detection of Repetitions in a String (1983) (227)
Sequencing-by-hybridization revisited: the analog-spectrum proposal (2004) (185)
The Densest Hemisphere Problem (1978) (170)
Bounds to Complexities of Networks for Sorting and for Switching (1975) (165)
An Optimal Algorithm for Finding the Kernel of a Polygon (1979) (160)
New Parallel-Sorting Schemes (1978) (159)
A Class of Optimum Nonlinear Double-Error-Correcting Codes (1968) (150)
An optimal real-time algorithm for planar convex hulls (1979) (133)
A New Approach to Planar Point Location (1981) (130)
Approximation algorithms for convex hulls (1982) (117)
The Medial Axis of a Simple Polygon (1977) (112)
Optimal Three-Layer Channel Routing (1984) (105)
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones (1986) (104)
Stabbing line segments (1982) (101)
Horizons of Parallel Computation (1992) (91)
Tetrahedrizing Point Sets in Three Dimensions (1988) (88)
Algorithms for Location Estimation Based on RSSI Sampling (2008) (86)
Interconnection delay in very high-speed VLSI (1988) (84)
Robust proximity queries: an illustration of degree-driven algorithm design (1997) (82)
An Improved Parallel Processor Bound in Fast Matrix Inversion (1978) (79)
Routing through a rectangle (1986) (78)
Fully Dynamic Point Location in a Monotone Subdivision (1989) (70)
Robust Plane Sweep for Intersecting Segments (2000) (66)
Finding the Intersection of n Half-Spaces in Time O(n log n) (1979) (66)
Introduction to Discrete Structures for Computer Science and Engineering (1973) (65)
Area-Time Optimal VLSI Networks for Multiplying Matrices (1980) (64)
Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (1981) (64)
Testing a Simple Polygon for Monotonicity (1981) (62)
A critique of network speed in VLSI models of computation (1982) (55)
Minimum Polygonal Separation (1986) (54)
Checking the convexity of polytopes and the planarity of subdivisions (1998) (52)
Holographic dispersal and recovery of information (1989) (51)
Efficient Point Location in a Convex Spatial Cell-Complex (1989) (51)
Halfspace range search: an algorithmic application of K-sets (1985) (51)
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm (2000) (50)
A Minimum Area VLSI Network for O(log n) Time Sorting (1985) (50)
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps (1996) (50)
A Critique and an Appraisal of VLSI Models of Computation. (1981) (49)
Segmenting Handwritten Signatures at Their Perceptually Important Points (1993) (48)
Introduction to discrete structures (1973) (47)
Continuously Valued Logic (1972) (47)
Computational Complexity of Fourier Transforms over Finite Fields (1977) (46)
Finding the Contour of a Union of Iso-Oriented Rectangles (1980) (45)
Fully dynamic techniques for point location and transitive closure in planar structures (1988) (44)
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (1984) (43)
A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers (1983) (42)
Optimal Reconstruction of a Sequence from its Probes (1999) (41)
Correction to "Computational Geometry - A Survey" (1985) (41)
A Probabilistic Analysis of the Power of Arithmetic Filters (1996) (40)
Accurate cylindricity evaluation with axis-estimation preprocessing (2003) (39)
Restructuring of Arithmetic Expressions For Parallel Evaluation (1976) (38)
An Improved Algorithm for the Rectangle Enclosure Problem (1982) (37)
Evaluating signs of determinants using single-precision arithmetic (1997) (36)
The All Nearest-Neighbor Problem for Convex Polygons (1978) (36)
On the power of universal bases in sequencing by hybridization (1999) (34)
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform (1981) (34)
Data structures and algorithms for the string statistics problem (1996) (33)
Computation of the axial view of a set of isothetic parallelepipeds (1990) (32)
Evaluation of a new method to compute signs of determinants (1995) (32)
Structural Properties of the String Statistics Problem (1985) (32)
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds (1999) (32)
Halfspace range search: An algorithmic application ofk-sets (1986) (32)
Convex Hulls: Basic Algorithms (1985) (30)
VLSI Algorithms and Architectures (1984) (30)
Generation of Near-Optimal Universal Boolean Functions (1970) (29)
Advances in Computing Research: The Theory of Databases (1986) (29)
The parallel 3D convex hull problem revisited (1992) (29)
Evaluating the cylindricity of a nominally cylindrical point set (2000) (27)
Efficient Parallel Evaluation of Boolean Expressions (1976) (27)
Advances in computing research (1988) (26)
Ciliate evolution: The ribosomal phylogenies of the tetrahymenine ciliates (1989) (26)
On circular Cylinders by Four or Five Points in Space (2001) (25)
An Architecture for Bitonic Sorting with Optimal VLSI Performnance (1984) (25)
A Simplified Technique for Hidden-Line Elimination in Terrains (1991) (25)
An approach to artificial nonsymbolic cognition (1972) (24)
An NC parallel 3D convex hull algorithm (1993) (24)
Three layers are enough (1982) (24)
Work-Preserving Speed-Up of Parallel Matrix Computations (1995) (24)
Compact Channel Routing of Multiterminal Nets (1985) (24)
Widest-Corridor Problems (1994) (23)
On the Design of Universal Boolean Functions (1971) (23)
Quick, Practical Selection of Effective Seeds for Homology Search (2005) (22)
Segments, Rectangles, Contours (1981) (22)
Motion planning for spider robots (1992) (22)
Difference-preserving codes (1974) (22)
Systematic construction of optimal linear recurrent codes for burst error correction (1964) (22)
Circular Cylinders through Four or Five Points in Space (2002) (22)
Dynamic Planar Point Location with Optimal Query Time (1990) (22)
Further results on arithmetic filters for geometric predicates (1999) (22)
On Permutation-Embedding Sequences (1976) (21)
A Novel Approach to the Detection of Genomic Approximate Tandem Repeats in the Levenshtein Metric (2007) (21)
New Upper Bounds for Neighbor Searching (1986) (20)
Practical Cellular Dividers (1990) (19)
State-Logic Relations for Autonomous Sequential Networks (1964) (19)
O(n)-depth circuit algorithm for modular exponentiation (1995) (19)
Enhanced Sequence Reconstruction with DNA Microarray Application (2001) (19)
Planar Point Location Revisited (Review Paper) (1990) (17)
Dynamic maintenance of planar digraphs, with applications (1990) (17)
Area—Time Optimal VLSI Circuits for Convolution (1983) (17)
Deterministic P-RAM simulation with constant redundancy (1989) (17)
Efficient Spatial Point Location (Extended Abstract) (1989) (16)
A bottom-up layout technique based on two-rectangle routing (1987) (16)
The theory of databases (1986) (15)
Steps into Computational Geometry (1977) (15)
A minimum area VLSI network for O(logn) time sorting (1984) (15)
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size (1990) (15)
Robust Proximity Queries in Implicit Voronoi Diagrams (1996) (15)
DNA Sequencing by Hybridization Using Semi-Degenerate Bases (2004) (15)
Size-time complexity of Boolean networks for prefix computations (1989) (14)
The Influence of Key Length on the Area-Time Complexity of Sorting (1985) (14)
A Note on Locating a Set of Points in a Planar Subdivision (1979) (14)
Convolutional Transformations of Binary Sequences: Boolean Functions and Their Resynchronizing Properties (1966) (14)
Initializability Consideration in Sequential Machine Synthesis (1992) (13)
Culling a Set of Points for Roundness or Cylindricity Evaluations (2003) (13)
Finding the Intersection of a Set of n Half-Spaces in Time O(nlogn). (1977) (13)
Motion planning of legged robots: the spider robot problem (1995) (13)
Digital Filtering in VLSI (1986) (13)
Some Results in the Theory of Arithmetic Codes (1971) (13)
Optimal three-dimensional VLSI layouts (1983) (12)
Area-time lower-bound techniques with applications to sorting (2005) (12)
Universal Logic Modules of a New Type (1972) (12)
A practical constructive scheme for deterministic shared-memory access (1993) (12)
Weight and Distance Structure of Nordstrom-Robinson Quadratic Code (1968) (12)
Size-time complexity of Boolean networks for prefix computations (1987) (12)
A Mesh-Connected Area-Time Optimal VLSI Integer Multiplier (1981) (12)
Supereffective slow-down of parallel computations (1992) (11)
The VLSI Optimality of the AKS Sorting Network (1985) (11)
Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) (1987) (11)
Area-Time Optimal VLSI Networks Based on the Cube-Connected-Cycles. (1980) (9)
Shifting ditypic site analysis: Heuristics for expanding the phylogenetic range of nucleotide sequences in Sankoff analyses (1989) (9)
Parallel Batched Planar Point Location on the CCC (1989) (9)
Storage for Consecutive Retrieval (1976) (9)
On the Representation of Integers in Nonadjacent Form (1971) (9)
On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization (2002) (8)
The Role of Arithmetic in Fast Parallel Matrix Inversion (2001) (8)
An optimal algorithm for the boundary of a cell in a union of rays (1988) (8)
Reduction of Depth of Boolean Networks with a Fan-In Constraint (1975) (8)
Upper bounds to processor-time tradeoffs under bounded-speed message propagation (1995) (8)
On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem (1993) (8)
Computing the union of 3-colored triangles (1991) (8)
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation (1995) (7)
Issues in robotics and nonlinear geometry (1992) (7)
ANALYSIS OF TRAFFIC FLOW ON A SIGNALIZED ONE-WAY ARTERY (1972) (7)
Channel routing in knock-knee mode: Simplified algorithms and proofs (1986) (7)
Sequencing by hybridization using direct and reverse cooperating spectra (2002) (6)
Should Amdahl's Law Be Repealed? (Abstract) (1995) (6)
Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage (1975) (6)
Planar Point Location Revisited (A Guided Tour of a Decade of Research) (1988) (6)
Plane - sweep algorithms for intersecting geometric figures (1981) (6)
Inverting a Vandermonde Matrix in Minimum Parallel Time (1991) (6)
Area-Time Optimal Division for T=f2( (log n)' +')* (1987) (5)
Improved time and space bounds for Boolean matrix multiplication (1978) (5)
Sequencing by Hybridization by Cooperating Direct and Reverse Spectra (2003) (5)
Proximity: Fundamental Algorithms (1985) (5)
Convex Hulls of Finite Planar and Spatial Sets of Points (1975) (5)
Using Pyramids in Mixed Meshes - Point Placement and Basis Functions (2000) (5)
A Minimum Area VLSI Architecture for O(logn) Time Sorting (1983) (5)
Frontiers of Parallel Computing (1992) (5)
Advances in computing research, vol. 2: VLSI theory (1984) (5)
The Time Required to Evaluate Division-Free Arithmetic Expressions (1975) (4)
A time-optimal parallel algorithm for three-dimensional convex hulls (1995) (4)
On the Delay Required to Realize Boolean Functions (1971) (4)
Introduction to Computer Engineering (1984) (4)
Area-time Optimal Division for T=Omega(log n)1+epsilon (1986) (4)
Spectrum-Based De Novo Repeat Detection in Genomic Sequences (2008) (4)
A Fully Dynamic Planar Point Location Technique (1987) (4)
Generalized scans and tridiagonal systems (2001) (4)
O(n)-Depth Modular Exponentiation Circuit Algorithm (1997) (3)
TOPOLOGICAL STRUCTURES OF INFORMATION RETRIEVAL SYSTEMS (1966) (3)
ON CLUSTERING TECHNIQUES OF CITATION GRAPHS. (1967) (3)
Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract) (1997) (3)
Robustness in Geometric Algorithms (1996) (3)
On the Boundary of a Union of Rays (1989) (3)
On the Realizability of Special Classes of Autonomous Sequential Networks (1965) (3)
Stable placements for spider robots (1992) (3)
Memory requirements of first-order digital filters (1992) (3)
A THEORY OF CONTINUOUSLY VALUED LOGIC. (1970) (3)
Convolutional Transformation and Recovery of Binary Sequences (1968) (3)
A new look at the Golay (23, 12) code (Corresp.) (1970) (3)
A unified approach to layout wirability (1986) (3)
Output-sensitive generation of the perspective view of isothetic parallelepipeds (1990) (3)
Motion planning for a spider robot (1992) (3)
Applicable and Robust Geometric Computing (2001) (3)
An Elementary Theory of Layout Wirability (1985) (3)
Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008) (2)
Area-Time Optimal VLSI Networks for Matrix Multiplication and Inversion of Triangular Matrices. (1980) (2)
Processor-time tradeo s under bounded-speed message propagation: Part I (1997) (2)
The unpredictable deviousness of models (2006) (2)
Adaptive Control of Hybridization Noise in Dna Sequencing-by-hybridization (2005) (2)
Steps into Computational Geometry: Notebook II (1977) (2)
Sequence Reconstruction from Nucleic Acid Microarray Data (2005) (2)
Logic Devices (2018) (2)
On multitransmission networks (1973) (2)
Efficient Localization for Wireless Sensor Networks Using Power Measurements Sampling (2007) (2)
The Geometry of Rectangles (1985) (1)
PARALLEL EVALUATION OF DIVISION-FREE EXPRESSIONS (1976) (1)
Steps Toward Unraveling a Vatican Cipher of the 1930s (2011) (1)
A STUDY OF NORDSTROM-ROBINSON OPTIMUM CODE (1968) (1)
Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings (2007) (1)
Practical constructive schemes for deterministic shared-memory access (2007) (1)
Proceedings of the 1st annual international conference on Frontiers in algorithmics (2007) (1)
A Time-Optimal Parallel Algorithm for 3 D Convex Hulls (1993) (1)
Interconnection Delay in Very (1991) (1)
An optimal algorithm for the boundary of a cell in a union of rays—corrigendum (1991) (1)
Traffic analysis of a buffered digital data acquisition system (1966) (1)
The evolving profile and role of computer science (2009) (1)
An Interactive Document Retrieval System (1968) (1)
UPPER-BOUND TO THE TIME FOR PARALLEL EVALUATION OF ARITHMETIC EXPRESSIONS (1976) (1)
New Algorithms for Near Neighbor Searching. (1983) (1)
An Estimate of the Length of Diagnostics Tests (1969) (1)
A Heuristic for Channel Routing (1989) (1)
A Heuristic for Manhattan Routing (1986) (0)
On Contigs and Coverage (2013) (0)
Minimum Polygonal Separation 1 (2017) (0)
Virtual Shared Memory (2011) (0)
Correction to "A New Rapid Acquisition Technique for Direct Sequence Spread Spectrum Communications" (1987) (0)
Step into Computational Geometry: Notebook III. (1981) (0)
Generalized Scans and Tri-Diagonal Systems (1995) (0)
Processor-time Tradeoos under Bounded-speed Message Propagation: Part I, Upper Bounds Processor-time Tradeoos under Bounded-speed Message Propagation: Part I, Upper Bounds (2007) (0)
A minimum area VLSI (very large scale integrated architecture for o(logn) time sorting. Technical report (1983) (0)
Randomness and computation (1989) (0)
A synthesis procedure of recurrent codes (Corresp.) (1964) (0)
Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction (2009) (0)
Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers (1981) (0)
Binary Sequence Convolutional Mapping: The Channel Capacity of a Non-Feedback Decoding Scheme (1967) (0)
Accurate and precise aggregation counting (2012) (0)
A novel practical approach to cylindricity evaluation : An experimental report (2000) (0)
Toward a switching theory of CMOS circuits (1987) (0)
Finite Element Analysis on a 3-Dimensional Mesh of Trees (1988) (0)
Further Results on Arithmetic Filters for Geometric (2007) (0)
A Uniied Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps a Uniied Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps (2007) (0)
A Biology Primer for Computer Scientists (2007) (0)
Introduction to Integer-Coordinate Crystalline Meshes (1999) (0)
On the Manhattan and knock-knee Routing Models (1993) (0)
4. Conclusion 5. Acknowledgment 3. the Width in Three Dimensions 2. the Width in Two Dimensions Computing the Width of a Set (1988) (0)
Enhanced Sequence Reconstruction with DNA Microarray Application Extended Abstract (2001) (0)
ACT-26 MAY , 1981 S 3 COORDINATED SCIEN CE LABORATORY APPLIED COMPUTATION THEORY GROUP STEP INTO COMPUTATIONAL GEOMETRY NOTEBOOK III (2017) (0)
8 Practical Considerations in Our Approach 7 Testing Software (2007) (0)
ACT-26 MAY , 1981 S 3 COORDINATED SCIEN CE LABORATORY APPLIED COMPUTATION THEORY GROUP STEP INTO COMPUTATIONAL GEOMETRY NOTEBOOK III (2017) (0)
Towards a Theory of VLSI Layout (1984) (0)
R70-28 A Note on Definite Stochastic Sequential Machines (1970) (0)
7. Conclusion 6. Finding Critical Support Lines (1983) (0)
Parallel and distributed computing (1987) (0)
Proximity: Variants and Generalizations (1985) (0)
4. Conclusions 5. Acknowledgment 6. References (1981) (0)
PARALLEL RESTRUCTURING AND * EVALUATION OF EXPRESSIONS DTIC (0)
On the Convergence of Newton's Method for Solving Systems of Linear Equations (1987) (0)
Applied Computation Theory THE PARALLEL 3 D CONVEX-HULL PROBLEM REVISITED (2017) (0)
VLSI Computation (2011) (0)
Beware of the Model: Reflections on Algorithmic Research (2006) (0)
Should Amdahl ' s Law Be Repealed ? ( Invited Presentation ) (2005) (0)
Face-centered cubic ( FCC ) lattice models for protein folding : energy function inference and biplane packing Author : (2010) (0)
FINDING THE CONTOUR OF A UNION OF RECTANGLES (2017) (0)
A New Methodology for VLSI Layout (1986) (0)
MAINTENANCE OF PLANAR DIGRAPHS, WITH APPLICATIONS (2017) (0)
Parallel restructuring and evaluation of expressions. Technical report (1988) (0)
COORDINATED SCIEN CE LABORATORY THE DENSEST HEMISPHERE PROBLEM (2017) (0)
A tribute to referees (2004) (0)
On the external boundary of a union of rays (1986) (0)
7. Acknowledgments 8. References 6. Concluding Remarks (1981) (0)
6. Other Properties of Arrangements 5. the Girth of an Arrangement 4. the Envelope of an Arrangement 3. Maximal Vectors of Arrangements 2. Convex Hulls of Arrangements Computing Morphological Properties of Ar- Rangements of Lines (1991) (0)
Computer-Cognition of Natural Scenes Outline of a Project (1972) (0)
ON A 3-DIMENS ION AL MESH OF TREES (2017) (0)
|AND OQ NOT C ATER ELEMNTAND OR SE|IJENTIAL API (1965) (0)
Seeking an agenda for high performance computing (1994) (0)
The Parallel 3D Convex-Hull Problem Revisited - Revision 1 (1991) (0)
ON THE REPRESENTATION OF THE POWERS OF INTEGERS IN ANY PRIME BASE (2012) (0)
Convex Hulls: Extensions and Applications (1985) (0)
Erratum, "Weight and Distance Structure of Nordstrom-Robinson Quadratic Code" (1968) (0)
5. References 4. Concluding Remarks (1984) (0)
Computational Complexity Computational Geometry Analysis of Algorithms Polyhedra Intersection of Polyhedra Separating Plane Linear Separability Geometric Duality Convex (2017) (0)
Theoretical computer science (2001) (0)
Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings (2008) (0)
B3SCO O RD IN A TED SCIEN CE LABORATORY APPLIED COMPUTATION THEORY GROUP NEW ALGORITHMS FOR NEAR NEIGHBOR SEARCHING (2017) (0)

This paper list is powered by the following services:

Other Resources About Franco P. Preparata

What Schools Are Affiliated With Franco P. Preparata?

Franco P. Preparata is affiliated with the following schools: