Franco P. Preparata

199 papers A* 12A 6B 16C 5Misc 4Journal 135Unranked 18

Year	Rank	Type	Title / Venue / Authors
2013	J	`jnl`	On Contigs and Coverage. J. Comput. Biol. Franco P. Preparata
2012	J	`jnl`	Accurate and precise aggregation counting. J. Comput. Syst. Sci. Franco P. Preparata
2011	J	`jnl`	Steps Toward Unraveling a Vatican Cipher of the 1930s. Cryptologia Franco P. Preparata
2011	—	`ch.`	VLSI Computation. Encyclopedia of Parallel Computing Franco P. Preparata
2009	—	`conf`	Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction. Efficient Algorithms Franco P. Preparata
2009	J	`jnl`	The evolving profile and role of computer science. Sci. China Ser. F Inf. Sci. Franco P. Preparata
2008	C	`conf`	Algorithms for Location Estimation Based on RSSI Sampling. ALGOSENSORS Charalampos Papamanthou, Franco P. Preparata, Roberto Tamassia
2008	Misc	`ed.`	Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings FAW Franco P. Preparata, Xiaodong Wu, Jianping Yin
2008	J	`jnl`	Spectrum-Based J. Comput. Biol. Huy Hoang Do, Kwok Pui Choi, Franco P. Preparata, Wing-Kin Sung, Louxin Zhang
2008	J	`jnl`	The unpredictable deviousness of models. Theor. Comput. Sci. Franco P. Preparata
2007	J	`jnl`	A Novel Approach to the Detection of Genomic Approximate Tandem Repeats in the Levenshtein Metric. J. Comput. Biol. Nevzat Onur Domaniç, Franco P. Preparata
2007	Misc	`ed.`	Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings FAW Franco P. Preparata, Qizhi Fang
2006	C	`conf`	Beware of the Model: Reflections on Algorithmic Research. CIAC Franco P. Preparata
2006	Misc	`conf`	The Unpredictable Deviousness of Models. COCOON Franco P. Preparata
2005	J	`jnl`	Adaptive Control of Hybridization Noise in Dna Sequencing-by-hybridization. J. Bioinform. Comput. Biol. Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy
2005	J	`jnl`	Quick, Practical Selection of Effective Seeds for Homology Search. J. Comput. Biol. Franco P. Preparata, Louxin Zhang, Kwok Pui Choi
2004	J	`jnl`	DNA Sequencing by Hybridization Using Semi-Degenerate Bases. J. Comput. Biol. Franco P. Preparata, John S. Oliver
2004	J	`jnl`	Sequencing-by-Hybridization Revisited: The Analog-Spectrum Proposal. IEEE ACM Trans. Comput. Biol. Bioinform. Franco P. Preparata
2003	J	`jnl`	Circular Cylinders through Four or Five Points in Space. Discret. Comput. Geom. Olivier Devillers, Bernard Mourrain, Franco P. Preparata, Philippe Trebuchet
2003	J	`jnl`	Culling a Set of Points for Roundness or Cylindricity Evaluations. Int. J. Comput. Geom. Appl. Olivier Devillers, Franco P. Preparata
2003	J	`jnl`	Sequencing by Hybridization by Cooperating Direct and Reverse Spectra. J. Comput. Biol. Samuel A. Heath, Franco P. Preparata, Joel Young
2002	C	`conf`	On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization. WABI Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy
2002	B	`conf`	Sequencing by hybridization using direct and reverse cooperating spectra. RECOMB Samuel A. Heath, Franco P. Preparata, Joel Young
2001	Misc	`conf`	Enhanced Sequence Reconstruction with DNA Microarray Application. COCOON Samuel A. Heath, Franco P. Preparata
2001	J	`jnl`	Generalized scans and tridiagonal systems. Theor. Comput. Sci. Paul F. Fischer, Franco P. Preparata, John E. Savage
2001	J	`jnl`	The Role of Arithmetic in Fast Parallel Matrix Inversion. Algorithmica Bruno Codenotti, Mauro Leoncini, Franco P. Preparata
2000	A*	`conf`	Evaluating the cylindricity of a nominally cylindrical point set. SODA Olivier Devillers, Franco P. Preparata
2000	J	`jnl`	Robust Plane Sweep for Intersecting Segments. SIAM J. Comput. Jean-Daniel Boissonnat, Franco P. Preparata
2000	J	`jnl`	Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. J. Comput. Biol. Franco P. Preparata, Eli Upfal
2000	B	`conf`	Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. RECOMB Franco P. Preparata, Eli Upfal
1999	J	`jnl`	A Probabilistic Analysis of the Power of Arithmetic Filters CoRR Olivier Devillers, Franco P. Preparata
1999	J	`jnl`	Further Results on Arithmetic Filters for Geometric Predicates CoRR Olivier Devillers, Franco P. Preparata
1999	J	`jnl`	Further results on arithmetic filters for geometric predicates. Comput. Geom. Olivier Devillers, Franco P. Preparata
1999	B	`conf`	On the power of universal bases in sequencing by hybridization. RECOMB Franco P. Preparata, Alan M. Frieze, Eli Upfal
1999	J	`jnl`	Optimal Reconstruction of a Sequence from its Probes. J. Comput. Biol. Alan M. Frieze, Franco P. Preparata, Eli Upfal
1999	J	`jnl`	Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. Theory Comput. Syst. Gianfranco Bilardi, Franco P. Preparata
1998	J	`jnl`	A Probabilistic Analysis of the Power of Arithmetic Filters. Discret. Comput. Geom. Olivier Devillers, Franco P. Preparata
1998	J	`jnl`	Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
1998	J	`jnl`	Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SIAM J. Comput. Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
1997	B	`conf`	Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). WADS Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
1997	J	`jnl`	Evaluating Signs of Determinants Using Single-Precision Arithmetic. Algorithmica Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
1997	J	`jnl`	O(n)-Depth Modular Exponentiation Circuit Algorithm. IEEE Trans. Computers Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata
1997	J	`jnl`	Practical Constructive Schemes for Deterministic Shared-Memory Access. Theory Comput. Syst. Andrea Pietracaprina, Franco P. Preparata
1997	J	`jnl`	Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Syst. Gianfranco Bilardi, Franco P. Preparata
1997	—	`conf`	Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SCG Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
1996	J	`jnl`	A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SIAM J. Comput. Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
1996	J	`jnl`	Data Structures and Algorithms for the String Statistics Problem. Algorithmica Alberto Apostolico, Franco P. Preparata
1996	—	`conf`	Robust Proximity Queries in Implicit Voronoi Diagrams. CCCG Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata
1996	—	`conf`	Robustness in Geometric Algorithms. WACG Franco P. Preparata
1995	J	`jnl`	A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls. Algorithmica Nancy M. Amato, Franco P. Preparata
1995	—	`conf`	Evaluation of a New Method to Compute Signs of Determinants. SCG Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
1995	A	`conf`	Generalized Scans and Tri-Diagonal Systems. STACS Paul F. Fischer, Franco P. Preparata, John E. Savage
1995	J	`jnl`	Horizons of Parallel Computation. J. Parallel Distributed Comput. Gianfranco Bilardi, Franco P. Preparata
1995	B	`conf`	Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS Gianfranco Bilardi, Franco P. Preparata
1995	J	`jnl`	Motion planning of legged robots: the spider robot problem. Int. J. Comput. Geom. Appl. Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
1995	C	`conf`	O(n)-depth circuit algorithm for modular exponentiation. IEEE Symposium on Computer Arithmetic Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata
1995	B	`conf`	Should Amdahl's Law Be Repealed? (Abstract). ISAAC Franco P. Preparata
1995	B	`conf`	Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. SPAA Gianfranco Bilardi, Franco P. Preparata
1995	J	`jnl`	Work-Preserving Speed-Up of Parallel Matrix Computations. SIAM J. Comput. Victor Y. Pan, Franco P. Preparata
1994	J	`jnl`	Widest-Corridor Problems. Nord. J. Comput. Ravi Janardan, Franco P. Preparata
1993	B	`conf`	A Practical Constructive Scheme for Deterministic Shared-Memory Access. SPAA Andrea Pietracaprina, Franco P. Preparata
1993	J	`jnl`	A Simplified Technique for Hidden-Line Elimination in Terrains. Int. J. Comput. Geom. Appl. Franco P. Preparata, Jeffrey Scott Vitter
1993	A*	`conf`	A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SODA Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
1993	—	`conf`	An NC Parallel 3D Convex Hull Algorithm. SCG Nancy M. Amato, Franco P. Preparata
1993	A	`conf`	On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. STACS Andrea Pietracaprina, Franco P. Preparata
1993	—	`ch.`	On the Manhattan and knock-knee Routing Models. Algorithmic Aspects of VLSI Layout D. Zhou, Franco P. Preparata
1993	—	`conf`	Widest-corridor Problems. CCCG Ravi Janardan, Franco P. Preparata
1992	A	`conf`	A Simplified Technique for Hidden-Line Elimination in Terrains. STACS Franco P. Preparata, Jeffrey Scott Vitter
1992	J	`jnl`	Efficient Point Location in a Convex Spatial Cell-Complex. SIAM J. Comput. Franco P. Preparata, Roberto Tamassia
1992	—	`conf`	Frontiers of Parallel Computing. Heinz Nixdorf Symposium Franco P. Preparata
1992	—	`conf`	Horizons of Parallel Computation. 25th Anniversary of INRIA Franco P. Preparata, Gianfranco Bilardi
1992	A*	`conf`	Motion planning for spider robots. ICRA Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
1992	J	`jnl`	Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. Algorithmica Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
1992	J	`jnl`	Parallel Restructuring and Evaluation of Expressions. J. Comput. Syst. Sci. David E. Muller, Franco P. Preparata
1992	—	`conf`	Stable Placements for Spider Robots. SCG Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
1992	B	`conf`	Supereffective Slow-Down of Parallel Computations. SPAA Victor Y. Pan, Franco P. Preparata
1992	J	`jnl`	The parallel 3D convex hull problem revisited. Int. J. Comput. Geom. Appl. Nancy M. Amato, Franco P. Preparata
1991	J	`jnl`	An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum. Algorithmica Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
1991	J	`jnl`	Computing the union of 3-colored triangles. Int. J. Comput. Geom. Appl. Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata
1991	J	`jnl`	Deterministic P-RAM Simulation with Constant Redundancy Inf. Comput. Scot W. Hornick, Franco P. Preparata
1991	J	`jnl`	Inverting a Vandermonde Matrix in Minimum Parallel Time. Inf. Process. Lett. Franco P. Preparata
1990	J	`jnl`	An Optimal Algorithm for the Boundary of a Cell in a Union of Rays. Algorithmica Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
1990	J	`jnl`	Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. SIAM J. Comput. Gianfranco Bilardi, Franco P. Preparata
1990	J	`jnl`	Computation of the axial view of a set of isothetic parallelepipeds. ACM Trans. Graph. Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
1990	J	`jnl`	Dynamic Maintenance of Planar Digraphs, with Applications. Algorithmica Roberto Tamassia, Franco P. Preparata
1990	J	`jnl`	Dynamic Planar Point Location with Optimal Query Time. Theor. Comput. Sci. Franco P. Preparata, Roberto Tamassia
1990	—	`conf`	Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. SWAT Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
1990	J	`jnl`	Planar Point Location Revisited (Review Paper). Int. J. Found. Comput. Sci. Franco P. Preparata
1990	J	`jnl`	Practical Cellular Dividers. IEEE Trans. Computers Franco P. Preparata, Jean Vuillemin
1990	J	`jnl`	Tetrahedrizing Point Sets in Three Dimensions. J. Symb. Comput. Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West
1989	—	`conf`	A Heuristic for Channel Routing. FODO Elena Lodi, Franco P. Preparata
1989	B	`conf`	Deterministic P-RAM Simulation with Constant Redundancy. SPAA Scot W. Hornick, Franco P. Preparata
1989	A	`conf`	Dynamic Planar Point Location with Optimal Query Time. STACS Franco P. Preparata, Roberto Tamassia
1989	B	`conf`	Efficient Spatial Point Location (Extended Abstract). WADS Franco P. Preparata, Roberto Tamassia
1989	J	`jnl`	Fully Dynamic Point Location in a Monotone Subdivision. SIAM J. Comput. Franco P. Preparata, Roberto Tamassia
1989	J	`jnl`	Holographic dispersal and recovery of information. IEEE Trans. Inf. Theory Franco P. Preparata
1989	A	`conf`	On the Boundary of a Union of Rays. STACS Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
1989	J	`jnl`	Parallel Batched Planar Point Location on the CCC. Inf. Process. Lett. D. T. Lee, Franco P. Preparata
1989	J	`jnl`	Size-time complexity of Boolean networks for prefix computations. J. ACM Gianfranco Bilardi, Franco P. Preparata
1988	—	`conf`	An optimal algorithm for the boundary of a cell in a union of rays. Geometry and Robotics Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
1988	A*	`conf`	Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract) FOCS Franco P. Preparata, Roberto Tamassia
1988	C	`conf`	Interconnection delay in very high-speed VLSI. ICCD D. Zhou, Franco P. Preparata, S. M. Kang
1988	J	`jnl`	Minimum Polygonal Separation Inf. Comput. Herbert Edelsbrunner, Franco P. Preparata
1988	—	`conf`	Planar Point Location Revisited (A Guided Tour of a Decade of Research). FSTTCS Franco P. Preparata
1988	B	`conf`	Tetrahedrizing Point Sets in Three Dimensions. ISSAC Herbert Edelsbrunner, Franco P. Preparata
1987	J	`jnl`	A Unified Approach to Layout Wirability. Math. Syst. Theory Witold Lipski Jr., Franco P. Preparata
1987	J	`jnl`	A bottom-up layout technique based on two-rectangle routing. Integr. Majid Sarrafzadeh, Franco P. Preparata
1987	J	`jnl`	Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) Inf. Comput. Kurt Mehlhorn, Franco P. Preparata
1987	J	`jnl`	Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1987	—	`conf`	Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1987	A*	`conf`	Size-Time Complexity of Boolean Networks for Prefix Computations STOC Gianfranco Bilardi, Franco P. Preparata
1987	—	`conf`	Toward a switching theory of CMOS circuits. FJCC David E. Muller, Franco P. Preparata
1986	J	`jnl`	Area-Time Lower-Bound Techniques with Applications to Sorting. Algorithmica Gianfranco Bilardi, Franco P. Preparata
1986	A	`conf`	Area-time Optimal Division for T=Omega(log n) STACS Kurt Mehlhorn, Franco P. Preparata
1986	J	`jnl`	Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh
1986	B	`conf`	Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
1986	—	`conf`	Digital Filtering in VLSI. Aegean Workshop on Computing Gianfranco Bilardi, Franco P. Preparata
1986	J	`jnl`	Halfspace Range Search: An Algorithmic Application of k-Sets. Discret. Comput. Geom. Bernard Chazelle, Franco P. Preparata
1986	J	`jnl`	New Upper Bounds for Neighbor Searching Inf. Control. Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap
1986	J	`jnl`	Routing through a rectangle. J. ACM Kurt Mehlhorn, Franco P. Preparata
1985	J	`jnl`	A Minimum Area VLSI Network for IEEE Trans. Computers Gianfranco Bilardi, Franco P. Preparata
1985	—	`book`	Computational Geometry - An Introduction. Franco P. Preparata, Michael Ian Shamos
1985	—	`conf`	Halfspace range search: an algorithmic application of K-sets. SCG Bernard Chazelle, Franco P. Preparata
1985	J	`jnl`	Structural Properties of the String Statistics Problem. J. Comput. Syst. Sci. Alberto Apostolico, Franco P. Preparata
1985	A*	`conf`	The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP Gianfranco Bilardi, Franco P. Preparata
1985	J	`jnl`	The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. Gianfranco Bilardi, Franco P. Preparata
1984	A*	`conf`	A Minimum Area VLSI Network for O(log n) Time Sorting STOC Gianfranco Bilardi, Franco P. Preparata
1984	J	`jnl`	An Architecture for Bitonic Sorting with Optimal VLSI Performance. IEEE Trans. Computers Gianfranco Bilardi, Franco P. Preparata
1984	A*	`conf`	Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. ICALP Kurt Mehlhorn, Franco P. Preparata
1984	J	`jnl`	Computational Geometry - A Survey. IEEE Trans. Computers D. T. Lee, Franco P. Preparata
1984	J	`jnl`	Euclidean shortest paths in the presence of rectilinear barriers. Networks D. T. Lee, Franco P. Preparata
1984	J	`jnl`	Optimal Three-Layer Channel Routing. IEEE Trans. Computers Franco P. Preparata, Witold Lipski Jr.
1984	B	`conf`	VLSI Algorithms and Architectures. MFCS Franco P. Preparata
1983	J	`jnl`	A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers. IEEE Trans. Computers Franco P. Preparata
1983	J	`jnl`	Area-Time Optimal VLSI Circuits for Convolution. IEEE Trans. Computers Gérard M. Baudet, Franco P. Preparata, Jean Vuillemin
1983	J	`jnl`	Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time Inf. Control. Kurt Mehlhorn, Franco P. Preparata
1983	J	`jnl`	Optimal Off-Line Detection of Repetitions in a String. Theor. Comput. Sci. Alberto Apostolico, Franco P. Preparata
1983	J	`jnl`	Optimal Three-Dimensional VLSI Layouts. Math. Syst. Theory Franco P. Preparata
1982	J	`jnl`	An Improved Algorithm for the Rectangle Enclosure Problem. J. Algorithms D. T. Lee, Franco P. Preparata
1982	J	`jnl`	Approximation Algorithms for Convex Hulls. Commun. ACM Jon Louis Bentley, Mark G. Faust, Franco P. Preparata
1982	J	`jnl`	Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles. J. Algorithms Witold Lipski Jr., Franco P. Preparata
1982	J	`jnl`	Plane-Sweep Algorithms for Intersecting Geometric Figures. Commun. ACM Jürg Nievergelt, Franco P. Preparata
1982	J	`jnl`	Stabbing Line Segments. BIT Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
1982	A*	`conf`	Three Layers Are Enough FOCS Franco P. Preparata, Witold Lipski Jr.
1981	J	`jnl`	A New Approach to Planar Point Location. SIAM J. Comput. Franco P. Preparata
1981	A*	`conf`	Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. ICALP Franco P. Preparata, Jean Vuillemin
1981	J	`jnl`	Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems. Acta Informatica Witold Lipski Jr., Franco P. Preparata
1981	J	`jnl`	Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles. J. Algorithms Witold Lipski Jr., Franco P. Preparata
1981	B	`conf`	Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. WG D. T. Lee, Franco P. Preparata
1981	J	`jnl`	Segments, Rectangles, Contours. J. Algorithms Witold Lipski Jr., Franco P. Preparata
1981	J	`jnl`	Testing a Simple Polygon for Monotonicity. Inf. Process. Lett. Franco P. Preparata, Kenneth J. Supowit
1981	J	`jnl`	The Cube-Connected Cycles: A Versatile Network for Parallel Computation. Commun. ACM Franco P. Preparata, Jean Vuillemin
1980	J	`jnl`	Area-Time Optimal VLSI Networks for Multiplying Matrices. Inf. Process. Lett. Franco P. Preparata, Jean Vuillemin
1980	J	`jnl`	Finding the Contour of a Union of Iso-Oriented Rectangles. J. Algorithms Witold Lipski Jr., Franco P. Preparata
1979	J	`jnl`	A Note on Locating a Set of Points in a Planar Subdivision. SIAM J. Comput. Franco P. Preparata
1979	J	`jnl`	An Optimal Algorithm for Finding the Kernel of a Polygon. J. ACM D. T. Lee, Franco P. Preparata
1979	J	`jnl`	An Optimal Real-Time Algorithm for Planar Convex Hulls. Commun. ACM Franco P. Preparata
1979	J	`jnl`	Finding the Intersection of n Half-Spaces in Time O(n log n). Theor. Comput. Sci. Franco P. Preparata, David E. Muller
1979	A*	`conf`	The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract) FOCS Franco P. Preparata, Jean Vuillemin
1978	J	`jnl`	An Improved Parallel Processor Bound in Fast Matrix Inversion. Inf. Process. Lett. Franco P. Preparata, Dilip V. Sarwate
1978	J	`jnl`	Finding the Intersection of two Convex Polyhedra. Theor. Comput. Sci. David E. Muller, Franco P. Preparata
1978	J	`jnl`	Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
1978	J	`jnl`	New Parallel-Sorting Schemes. IEEE Trans. Computers Franco P. Preparata
1978	J	`jnl`	Spectrum Shaping with Alphabetic Codes with Finite Autocorrelation Sequence. IEEE Trans. Commun. Val Anthony DiEuliis, Franco P. Preparata
1978	J	`jnl`	The All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. D. T. Lee, Franco P. Preparata
1978	J	`jnl`	The Densest Hemisphere Problem. Theor. Comput. Sci. David S. Johnson, Franco P. Preparata
1978	J	`jnl`	Triangulating a Simple Polygon. Inf. Process. Lett. M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan
1977	J	`jnl`	Convex Hulls of Finite Sets of Poin ts in Two and Three Dimensions. Commun. ACM Franco P. Preparata, S. J. Hong
1977	J	`jnl`	Location of a Point in a Planar Subdivision and Its Applications. SIAM J. Comput. D. T. Lee, Franco P. Preparata
1977	J	`jnl`	Reduction of Depth of Boolean Networks with a Fan-In Constraint. IEEE Trans. Computers Franco P. Preparata, David E. Muller, Amnon Barak
1977	B	`conf`	The Medial Axis of a Simple Polygon. MFCS Franco P. Preparata
1976	J	`jnl`	Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. Theor. Comput. Sci. Franco P. Preparata
1976	J	`jnl`	Efficient Parallel Evaluation of Boolean Expression. IEEE Trans. Computers Franco P. Preparata, David E. Muller
1976	A*	`conf`	Location of a Point in a Planar Subdivision and its Applications STOC D. T. Lee, Franco P. Preparata
1976	J	`jnl`	Restructuring of Arithmetic Expressions For Parallel Evaluation. J. ACM David E. Muller, Franco P. Preparata
1976	J	`jnl`	Storage for Consecutive Retrieval. Inf. Process. Lett. Fabrizio Luccio, Franco P. Preparata
1975	J	`jnl`	A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. Theor. Comput. Sci. Franco P. Preparata
1975	J	`jnl`	Bounds to Complexities of Networks for Sorting and for Switching. J. ACM David E. Muller, Franco P. Preparata
1975	J	`jnl`	On Finding the Maxima of a Set of Vectors. J. ACM H. T. Kung, Fabrizio Luccio, Franco P. Preparata
1975	J	`jnl`	The Time Required to Evaluate Division-Free Arithmetic Expressions. Inf. Process. Lett. Franco P. Preparata, David E. Muller
1974	J	`jnl`	Difference-preserving codes. IEEE Trans. Inf. Theory Franco P. Preparata, Jürg Nievergelt
1972	J	`jnl`	An approach to artificial nonsymbolic cognition. Inf. Sci. Franco P. Preparata, Sylvian R. Ray
1972	J	`jnl`	Continuously Valued Logic. J. Comput. Syst. Sci. Franco P. Preparata, Raymond T. Yeh
1972	J	`jnl`	Universal Logic Modules of a New Type. IEEE Trans. Computers Franco P. Preparata
1971	J	`jnl`	On the Delay Required to Realize Boolean Functions. IEEE Trans. Computers Franco P. Preparata, David E. Muller
1971	J	`jnl`	On the Design of Universal Boolean Functions. IEEE Trans. Computers Franco P. Preparata
1971	J	`jnl`	Some Results in the Theory of Arithmetic Codes Inf. Control. Robert T. Chien, S. J. Hong, Franco P. Preparata
1970	J	`jnl`	A new look at the Golay (23, 12) code (Corresp.). IEEE Trans. Inf. Theory Franco P. Preparata
1970	J	`jnl`	Generation of Near-Optimal Universal Boolean Functions. J. Comput. Syst. Sci. Franco P. Preparata, David E. Muller
1970	J	`jnl`	R70-28 A Note on Definite Stochastic Sequential Machines. IEEE Trans. Computers Franco P. Preparata
1968	J	`jnl`	A Class of Optimum Nonlinear Double-Error-Correcting Codes Inf. Control. Franco P. Preparata
1968	J	`jnl`	Convolutional Transformation and Recovery of Binary Sequences. IEEE Trans. Computers Franco P. Preparata
1968	J	`jnl`	Erratum, "Weight and Distance Structure of Nordstrom-Robinson Quadratic Code" Inf. Control. Franco P. Preparata
1968	J	`jnl`	Weight and Distance Structure of Nordstrom-Robinson Quadratic Code Inf. Control. Franco P. Preparata
1967	J	`jnl`	On the Connection Assignment Problem of Diagnosable Systems. IEEE Trans. Electron. Comput. Franco P. Preparata, Gernot Metze, Robert T. Chien
1966	J	`jnl`	Convolutional Transformations of Binary Sequences: Boolean Functions and Their Resynchronizing Properties. IEEE Trans. Electron. Comput. Franco P. Preparata
1965	J	`jnl`	On the Realizability of Special Classes of Autonomous Sequential Networks. IEEE Trans. Electron. Comput. Franco P. Preparata
1964	J	`jnl`	A synthesis procedure of recurrent codes (Corresp.). IEEE Trans. Inf. Theory Franco P. Preparata
1964	J	`jnl`	State-Logic Relations for Autonomous Sequential Networks. IEEE Trans. Electron. Comput. Franco P. Preparata