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