default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranco P. Preparata
2010 – 2019
- 2013
[j133]Franco P. Preparata:
On Contigs and Coverage. J. Comput. Biol. 20(6): 424-432 (2013)- 2012
- [j132]Franco P. Preparata:
Accurate and precise aggregation counting. J. Comput. Syst. Sci. 78(1): 192-197 (2012) - 2011
- [j131]Franco P. Preparata:
Steps Toward Unraveling a Vatican Cipher of the 1930s. Cryptologia 35(3): 223-234 (2011) - [r1]Franco P. Preparata:
VLSI Computation. Encyclopedia of Parallel Computing 2011: 2142-2149
2000 – 2009
- 2009
- [j130]Franco P. Preparata:
The evolving profile and role of computer science. Sci. China Ser. F Inf. Sci. 52(10): 1778-1784 (2009) - [c59]Franco P. Preparata:
Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction. Efficient Algorithms 2009: 158-169 - 2008
- [j129]Huy Hoang Do, Kwok Pui Choi, Franco P. Preparata, Wing-Kin Sung
, Louxin Zhang:
Spectrum-Based De Novo Repeat Detection in Genomic Sequences. J. Comput. Biol. 15(5): 469-488 (2008) - [j128]Franco P. Preparata:
The unpredictable deviousness of models. Theor. Comput. Sci. 408(2-3): 99-105 (2008) - [c58]Charalampos Papamanthou, Franco P. Preparata, Roberto Tamassia:
Algorithms for Location Estimation Based on RSSI Sampling. ALGOSENSORS 2008: 72-86 - [e2]Franco P. Preparata, Xiaodong Wu, Jianping Yin:
Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings. Lecture Notes in Computer Science 5059, Springer 2008, ISBN 978-3-540-69310-9 [contents] - 2007
- [j127]Nevzat Onur Domaniç, Franco P. Preparata:
A Novel Approach to the Detection of Genomic Approximate Tandem Repeats in the Levenshtein Metric. J. Comput. Biol. 14(7): 873-891 (2007) - [e1]Franco P. Preparata, Qizhi Fang:
Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings. Lecture Notes in Computer Science 4613, Springer 2007, ISBN 978-3-540-73813-8 [contents] - 2006
- [c57]Franco P. Preparata:
Beware of the Model: Reflections on Algorithmic Research. CIAC 2006: 3-4 - [c56]Franco P. Preparata:
The Unpredictable Deviousness of Models. COCOON 2006: 1 - 2005
- [j126]Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy:
Adaptive Control of Hybridization Noise in Dna Sequencing-by-hybridization. J. Bioinform. Comput. Biol. 3(1): 79-98 (2005) - [j125]Franco P. Preparata, Louxin Zhang, Kwok Pui Choi:
Quick, Practical Selection of Effective Seeds for Homology Search. J. Comput. Biol. 12(9): 1137-1152 (2005) - 2004
- [j124]Franco P. Preparata, John S. Oliver:
DNA Sequencing by Hybridization Using Semi-Degenerate Bases. J. Comput. Biol. 11(4): 753-765 (2004) - [j123]Franco P. Preparata:
Sequencing-by-Hybridization Revisited: The Analog-Spectrum Proposal. IEEE ACM Trans. Comput. Biol. Bioinform. 1(1): 46-52 (2004) - 2003
- [j122]Olivier Devillers, Bernard Mourrain, Franco P. Preparata, Philippe Trebuchet:
Circular Cylinders through Four or Five Points in Space. Discret. Comput. Geom. 29(1): 83-104 (2003) - [j121]Olivier Devillers, Franco P. Preparata:
Culling a Set of Points for Roundness or Cylindricity Evaluations. Int. J. Comput. Geom. Appl. 13(3): 231-240 (2003) - [j120]Samuel A. Heath, Franco P. Preparata, Joel Young:
Sequencing by Hybridization by Cooperating Direct and Reverse Spectra. J. Comput. Biol. 10(3/4): 499-508 (2003) - 2002
- [c55]Samuel A. Heath, Franco P. Preparata, Joel Young:
Sequencing by hybridization using direct and reverse cooperating spectra. RECOMB 2002: 186-193 - [c54]Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy:
On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization. WABI 2002: 392-403 - 2001
- [j119]Bruno Codenotti, Mauro Leoncini, Franco P. Preparata:
The Role of Arithmetic in Fast Parallel Matrix Inversion. Algorithmica 30(4): 685-707 (2001) - [j118]Paul F. Fischer, Franco P. Preparata, John E. Savage:
Generalized scans and tridiagonal systems. Theor. Comput. Sci. 255(1-2): 423-436 (2001) - [c53]Samuel A. Heath, Franco P. Preparata:
Enhanced Sequence Reconstruction with DNA Microarray Application. COCOON 2001: 64-74 - 2000
- [j117]Franco P. Preparata, Eli Upfal:
Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. J. Comput. Biol. 7(3-4): 621-630 (2000) - [j116]Jean-Daniel Boissonnat, Franco P. Preparata:
Robust Plane Sweep for Intersecting Segments. SIAM J. Comput. 29(5): 1401-1421 (2000) - [c52]Franco P. Preparata, Eli Upfal:
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. RECOMB 2000: 245-253 - [c51]Olivier Devillers, Franco P. Preparata:
Evaluating the cylindricity of a nominally cylindrical point set. SODA 2000: 518-527
1990 – 1999
- 1999
- [j115]Olivier Devillers, Franco P. Preparata:
Further results on arithmetic filters for geometric predicates. Comput. Geom. 13(2): 141-148 (1999) - [j114]Alan M. Frieze, Franco P. Preparata, Eli Upfal:
Optimal Reconstruction of a Sequence from its Probes. J. Comput. Biol. 6(3/4): 361-368 (1999) - [j113]Gianfranco Bilardi, Franco P. Preparata:
Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. Theory Comput. Syst. 32(5): 531-559 (1999) - [c50]Franco P. Preparata, Alan M. Frieze, Eli Upfal:
On the power of universal bases in sequencing by hybridization. RECOMB 1999: 295-301 - [i2]Olivier Devillers, Franco P. Preparata:
Further Results on Arithmetic Filters for Geometric Predicates. CoRR cs.CG/9907028 (1999) - [i1]Olivier Devillers, Franco P. Preparata:
A Probabilistic Analysis of the Power of Arithmetic Filters. CoRR cs.CG/9907029 (1999) - 1998
- [j112]Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. 11(3-4): 187-208 (1998) - [j111]Olivier Devillers, Franco P. Preparata:
A Probabilistic Analysis of the Power of Arithmetic Filters. Discret. Comput. Geom. 20(4): 523-547 (1998) - [j110]Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SIAM J. Comput. 28(3): 864-889 (1998) - 1997
- [j109]Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec:
Evaluating Signs of Determinants Using Single-Precision Arithmetic. Algorithmica 17(2): 111-132 (1997) - [j108]Andrea Pietracaprina, Franco P. Preparata:
Practical Constructive Schemes for Deterministic Shared-Memory Access. Theory Comput. Syst. 30(1): 3-37 (1997) - [j107]Gianfranco Bilardi, Franco P. Preparata:
Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Syst. 30(6): 523-546 (1997) - [j106]Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata:
O(n)-Depth Modular Exponentiation Circuit Algorithm. IEEE Trans. Computers 46(6): 701-704 (1997) - [c49]Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SCG 1997: 156-165 - [c48]Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). WADS 1997: 186-199 - 1996
- [j105]Alberto Apostolico, Franco P. Preparata:
Data Structures and Algorithms for the String Statistics Problem. Algorithmica 15(5): 481-494 (1996) - [j104]Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia:
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SIAM J. Comput. 25(1): 207-233 (1996) - [c47]Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata:
Robust Proximity Queries in Implicit Voronoi Diagrams. CCCG 1996: 1 - [c46]Franco P. Preparata:
Robustness in Geometric Algorithms. WACG 1996: 23-24 - 1995
- [j103]Nancy M. Amato, Franco P. Preparata:
A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls. Algorithmica 14(2): 169-182 (1995) - [j102]Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata:
Motion planning of legged robots: the spider robot problem. Int. J. Comput. Geom. Appl. 5: 3-20 (1995) - [j101]Gianfranco Bilardi, Franco P. Preparata:
Horizons of Parallel Computation. J. Parallel Distributed Comput. 27(2): 172-182 (1995) - [j100]Victor Y. Pan, Franco P. Preparata:
Work-Preserving Speed-Up of Parallel Matrix Computations. SIAM J. Comput. 24(4): 811-821 (1995) - [c45]Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata:
O(n)-depth circuit algorithm for modular exponentiation. IEEE Symposium on Computer Arithmetic 1995: 188-192 - [c44]Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec:
Evaluation of a New Method to Compute Signs of Determinants. SCG 1995: C16-C17 - [c43]Franco P. Preparata:
Should Amdahl's Law Be Repealed? (Abstract). ISAAC 1995: 311 - [c42]Gianfranco Bilardi, Franco P. Preparata:
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. SPAA 1995: 185-194 - [c41]Paul F. Fischer, Franco P. Preparata, John E. Savage:
Generalized Scans and Tri-Diagonal Systems. STACS 1995: 168-180 - [c40]Gianfranco Bilardi, Franco P. Preparata:
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. WADS 1995: 1-12 - 1994
- [j99]Ravi Janardan, Franco P. Preparata:
Widest-Corridor Problems. Nord. J. Comput. 1(2): 231-245 (1994) - 1993
- [j98]Franco P. Preparata, Jeffrey Scott Vitter:
A Simplified Technique for Hidden-Line Elimination in Terrains. Int. J. Comput. Geom. Appl. 3(2): 167-181 (1993) - [c39]Ravi Janardan, Franco P. Preparata:
Widest-corridor Problems. CCCG 1993: 426-431 - [c38]Nancy M. Amato, Franco P. Preparata:
An NC Parallel 3D Convex Hull Algorithm. SCG 1993: 289-297 - [c37]Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia:
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SODA 1993: 44-53 - [c36]Andrea Pietracaprina, Franco P. Preparata:
A Practical Constructive Scheme for Deterministic Shared-Memory Access. SPAA 1993: 100-109 - [c35]Andrea Pietracaprina, Franco P. Preparata:
On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. STACS 1993: 110-119 - [p1]D. Zhou, Franco P. Preparata:
On the Manhattan and knock-knee Routing Models. Algorithmic Aspects of VLSI Layout 1993: 245-264 - 1992
- [j97]Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec:
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. Algorithmica 8(4): 257-283 (1992) - [j96]Nancy M. Amato, Franco P. Preparata:
The parallel 3D convex hull problem revisited. Int. J. Comput. Geom. Appl. 2(2): 163-173 (1992) - [j95]David E. Muller, Franco P. Preparata:
Parallel Restructuring and Evaluation of Expressions. J. Comput. Syst. Sci. 44(1): 43-62 (1992) - [j94]Franco P. Preparata, Roberto Tamassia:
Efficient Point Location in a Convex Spatial Cell-Complex. SIAM J. Comput. 21(2): 267-280 (1992) - [c34]Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata:
Stable Placements for Spider Robots. SCG 1992: 242-250 - [c33]Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata:
Motion planning for spider robots. ICRA 1992: 2321-2326 - [c32]Franco P. Preparata, Gianfranco Bilardi:
Horizons of Parallel Computation. 25th Anniversary of INRIA 1992: 155-174 - [c31]Franco P. Preparata:
Frontiers of Parallel Computing. Heinz Nixdorf Symposium 1992: 47 - [c30]Victor Y. Pan, Franco P. Preparata:
Supereffective Slow-Down of Parallel Computations. SPAA 1992: 402-409 - [c29]Franco P. Preparata, Jeffrey Scott Vitter:
A Simplified Technique for Hidden-Line Elimination in Terrains. STACS 1992: 135-146 - 1991
- [j93]Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata:
An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum. Algorithmica 6(2): 292-293 (1991) - [j92]Scot W. Hornick, Franco P. Preparata:
Deterministic P-RAM Simulation with Constant Redundancy. Inf. Comput. 92(1): 81-96 (1991) - [j91]Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata:
Computing the union of 3-colored triangles. Int. J. Comput. Geom. Appl. 1(2): 187-196 (1991) - [j90]Franco P. Preparata:
Inverting a Vandermonde Matrix in Minimum Parallel Time. Inf. Process. Lett. 38(6): 291-294 (1991) - 1990
- [j89]Roberto Tamassia, Franco P. Preparata:
Dynamic Maintenance of Planar Digraphs, with Applications. Algorithmica 5(4): 509-527 (1990) - [j88]Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata:
An Optimal Algorithm for the Boundary of a Cell in a Union of Rays. Algorithmica 5(4): 573-590 (1990) - [j87]Franco P. Preparata:
Planar Point Location Revisited (Review Paper). Int. J. Found. Comput. Sci. 1(1): 71-86 (1990) - [j86]Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West:
Tetrahedrizing Point Sets in Three Dimensions. J. Symb. Comput. 10(3/4): 335-348 (1990) - [j85]Gianfranco Bilardi, Franco P. Preparata:
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. SIAM J. Comput. 19(2): 246-255 (1990) - [j84]Franco P. Preparata, Jean Vuillemin:
Practical Cellular Dividers. IEEE Trans. Computers 39(5): 605-614 (1990) - [j83]Franco P. Preparata, Roberto Tamassia:
Dynamic Planar Point Location with Optimal Query Time. Theor. Comput. Sci. 74(1): 95-114 (1990) - [j82]Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec:
Computation of the axial view of a set of isothetic parallelepipeds. ACM Trans. Graph. 9(3): 278-300 (1990) - [c28]Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec:
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. SWAT 1990: 71-84
1980 – 1989
- 1989
- [j81]D. T. Lee, Franco P. Preparata:
Parallel Batched Planar Point Location on the CCC. Inf. Process. Lett. 33(4): 175-179 (1989) - [j80]Gianfranco Bilardi, Franco P. Preparata:
Size-time complexity of Boolean networks for prefix computations. J. ACM 36(2): 362-382 (1989) - [j79]Franco P. Preparata, Roberto Tamassia:
Fully Dynamic Point Location in a Monotone Subdivision. SIAM J. Comput. 18(4): 811-830 (1989) - [j78]Franco P. Preparata:
Holographic dispersal and recovery of information. IEEE Trans. Inf. Theory 35(5): 1123-1124 (1989) - [c27]Elena Lodi, Franco P. Preparata:
A Heuristic for Channel Routing. FODO 1989: 155-170 - [c26]Scot W. Hornick, Franco P. Preparata:
Deterministic P-RAM Simulation with Constant Redundancy. SPAA 1989: 103-109 - [c25]Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata:
On the Boundary of a Union of Rays. STACS 1989: 72-83 - [c24]Franco P. Preparata, Roberto Tamassia:
Dynamic Planar Point Location with Optimal Query Time. STACS 1989: 84-95 - [c23]Franco P. Preparata, Roberto Tamassia:
Efficient Spatial Point Location (Extended Abstract). WADS 1989: 3-11 - 1988
- [j77]Herbert Edelsbrunner, Franco P. Preparata:
Minimum Polygonal Separation. Inf. Comput. 77(3): 218-232 (1988) - [c22]Franco P. Preparata, Roberto Tamassia:
Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract). FOCS 1988: 558-567 - [c21]Franco P. Preparata:
Planar Point Location Revisited (A Guided Tour of a Decade of Research). FSTTCS 1988: 1-17 - [c20]Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata:
An optimal algorithm for the boundary of a cell in a union of rays. Geometry and Robotics 1988: 247-274 - [c19]D. Zhou, Franco P. Preparata, S. M. Kang:
Interconnection delay in very high-speed VLSI. ICCD 1988: 52-55 - [c18]Herbert Edelsbrunner, Franco P. Preparata:
Tetrahedrizing Point Sets in Three Dimensions. ISSAC 1988: 315-331 - 1987
- [j76]Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal Division for T=Omega((log n)^1+ epsilon). Inf. Comput. 72(3): 270-282 (1987) - [j75]Majid Sarrafzadeh, Franco P. Preparata:
A bottom-up layout technique based on two-rectangle routing. Integr. 5(3-4): 231-246 (1987) - [j74]Witold Lipski Jr., Franco P. Preparata:
A Unified Approach to Layout Wirability. Math. Syst. Theory 19(3): 189-203 (1987) - [j73]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987) - [c17]David E. Muller, Franco P. Preparata:
Toward a switching theory of CMOS circuits. FJCC 1987: 347-348 - [c16]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15 - [c15]Gianfranco Bilardi, Franco P. Preparata:
Size-Time Complexity of Boolean Networks for Prefix Computations. STOC 1987: 436-442 - 1986
- [j72]Gianfranco Bilardi, Franco P. Preparata:
Area-Time Lower-Bound Techniques with Applications to Sorting. Algorithmica 1(1): 65-91 (1986) - [j71]Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh:
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1(2): 213-221 (1986) - [j70]Bernard Chazelle, Franco P. Preparata:
Halfspace Range Search: An Algorithmic Application of k-Sets. Discret. Comput. Geom. 1: 83-93 (1986) - [j69]Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap:
New Upper Bounds for Neighbor Searching. Inf. Control. 68(1-3): 105-124 (1986) - [j68]Kurt Mehlhorn, Franco P. Preparata:
Routing through a rectangle. J. ACM 33(1): 60-85 (1986) - [c14]Gianfranco Bilardi, Franco P. Preparata:
Digital Filtering in VLSI. Aegean Workshop on Computing 1986: 1-11 - [c13]Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208 - [c12]Kurt Mehlhorn, Franco P. Preparata:
Area-time Optimal Division for T=Omega(log n)1+epsilon. STACS 1986: 341-352 - 1985
- [b1]Franco P. Preparata, Michael Ian Shamos:
Computational Geometry - An Introduction. Texts and Monographs in Computer Science, Springer 1985, ISBN 3-540-96131-3, pp. i-xiv, 1-373 - [j67]Gianfranco Bilardi, Franco P. Preparata:
The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. 20(2): 55-59 (1985) - [j66]Alberto Apostolico, Franco P. Preparata:
Structural Properties of the String Statistics Problem. J. Comput. Syst. Sci. 31(3): 394-411 (1985) - [j65]Gianfranco Bilardi, Franco P. Preparata:
A Minimum Area VLSI Network for O(log n) Time Sorting. IEEE Trans. Computers 34(4): 336-343 (1985) - [c11]Bernard Chazelle, Franco P. Preparata:
Halfspace range search: an algorithmic application of K-sets. SCG 1985: 107-115 - [c10]Gianfranco Bilardi, Franco P. Preparata:
The Influence of Key Length on the Area-Time Complexity of Sorting. ICALP 1985: 53-62 - 1984
- [j64]D. T. Lee, Franco P. Preparata:
Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3): 393-410 (1984) - [j63]Franco P. Preparata, Witold Lipski Jr.:
Optimal Three-Layer Channel Routing. IEEE Trans. Computers 33(5): 427-437 (1984) - [j62]Gianfranco Bilardi, Franco P. Preparata:
An Architecture for Bitonic Sorting with Optimal VLSI Performance. IEEE Trans. Computers 33(7): 646-651 (1984) - [j61]D. T. Lee, Franco P. Preparata:
Computational Geometry - A Survey. IEEE Trans. Computers 33(12): 1072-1101 (1984) - [c9]Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. ICALP 1984: 347-357 - [c8]Franco P. Preparata:
VLSI Algorithms and Architectures. MFCS 1984: 149-161 - [c7]Gianfranco Bilardi, Franco P. Preparata:
A Minimum Area VLSI Network for O(log n) Time Sorting. STOC 1984: 64-70 - 1983
- [j60]Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. Inf. Control. 58(1-3): 137-156 (1983) - [j59]Franco P. Preparata:
Optimal Three-Dimensional VLSI Layouts. Math. Syst. Theory 16(1): 1-8 (1983) - [j58]Franco P. Preparata:
A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers. IEEE Trans. Computers 32(2): 194-198 (1983) - [j57]Gérard M. Baudet, Franco P. Preparata, Jean Vuillemin:
Area-Time Optimal VLSI Circuits for Convolution. IEEE Trans. Computers 32(7): 684-688 (1983) - [j56]Alberto Apostolico, Franco P. Preparata:
Optimal Off-Line Detection of Repetitions in a String. Theor. Comput. Sci. 22: 297-315 (1983) - 1982
- [j55]Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood:
Stabbing Line Segments. BIT 22(3): 274-281 (1982) - [j54]Jon Louis Bentley, Mark G. Faust, Franco P. Preparata:
Approximation Algorithms for Convex Hulls. Commun. ACM 25(1): 64-68 (1982) - [j53]Jürg Nievergelt, Franco P. Preparata:
Plane-Sweep Algorithms for Intersecting Geometric Figures. Commun. ACM 25(10): 739-747 (1982) - [j52]D. T. Lee, Franco P. Preparata:
An Improved Algorithm for the Rectangle Enclosure Problem. J. Algorithms 3(3): 218-224 (1982) - [j51]Witold Lipski Jr., Franco P. Preparata:
Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles. J. Algorithms 3(3): 301-302 (1982) - [c6]Franco P. Preparata, Witold Lipski Jr.:
Three Layers Are Enough. FOCS 1982: 350-357 - 1981
- [j50]Witold Lipski Jr., Franco P. Preparata:
Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems. Acta Informatica 15: 329-346 (1981) - [j49]Franco P. Preparata, Jean Vuillemin:
The Cube-Connected Cycles: A Versatile Network for Parallel Computation. Commun. ACM 24(5): 300-309 (1981) - [j48]Franco P. Preparata, Kenneth J. Supowit:
Testing a Simple Polygon for Monotonicity. Inf. Process. Lett. 12(4): 161-164 (1981) - [j47]Witold Lipski Jr., Franco P. Preparata:
Segments, Rectangles, Contours. J. Algorithms 2(1): 63-76 (1981) - [j46]Witold Lipski Jr., Franco P. Preparata:
Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles. J. Algorithms 2(1): 105 (1981) - [j45]Franco P. Preparata:
A New Approach to Planar Point Location. SIAM J. Comput. 10(3): 473-482 (1981) - [c5]Franco P. Preparata, Jean Vuillemin:
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. ICALP 1981: 29-40 - [c4]D. T. Lee, Franco P. Preparata:
Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. WG 1981: 303-314 - 1980
- [j44]Franco P. Preparata, Jean Vuillemin:
Area-Time Optimal VLSI Networks for Multiplying Matrices. Inf. Process. Lett. 11(2): 77-80 (1980) - [j43]Witold Lipski Jr., Franco P. Preparata:
Finding the Contour of a Union of Iso-Oriented Rectangles. J. Algorithms 1(3): 235-246 (1980)
1970 – 1979
- 1979
- [j42]Franco P. Preparata:
An Optimal Real-Time Algorithm for Planar Convex Hulls. Commun. ACM 22(7): 402-405 (1979) - [j41]D. T. Lee, Franco P. Preparata:
An Optimal Algorithm for Finding the Kernel of a Polygon. J. ACM 26(3): 415-421 (1979) - [j40]Franco P. Preparata:
A Note on Locating a Set of Points in a Planar Subdivision. SIAM J. Comput. 8(4): 542-545 (1979) - [j39]Franco P. Preparata, David E. Muller:
Finding the Intersection of n Half-Spaces in Time O(n log n). Theor. Comput. Sci. 8: 45-55 (1979) - [c3]Franco P. Preparata, Jean Vuillemin:
The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract). FOCS 1979: 140-147 - 1978
- [j38]Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo:
Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica 11: 61-77 (1978) - [j37]Franco P. Preparata, Dilip V. Sarwate:
An Improved Parallel Processor Bound in Fast Matrix Inversion. Inf. Process. Lett. 7(3): 148-150 (1978) - [j36]M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan:
Triangulating a Simple Polygon. Inf. Process. Lett. 7(4): 175-179 (1978) - [j35]D. T. Lee, Franco P. Preparata:
The All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 7(4): 189-192 (1978) - [j34]Franco P. Preparata:
New Parallel-Sorting Schemes. IEEE Trans. Computers 27(7): 669-673 (1978) - [j33]Val Anthony DiEuliis, Franco P. Preparata:
Spectrum Shaping with Alphabetic Codes with Finite Autocorrelation Sequence. IEEE Trans. Commun. 26(4): 474-478 (1978) - [j32]David S. Johnson, Franco P. Preparata:
The Densest Hemisphere Problem. Theor. Comput. Sci. 6: 93-107 (1978) - [j31]David E. Muller, Franco P. Preparata:
Finding the Intersection of two Convex Polyhedra. Theor. Comput. Sci. 7: 217-236 (1978) - 1977
- [j30]Franco P. Preparata, S. J. Hong:
Convex Hulls of Finite Sets of Poin ts in Two and Three Dimensions. Commun. ACM 20(2): 87-93 (1977) - [j29]D. T. Lee, Franco P. Preparata:
Location of a Point in a Planar Subdivision and Its Applications. SIAM J. Comput. 6(3): 594-606 (1977) - [j28]Franco P. Preparata, David E. Muller, Amnon Barak:
Reduction of Depth of Boolean Networks with a Fan-In Constraint. IEEE Trans. Computers 26(5): 474-479 (1977) - [c2]Franco P. Preparata:
The Medial Axis of a Simple Polygon. MFCS 1977: 443-450 - 1976
- [j27]Fabrizio Luccio, Franco P. Preparata:
Storage for Consecutive Retrieval. Inf. Process. Lett. 5(3): 68-71 (1976) - [j26]David E. Muller, Franco P. Preparata:
Restructuring of Arithmetic Expressions For Parallel Evaluation. J. ACM 23(3): 534-543 (1976) - [j25]Franco P. Preparata, David E. Muller:
Efficient Parallel Evaluation of Boolean Expression. IEEE Trans. Computers 25(5): 548-549 (1976) - [j24]Franco P. Preparata:
Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. Theor. Comput. Sci. 3(1): 121 (1976) - [c1]D. T. Lee, Franco P. Preparata:
Location of a Point in a Planar Subdivision and its Applications. STOC 1976: 231-235 - 1975
- [j23]Franco P. Preparata, David E. Muller:
The Time Required to Evaluate Division-Free Arithmetic Expressions. Inf. Process. Lett. 3(5): 144-146 (1975) - [j22]David E. Muller, Franco P. Preparata:
Bounds to Complexities of Networks for Sorting and for Switching. J. ACM 22(2): 195-201 (1975) - [j21]H. T. Kung, Fabrizio Luccio, Franco P. Preparata:
On Finding the Maxima of a Set of Vectors. J. ACM 22(4): 469-476 (1975) - [j20]Franco P. Preparata:
A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. Theor. Comput. Sci. 1(2): 185-190 (1975) - 1974
- [j19]Franco P. Preparata, Jürg Nievergelt:
Difference-preserving codes. IEEE Trans. Inf. Theory 20(5): 643-649 (1974) - 1972
- [j18]Franco P. Preparata, Sylvian R. Ray:
An approach to artificial nonsymbolic cognition. Inf. Sci. 4(1): 65-86 (1972) - [j17]Franco P. Preparata, Raymond T. Yeh:
Continuously Valued Logic. J. Comput. Syst. Sci. 6(5): 397-418 (1972) - [j16]Franco P. Preparata:
Universal Logic Modules of a New Type. IEEE Trans. Computers 21(6): 585-588 (1972) - 1971
- [j15]Robert T. Chien, S. J. Hong, Franco P. Preparata:
Some Results in the Theory of Arithmetic Codes. Inf. Control. 19(3): 246-264 (1971) - [j14]Franco P. Preparata:
On the Design of Universal Boolean Functions. IEEE Trans. Computers 20(4): 418-423 (1971) - [j13]Franco P. Preparata, David E. Muller:
On the Delay Required to Realize Boolean Functions. IEEE Trans. Computers 20(4): 459-461 (1971) - 1970
- [j12]Franco P. Preparata, David E. Muller:
Generation of Near-Optimal Universal Boolean Functions. J. Comput. Syst. Sci. 4(2): 93-102 (1970) - [j11]Franco P. Preparata:
R70-28 A Note on Definite Stochastic Sequential Machines. IEEE Trans. Computers 19(8): 764-765 (1970) - [j10]Franco P. Preparata:
A new look at the Golay (23, 12) code (Corresp.). IEEE Trans. Inf. Theory 16(4): 510-511 (1970)
1960 – 1969
- 1968
- [j9]Franco P. Preparata:
Weight and Distance Structure of Nordstrom-Robinson Quadratic Code. Inf. Control. 12(5/6): 466-473 (1968) - [j8]Franco P. Preparata:
Erratum, "Weight and Distance Structure of Nordstrom-Robinson Quadratic Code". Inf. Control. 13(2): 172 (1968) - [j7]Franco P. Preparata:
A Class of Optimum Nonlinear Double-Error-Correcting Codes. Inf. Control. 13(4): 378-400 (1968) - [j6]Franco P. Preparata:
Convolutional Transformation and Recovery of Binary Sequences. IEEE Trans. Computers 17(7): 649-655 (1968) - 1967
- [j5]Franco P. Preparata, Gernot Metze, Robert T. Chien:
On the Connection Assignment Problem of Diagnosable Systems. IEEE Trans. Electron. Comput. 16(6): 848-854 (1967) - 1966
- [j4]Franco P. Preparata:
Convolutional Transformations of Binary Sequences: Boolean Functions and Their Resynchronizing Properties. IEEE Trans. Electron. Comput. 15(6): 898-908 (1966) - 1965
- [j3]Franco P. Preparata:
On the Realizability of Special Classes of Autonomous Sequential Networks. IEEE Trans. Electron. Comput. 14(6): 791-797 (1965) - 1964
- [j2]Franco P. Preparata:
State-Logic Relations for Autonomous Sequential Networks. IEEE Trans. Electron. Comput. 13(5): 542-548 (1964) - [j1]Franco P. Preparata:
A synthesis procedure of recurrent codes (Corresp.). IEEE Trans. Inf. Theory 10(4): 388-389 (1964)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
