The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Franco P. Preparata: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jürg Nievergelt, Franco P. Preparata
    Plane-Sweep Algorithms for Intersecting Geometric Figures. [Citation Graph (4, 0)][DBLP]
    Commun. ACM, 1982, v:25, n:10, pp:739-747 [Journal]
  2. David E. Muller, Franco P. Preparata
    Bounds to Complexities of Networks for Sorting and for Switching. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1975, v:22, n:2, pp:195-201 [Journal]
  3. D. T. Lee, Franco P. Preparata
    Computational Geometry - A Survey. [Citation Graph (2, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:12, pp:1072-1101 [Journal]
  4. D. T. Lee, Franco P. Preparata
    Location of a Point in a Planar Subdivision and its Applications [Citation Graph (1, 0)][DBLP]
    STOC, 1976, pp:231-235 [Conf]
  5. Alberto Apostolico, Franco P. Preparata
    Data Structures and Algorithms for the String Statistics Problem. [Citation Graph (1, 0)][DBLP]
    Algorithmica, 1996, v:15, n:5, pp:481-494 [Journal]
  6. Franco P. Preparata, Jean Vuillemin
    The Cube-Connected Cycles: A Versatile Network for Parallel Computation. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:5, pp:300-309 [Journal]
  7. Bernard Chazelle, R. Cole, Franco P. Preparata, C. Yap
    New Upper Bounds for Neighbor Searching [Citation Graph (1, 0)][DBLP]
    Information and Control, 1986, v:68, n:1-3, pp:105-124 [Journal]
  8. M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan
    Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:4, pp:175-179 [Journal]
  9. Franco P. Preparata
    New Parallel-Sorting Schemes. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1978, v:27, n:7, pp:669-673 [Journal]
  10. Franco P. Preparata, David E. Muller
    Finding the Intersection of n Half-Spaces in Time O(n log n). [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:45-55 [Journal]
  11. Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata
    O(n)-depth circuit algorithm for modular exponentiation. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Computer Arithmetic, 1995, pp:188-192 [Conf]
  12. Gianfranco Bilardi, Franco P. Preparata
    Digital Filtering in VLSI. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:1-11 [Conf]
  13. Ravi Janardan, Franco P. Preparata
    Widest-corridor Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:426-431 [Conf]
  14. Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata
    Robust Proximity Queries in Implicit Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:1-1 [Conf]
  15. Franco P. Preparata
    Beware of the Model: Reflections on Algorithmic Research. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:3-4 [Conf]
  16. Samuel A. Heath, Franco P. Preparata
    Enhanced Sequence Reconstruction with DNA Microarray Application. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:64-74 [Conf]
  17. Franco P. Preparata
    The Unpredictable Deviousness of Models. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:1- [Conf]
  18. Nancy M. Amato, Franco P. Preparata
    An NC Parallel 3D Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:289-297 [Conf]
  19. Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
    Evaluation of a New Method to Compute Signs of Determinants. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  20. Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
    Stable Placements for Spider Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:242-250 [Conf]
  21. Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:156-165 [Conf]
  22. Franco P. Preparata, Witold Lipski Jr.
    Three Layers Are Enough [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:350-357 [Conf]
  23. Franco P. Preparata, Roberto Tamassia
    Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:558-567 [Conf]
  24. Franco P. Preparata, Jean Vuillemin
    The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:140-147 [Conf]
  25. Elena Lodi, Franco P. Preparata
    A Heuristic for Channel Routing. [Citation Graph (0, 0)][DBLP]
    FODO, 1989, pp:155-169 [Conf]
  26. Franco P. Preparata
    Planar Point Location Revisited (A Guided Tour of a Decade of Research). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:1-17 [Conf]
  27. Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
    An optimal algorithm for the boundary of a cell in a union of rays. [Citation Graph (0, 0)][DBLP]
    Geometry and Robotics, 1988, pp:247-274 [Conf]
  28. Gianfranco Bilardi, Franco P. Preparata
    The Influence of Key Length on the Area-Time Complexity of Sorting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:53-62 [Conf]
  29. Kurt Mehlhorn, Franco P. Preparata
    Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:347-357 [Conf]
  30. Franco P. Preparata, Jean Vuillemin
    Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:29-40 [Conf]
  31. Franco P. Preparata, Gianfranco Bilardi
    Horizons of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    25th Anniversary of INRIA, 1992, pp:155-174 [Conf]
  32. Franco P. Preparata
    Should Amdahl's Law Be Repealed? (Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:311- [Conf]
  33. Herbert Edelsbrunner, Franco P. Preparata
    Tetrahedrizing Point Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:315-331 [Conf]
  34. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:199-208 [Conf]
  35. Franco P. Preparata
    The Medial Axis of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:443-450 [Conf]
  36. Franco P. Preparata
    VLSI Algorithms and Architectures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:149-161 [Conf]
  37. Franco P. Preparata
    Frontiers of Parallel Computing. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:47- [Conf]
  38. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:11-15 [Conf]
  39. Samuel A. Heath, Franco P. Preparata, Joel Young
    Sequencing by hybridization using direct and reverse cooperating spectra. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:186-193 [Conf]
  40. Franco P. Preparata, Alan M. Frieze, Eli Upfal
    On the power of universal bases in sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:295-301 [Conf]
  41. Franco P. Preparata, Eli Upfal
    Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:245-253 [Conf]
  42. Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
    A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:44-53 [Conf]
  43. Olivier Devillers, Franco P. Preparata
    Evaluating the cylindricity of a nominally cylindrical point set. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:518-527 [Conf]
  44. Gianfranco Bilardi, Franco P. Preparata
    Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:185-194 [Conf]
  45. Scot W. Hornick, Franco P. Preparata
    Deterministic P-RAM Simulation with Constant Redundancy. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:103-109 [Conf]
  46. Andrea Pietracaprina, Franco P. Preparata
    A Practical Constructive Scheme for Deterministic Shared-Memory Access. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:100-109 [Conf]
  47. Victor Y. Pan, Franco P. Preparata
    Supereffective Slow-Down of Parallel Computations. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:402-409 [Conf]
  48. Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
    On the Boundary of a Union of Rays. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:72-83 [Conf]
  49. Paul F. Fischer, Franco P. Preparata, John E. Savage
    Generalized Scans and Tri-Diagonal Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:168-180 [Conf]
  50. Kurt Mehlhorn, Franco P. Preparata
    Area-time Optimal Division for T=Omega(log n)1+epsilon [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:341-352 [Conf]
  51. Andrea Pietracaprina, Franco P. Preparata
    On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:110-119 [Conf]
  52. Franco P. Preparata, Roberto Tamassia
    Dynamic Planar Point Location with Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:84-95 [Conf]
  53. Franco P. Preparata, Jeffrey Scott Vitter
    A Simplified Technique for Hidden-Line Elimination in Terrains. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:135-146 [Conf]
  54. Gianfranco Bilardi, Franco P. Preparata
    A Minimum Area VLSI Network for O(log n) Time Sorting [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:64-70 [Conf]
  55. Gianfranco Bilardi, Franco P. Preparata
    Size-Time Complexity of Boolean Networks for Prefix Computations [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:436-442 [Conf]
  56. Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
    Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:71-84 [Conf]
  57. Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy
    On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:392-403 [Conf]
  58. Franco P. Preparata
    Robustness in Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:23-24 [Conf]
  59. Gianfranco Bilardi, Franco P. Preparata
    Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:1-12 [Conf]
  60. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:186-199 [Conf]
  61. Franco P. Preparata, Roberto Tamassia
    Efficient Spatial Point Location (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:3-11 [Conf]
  62. Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
    Improved Time and Space Bounds for Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1978, v:11, n:, pp:61-77 [Journal]
  63. Witold Lipski Jr., Franco P. Preparata
    Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:329-346 [Journal]
  64. Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
    An Optimal Algorithm for the Boundary of a Cell in a Union of Rays. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:4, pp:573-590 [Journal]
  65. Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
    Evaluating Signs of Determinants Using Single-Precision Arithmetic. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:2, pp:111-132 [Journal]
  66. Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
    An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:2, pp:292-293 [Journal]
  67. Nancy M. Amato, Franco P. Preparata
    A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:2, pp:169-182 [Journal]
  68. Gianfranco Bilardi, Franco P. Preparata
    Area-Time Lower-Bound Techniques with Applications to Sorting. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:65-91 [Journal]
  69. Bruno Codenotti, Mauro Leoncini, Franco P. Preparata
    The Role of Arithmetic in Fast Parallel Matrix Inversion. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:4, pp:685-707 [Journal]
  70. Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh
    Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:2, pp:213-221 [Journal]
  71. Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
    Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:4, pp:257-283 [Journal]
  72. Roberto Tamassia, Franco P. Preparata
    Dynamic Maintenance of Planar Digraphs, with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:4, pp:509-527 [Journal]
  73. Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
    Stabbing Line Segments. [Citation Graph (0, 0)][DBLP]
    BIT, 1982, v:22, n:3, pp:274-281 [Journal]
  74. Jon Louis Bentley, Mark G. Faust, Franco P. Preparata
    Approximation Algorithms for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1982, v:25, n:1, pp:64-68 [Journal]
  75. Franco P. Preparata
    An Optimal Real-Time Algorithm for Planar Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:7, pp:402-405 [Journal]
  76. Franco P. Preparata, S. J. Hong
    Convex Hulls of Finite Sets of Poin ts in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1977, v:20, n:2, pp:87-93 [Journal]
  77. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the convexity of polytopes and the planarity of subdivisions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:187-208 [Journal]
  78. Olivier Devillers, Franco P. Preparata
    Further results on arithmetic filters for geometric predicates. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:2, pp:141-148 [Journal]
  79. Olivier Devillers, Franco P. Preparata
    Further Results on Arithmetic Filters for Geometric Predicates [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  80. Olivier Devillers, Franco P. Preparata
    A Probabilistic Analysis of the Power of Arithmetic Filters [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  81. Bernard Chazelle, Franco P. Preparata
    Halfspace Range Search: An Algorithmic Application of k-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:83-93 [Journal]
  82. Olivier Devillers, Franco P. Preparata
    A Probabilistic Analysis of the Power of Arithmetic Filters. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:523-547 [Journal]
  83. Robert T. Chien, S. J. Hong, Franco P. Preparata
    Some Results in the Theory of Arithmetic Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1971, v:19, n:3, pp:246-264 [Journal]
  84. Herbert Edelsbrunner, Franco P. Preparata
    Minimum Polygonal Separation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:77, n:3, pp:218-232 [Journal]
  85. Scot W. Hornick, Franco P. Preparata
    Deterministic P-RAM Simulation with Constant Redundancy [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:1, pp:81-96 [Journal]
  86. Kurt Mehlhorn, Franco P. Preparata
    Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:58, n:1-3, pp:137-156 [Journal]
  87. Kurt Mehlhorn, Franco P. Preparata
    Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:72, n:3, pp:270-282 [Journal]
  88. Franco P. Preparata
    A Class of Optimum Nonlinear Double-Error-Correcting Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:13, n:4, pp:378-400 [Journal]
  89. Franco P. Preparata
    Weight and Distance Structure of Nordstrom-Robinson Quadratic Code [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:12, n:5/6, pp:466-473 [Journal]
  90. Franco P. Preparata
    Erratum, ``Weight and Distance Structure of Nordstrom-Robinson Quadratic Code'' [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:13, n:2, pp:172- [Journal]
  91. Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
    Motion planning of legged robots: the spider robot problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:3-20 [Journal]
  92. Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata
    Computing the union of 3-colored triangles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:2, pp:187-196 [Journal]
  93. Nancy M. Amato, Franco P. Preparata
    The parallel 3D convex hull problem revisited. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:2, pp:163-173 [Journal]
  94. Olivier Devillers, Franco P. Preparata
    Culling a Set of Points for Roundness or Cylindricity Evaluations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:3, pp:231-240 [Journal]
  95. Franco P. Preparata, Jeffrey Scott Vitter
    A Simplified Technique for Hidden-Line Elimination in Terrains. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:2, pp:167-181 [Journal]
  96. Franco P. Preparata
    Planar Point Location Revisited (Review Paper). [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:1, pp:71-0 [Journal]
  97. Gianfranco Bilardi, Franco P. Preparata
    The VLSI Optimality of the AKS Sorting Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:2, pp:55-59 [Journal]
  98. D. T. Lee, Franco P. Preparata
    The All Nearest-Neighbor Problem for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:4, pp:189-192 [Journal]
  99. D. T. Lee, Franco P. Preparata
    Parallel Batched Planar Point Location on the CCC. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:4, pp:175-179 [Journal]
  100. Fabrizio Luccio, Franco P. Preparata
    Storage for Consecutive Retrieval. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:3, pp:68-71 [Journal]
  101. Franco P. Preparata
    Inverting a Vandermonde Matrix in Minimum Parallel Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:6, pp:291-294 [Journal]
  102. Franco P. Preparata, David E. Muller
    The Time Required to Evaluate Division-Free Arithmetic Expressions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:3, n:5, pp:144-146 [Journal]
  103. Franco P. Preparata, Dilip V. Sarwate
    An Improved Parallel Processor Bound in Fast Matrix Inversion. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:3, pp:148-150 [Journal]
  104. Franco P. Preparata, Kenneth J. Supowit
    Testing a Simple Polygon for Monotonicity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:4, pp:161-164 [Journal]
  105. Franco P. Preparata, Jean Vuillemin
    Area-Time Optimal VLSI Networks for Multiplying Matrices. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:2, pp:77-80 [Journal]
  106. Franco P. Preparata, Sylvian R. Ray
    An approach to artificial nonsymbolic cognition. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1972, v:4, n:1, pp:65-86 [Journal]
  107. Gianfranco Bilardi, Franco P. Preparata
    Size-time complexity of Boolean networks for prefix computations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:2, pp:362-382 [Journal]
  108. H. T. Kung, Fabrizio Luccio, Franco P. Preparata
    On Finding the Maxima of a Set of Vectors. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:4, pp:469-476 [Journal]
  109. D. T. Lee, Franco P. Preparata
    An Optimal Algorithm for Finding the Kernel of a Polygon. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:3, pp:415-421 [Journal]
  110. Kurt Mehlhorn, Franco P. Preparata
    Routing through a rectangle. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:1, pp:60-85 [Journal]
  111. David E. Muller, Franco P. Preparata
    Restructuring of Arithmetic Expressions For Parallel Evaluation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:534-543 [Journal]
  112. D. T. Lee, Franco P. Preparata
    An Improved Algorithm for the Rectangle Enclosure Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:3, pp:218-224 [Journal]
  113. Witold Lipski Jr., Franco P. Preparata
    Finding the Contour of a Union of Iso-Oriented Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1980, v:1, n:3, pp:235-246 [Journal]
  114. Witold Lipski Jr., Franco P. Preparata
    Segments, Rectangles, Contours. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:1, pp:63-76 [Journal]
  115. Witold Lipski Jr., Franco P. Preparata
    Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:1, pp:105- [Journal]
  116. Witold Lipski Jr., Franco P. Preparata
    Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:3, pp:301-302 [Journal]
  117. Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy
    Adaptive Control of Hybridization Noise in Dna Sequencing-by-hybridization. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:1, pp:79-98 [Journal]
  118. Alan M. Frieze, Franco P. Preparata, Eli Upfal
    Optimal Reconstruction of a Sequence from its Probes. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:3/4, pp:- [Journal]
  119. Samuel A. Heath, Franco P. Preparata, Joel Young
    Sequencing by Hybridization by Cooperating Direct and Reverse Spectra. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:3/4, pp:499-508 [Journal]
  120. Franco P. Preparata, John S. Oliver
    DNA Sequencing by Hybridization Using Semi-Degenerate Bases. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:4, pp:753-765 [Journal]
  121. Franco P. Preparata, Eli Upfal
    Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:3-4, pp:621-630 [Journal]
  122. Alberto Apostolico, Franco P. Preparata
    Structural Properties of the String Statistics Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:3, pp:394-411 [Journal]
  123. David E. Muller, Franco P. Preparata
    Parallel Restructuring and Evaluation of Expressions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:1, pp:43-62 [Journal]
  124. Franco P. Preparata, David E. Muller
    Generation of Near-Optimal Universal Boolean Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:2, pp:93-102 [Journal]
  125. Franco P. Preparata, Raymond T. Yeh
    Continuously Valued Logic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1972, v:6, n:5, pp:397-418 [Journal]
  126. Gianfranco Bilardi, Franco P. Preparata
    Horizons of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:27, n:2, pp:172-182 [Journal]
  127. Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West
    Tetrahedrizing Point Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:335-348 [Journal]
  128. Gianfranco Bilardi, Franco P. Preparata
    Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:6, pp:523-546 [Journal]
  129. Gianfranco Bilardi, Franco P. Preparata
    Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:5, pp:531-559 [Journal]
  130. Witold Lipski Jr., Franco P. Preparata
    A Unified Approach to Layout Wirability. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1987, v:19, n:3, pp:189-203 [Journal]
  131. Andrea Pietracaprina, Franco P. Preparata
    Practical Constructive Schemes for Deterministic Shared-Memory Access. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:1, pp:3-37 [Journal]
  132. Franco P. Preparata
    Optimal Three-Dimensional VLSI Layouts. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1983, v:16, n:1, pp:1-8 [Journal]
  133. Ravi Janardan, Franco P. Preparata
    Widest-Corridor Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:2, pp:231-245 [Journal]
  134. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata
    Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:808-835 [Journal]
  135. Gianfranco Bilardi, Franco P. Preparata
    Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:246-255 [Journal]
  136. Jean-Daniel Boissonnat, Franco P. Preparata
    Robust Plane Sweep for Intersecting Segments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1401-1421 [Journal]
  137. Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia
    A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:207-233 [Journal]
  138. D. T. Lee, Franco P. Preparata
    Location of a Point in a Planar Subdivision and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:594-606 [Journal]
  139. Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:864-889 [Journal]
  140. Victor Y. Pan, Franco P. Preparata
    Work-Preserving Speed-Up of Parallel Matrix Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:811-821 [Journal]
  141. Franco P. Preparata
    A Note on Locating a Set of Points in a Planar Subdivision. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:542-545 [Journal]
  142. Franco P. Preparata
    A New Approach to Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:473-482 [Journal]
  143. Franco P. Preparata, Roberto Tamassia
    Fully Dynamic Point Location in a Monotone Subdivision. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:811-830 [Journal]
  144. Franco P. Preparata, Roberto Tamassia
    Efficient Point Location in a Convex Spatial Cell-Complex. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:267-280 [Journal]
  145. Gérard M. Baudet, Franco P. Preparata, Jean Vuillemin
    Area-Time Optimal VLSI Circuits for Convolution. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:7, pp:684-688 [Journal]
  146. Gianfranco Bilardi, Franco P. Preparata
    An Architecture for Bitonic Sorting with Optimal VLSI Performance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:7, pp:646-651 [Journal]
  147. Gianfranco Bilardi, Franco P. Preparata
    A Minimum Area VLSI Network for O(log n) Time Sorting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:4, pp:336-343 [Journal]
  148. Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata
    O(n)-Depth Modular Exponentiation Circuit Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:6, pp:701-704 [Journal]
  149. Franco P. Preparata
    A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:2, pp:194-198 [Journal]
  150. Franco P. Preparata, Witold Lipski Jr.
    Optimal Three-Layer Channel Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:5, pp:427-437 [Journal]
  151. Franco P. Preparata, David E. Muller
    Efficient Parallel Evaluation of Boolean Expression. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:5, pp:548-549 [Journal]
  152. Franco P. Preparata, David E. Muller, Amnon Barak
    Reduction of Depth of Boolean Networks with a Fan-In Constraint. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1977, v:26, n:5, pp:474-479 [Journal]
  153. Franco P. Preparata, Jean Vuillemin
    Practical Cellular Dividers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:5, pp:605-614 [Journal]
  154. Franco P. Preparata
    Sequencing-by-Hybridization Revisited: The Analog-Spectrum Proposal. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:1, pp:46-52 [Journal]
  155. Alberto Apostolico, Franco P. Preparata
    Optimal Off-Line Detection of Repetitions in a String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:297-315 [Journal]
  156. Paul F. Fischer, Franco P. Preparata, John E. Savage
    Generalized scans and tridiagonal systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:423-436 [Journal]
  157. David S. Johnson, Franco P. Preparata
    The Densest Hemisphere Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:6, n:, pp:93-107 [Journal]
  158. David E. Muller, Franco P. Preparata
    Finding the Intersection of two Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:217-236 [Journal]
  159. Franco P. Preparata
    A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:2, pp:185-190 [Journal]
  160. Franco P. Preparata
    Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:1, pp:121- [Journal]
  161. Franco P. Preparata, Roberto Tamassia
    Dynamic Planar Point Location with Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:1, pp:95-114 [Journal]
  162. Franco P. Preparata
    Holographic dispersal and recovery of information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:5, pp:1123-0 [Journal]
  163. Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
    Computation of the axial view of a set of isothetic parallelepipeds. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1990, v:9, n:3, pp:278-300 [Journal]

  164. Algorithms for Location Estimation Based on RSSI Sampling. [Citation Graph (, )][DBLP]


  165. Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction. [Citation Graph (, )][DBLP]


  166. Halfspace range search: an algorithmic application of K-sets. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002