| 2008 | Algosensors | Algorithms for Location Estimation Based on RSSI Sampling. | Charalampos Papamanthou, Franco P. Preparata, Roberto Tamassia |
| 2006 | CIAC | Beware of the Model: Reflections on Algorithmic Research. | Franco P. Preparata |
| 2006 | COCOON | The Unpredictable Deviousness of Models. | Franco P. Preparata |
| 2002 | RECOMB | Sequencing by hybridization using direct and reverse cooperating spectra. | Samuel A. Heath, Franco P. Preparata, Joel Young |
| 2002 | WABI | On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization. | Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy |
| 2001 | COCOON | Enhanced Sequence Reconstruction with DNA Microarray Application. | Samuel A. Heath, Franco P. Preparata |
| 2000 | RECOMB | Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. | Franco P. Preparata, Eli Upfal |
| 2000 | SODA | Evaluating the cylindricity of a nominally cylindrical point set. | Olivier Devillers, Franco P. Preparata |
| 1999 | RECOMB | On the power of universal bases in sequencing by hybridization. | Franco P. Preparata, Alan M. Frieze, Eli Upfal |
| 1997 | WADS | Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). | Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia |
| 1995 | ARITH | O(n)-depth circuit algorithm for modular exponentiation. | Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata |
| 1995 | ISAAC | Should Amdahl's Law Be Repealed? (Abstract). | Franco P. Preparata |
| 1995 | STACS | Generalized Scans and Tri-Diagonal Systems. | Paul F. Fischer, Franco P. Preparata, John E. Savage |
| 1995 | SPAA | Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. | Gianfranco Bilardi, Franco P. Preparata |
| 1995 | WADS | Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. | Gianfranco Bilardi, Franco P. Preparata |
| 1993 | SODA | A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. | Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia |
| 1993 | STACS | On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. | Andrea Pietracaprina, Franco P. Preparata |
| 1993 | SPAA | A Practical Constructive Scheme for Deterministic Shared-Memory Access. | Andrea Pietracaprina, Franco P. Preparata |
| 1992 | ICRA | Motion planning for spider robots. | Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata |
| 1992 | STACS | A Simplified Technique for Hidden-Line Elimination in Terrains. | Franco P. Preparata, Jeffrey Scott Vitter |
| 1992 | SPAA | Supereffective Slow-Down of Parallel Computations. | Victor Y. Pan, Franco P. Preparata |
| 1989 | STACS | On the Boundary of a Union of Rays. | Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata |
| 1989 | STACS | Dynamic Planar Point Location with Optimal Query Time. | Franco P. Preparata, Roberto Tamassia |
| 1989 | SPAA | Deterministic P-RAM Simulation with Constant Redundancy. | Scot W. Hornick, Franco P. Preparata |
| 1989 | WADS | Efficient Spatial Point Location (Extended Abstract). | Franco P. Preparata, Roberto Tamassia |
| 1988 | FOCS | Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract) | Franco P. Preparata, Roberto Tamassia |
| 1988 | ICCD | Interconnection delay in very high-speed VLSI. | D. Zhou, Franco P. Preparata, S. M. Kang |
| 1988 | ISSAC | Tetrahedrizing Point Sets in Three Dimensions. | Herbert Edelsbrunner, Franco P. Preparata |
| 1987 | STOC | Size-Time Complexity of Boolean Networks for Prefix Computations | Gianfranco Bilardi, Franco P. Preparata |
| 1986 | MFCS | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. | Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata |
| 1986 | STACS | Area-time Optimal Division for T=Omega(log n) | Kurt Mehlhorn, Franco P. Preparata |
| 1985 | ICALP | The Influence of Key Length on the Area-Time Complexity of Sorting. | Gianfranco Bilardi, Franco P. Preparata |
| 1984 | ICALP | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. | Kurt Mehlhorn, Franco P. Preparata |
| 1984 | MFCS | VLSI Algorithms and Architectures. | Franco P. Preparata |
| 1984 | STOC | A Minimum Area VLSI Network for O(log n) Time Sorting | Gianfranco Bilardi, Franco P. Preparata |
| 1982 | FOCS | Three Layers Are Enough | Franco P. Preparata, Witold Lipski Jr. |
| 1981 | ICALP | Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. | Franco P. Preparata, Jean Vuillemin |
| 1981 | WG | Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. | D. T. Lee, Franco P. Preparata |
| 1979 | FOCS | The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract) | Franco P. Preparata, Jean Vuillemin |
| 1977 | MFCS | The Medial Axis of a Simple Polygon. | Franco P. Preparata |
| 1976 | STOC | Location of a Point in a Planar Subdivision and its Applications | D. T. Lee, Franco P. Preparata |