| Year |
Citation |
Score |
| 2012 |
Preparata FP, Vacca R. On the representation of the powers of integers in any prime base International Journal of Number Theory. 8: 531-541. DOI: 10.1142/S1793042112500285 |
0.308 |
|
| 2012 |
Preparata FP. Accurate and precise aggregation counting Journal of Computer and System Sciences. 78: 192-197. DOI: 10.1016/J.Jcss.2011.02.002 |
0.322 |
|
| 2008 |
Do HH, Choi KP, Preparata FP, Sung WK, Zhang L. Spectrum-based de novo repeat detection in genomic sequences. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 15: 469-87. PMID 18549302 DOI: 10.1089/Cmb.2008.0013 |
0.306 |
|
| 2008 |
Papamanthou C, Preparata FP, Tamassia R. Algorithms for location estimation based on RSSI sampling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5389: 72-86. DOI: 10.1007/978-3-540-92862-1_7 |
0.5 |
|
| 2007 |
Domaniç NO, Preparata FP. A novel approach to the detection of genomic approximate tandem repeats in the Levenshtein metric. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 873-91. PMID 17803368 DOI: 10.1089/Cmb.2007.0018 |
0.35 |
|
| 2006 |
Preparata FP. The unpredictable deviousness of models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4112: 1. DOI: 10.1016/J.Tcs.2008.08.019 |
0.326 |
|
| 2005 |
Leong HW, Preparata FP, Sung WK, Willy H. Adaptive control of hybridization noise in DNA sequencing-by-hybridization. Journal of Bioinformatics and Computational Biology. 3: 79-98. PMID 15751113 DOI: 10.1142/S0219720005000862 |
0.385 |
|
| 2004 |
Preparata FP. Sequencing-by-hybridization revisited: the analog-spectrum proposal. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 1: 46-52. PMID 17048407 DOI: 10.1109/Tcbb.2004.12 |
0.393 |
|
| 2004 |
Preparata FP, Oliver JS. DNA sequencing by hybridization using semi-degenerate bases. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 11: 753-65. PMID 15579243 DOI: 10.1089/Cmb.2004.11.753 |
0.337 |
|
| 2003 |
Heath SA, Preparata FP, Young J. Sequencing by hybridization by cooperating direct and reverse spectra. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 10: 499-508. PMID 12935340 DOI: 10.1089/10665270360688147 |
0.75 |
|
| 2003 |
Devillers O, Preparata FP. Culling a set of points for roundness or cylindricity evaluations International Journal of Computational Geometry and Applications. 13: 231-240. DOI: 10.1142/S021819590300113X |
0.34 |
|
| 2003 |
Lao YZ, Leong HW, Preparata FP, Singh G. Accurate cylindricity evaluation with axis-estimation preprocessing Precision Engineering. 27: 429-437. DOI: 10.1016/S0141-6359(03)00044-8 |
0.335 |
|
| 2003 |
Devillers O, Mourrain B, Preparata FP, Trebuchet P. Circular cylinders through four or five points in space Discrete and Computational Geometry. 29: 83-104. DOI: 10.1007/S00454-002-2811-7 |
0.336 |
|
| 2002 |
Heath SA, Preparata FP, Young J. Sequencing by hybridization using direct and reverse cooperating spectra Proceedings of the Annual International Conference On Computational Molecular Biology, Recomb. 186-193. |
0.735 |
|
| 2001 |
Codenotti B, Leoncini M, Preparata FP. The role of arithmetic in fast parallel matrix inversion Algorithmica (New York). 30: 685-707. DOI: 10.1007/S00453-001-0033-7 |
0.39 |
|
| 2001 |
Heath SA, Preparata FP. Enhanced sequence reconstruction with DNA microarray application: Extended abstract Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2108: 64-74. |
0.752 |
|
| 2000 |
Preparata FP, Upfal E. Sequencing-by-hybridization at the information-theory bound: An optimal algorithm Journal of Computational Biology. 7: 621-630. PMID 11108482 DOI: 10.1089/106652700750050970 |
0.398 |
|
| 2000 |
Boissonnat JD, Preparata FP. Robust plane sweep for intersecting segments Siam Journal On Computing. 29: 1401-1421. DOI: 10.1137/S0097539797329373 |
0.373 |
|
| 1999 |
Frieze AM, Preparata FP, Upfal E. Optimal reconstruction of a sequence from its probes Journal of Computational Biology. 6: 361-368. PMID 10582572 DOI: 10.1089/106652799318328 |
0.365 |
|
| 1999 |
Liotta G, Preparata FP, Tamassia R. Robust proximity queries: An illustration of degree-driven algorithm design Siam Journal On Computing. 28: 864-889. DOI: 10.1137/S0097539796305365 |
0.623 |
|
| 1999 |
Devillers O, Preparata FP. Further results on arithmetic filters for geometric predicates Computational Geometry: Theory and Applications. 13: 141-148. DOI: 10.1016/S0925-7721(99)00011-5 |
0.324 |
|
| 1998 |
Devillers O, Liotta G, Preparata FP, Tamassia R. Checking the convexity of polytopes and the planarity of subdivisions Computational Geometry: Theory and Applications. 11: 187-208. DOI: 10.1016/S0925-7721(98)00039-X |
0.591 |
|
| 1998 |
Devillers O, Preparata FP. A probabilistic analysis of the power of arithmetic filters Discrete and Computational Geometry. 20: 523-547. DOI: 10.1007/Pl00009400 |
0.341 |
|
| 1997 |
Bilardi G, Preparata FP. Processor-time tradeoffs under bounded-speed message propagation: Part I, upper bounds Theory of Computing Systems. 30: 523-546. DOI: 10.1007/S002240000066 |
0.329 |
|
| 1997 |
Pietracaprina A, Preparata FP. Practical constructive schemes for deterministic shared-memory access Theory of Computing Systems. 30: 3-37. DOI: 10.1007/Bf02679451 |
0.377 |
|
| 1997 |
Avnaim F, Boissonnat JD, Devillers O, Preparata FP, Yvinec M. Evaluating Signs of Determinants Using Single-Precision Arithmetic Algorithmica (New York). 17: 111-132. DOI: 10.1007/Bf02522822 |
0.33 |
|
| 1996 |
Tamassia R, Agarwal PK, Amato N, Chen DZ, Dobkin D, Drysdale S, Fortune S, Goodrich MT, Hershberger J, O'Rourke J, Preparata FP, Sack JR, Suri S, Tollis I, Vitter JS, et al. Strategic directions in computational geometry Acm Computing Surveys. 28: 591-606. DOI: 10.1145/242223.242248 |
0.513 |
|
| 1996 |
Chiang YIJ, Preparata FP, Tamassia R. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps Siam Journal On Computing. 25: 207-233. DOI: 10.1137/S0097539792224516 |
0.607 |
|
| 1996 |
Apostolico A, Preparata FP. Data Structures and Algorithms for the String Statistics Problem Algorithmica (New York). 15: 481-494. DOI: 10.1007/Bf01955046 |
0.378 |
|
| 1995 |
Pan VY, Preparata FP. Work-Preserving Speed-Up of Parallel Matrix Computations Siam Journal On Computing. 24: 811-821. DOI: 10.1137/0224051 |
0.405 |
|
| 1995 |
Fischer PF, Preparata FP, Savage JE. Generalized scans and tri-diagonal systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 900: 168-180. DOI: 10.1016/S0304-3975(99)00311-4 |
0.302 |
|
| 1995 |
Amato NM, Preparata FP. A time-optimal parallel algorithm for three-dimensional convex hulls Algorithmica. 14: 169-182. DOI: 10.1007/Bf01293667 |
0.641 |
|
| 1995 |
Bilardi G, Preparata FP. Horizons of Parallel Computation Journal of Parallel and Distributed Computing. 27: 172-182. DOI: 10.1006/Jpdc.1995.1080 |
0.317 |
|
| 1993 |
PREPARATA FP, VITTER JS. A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS International Journal of Computational Geometry & Applications. 3: 167-181. DOI: 10.1142/S0218195993000117 |
0.453 |
|
| 1992 |
AMATO NM, PREPARATA FP. THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED International Journal of Computational Geometry & Applications. 2: 163-173. DOI: 10.1142/S021819599200010X |
0.648 |
|
| 1992 |
Preparata FP, Tamassia R. Efficient Point Location in a Convex Spatial Cell-Complex Siam Journal On Computing. 21: 267-280. DOI: 10.1137/0221020 |
0.611 |
|
| 1992 |
Muller DE, Preparata FP. Parallel restructuring and evaluation of expressions Journal of Computer and System Sciences. 44: 43-62. DOI: 10.1016/0022-0000(92)90003-2 |
0.368 |
|
| 1992 |
Preparata FP, Vitter JS, Yvinec M. Output-sensitive generation of the perspective view of isothetic parallelepipeds Algorithmica. 8: 257-283. DOI: 10.1007/Bf01758847 |
0.407 |
|
| 1991 |
BOISSONNAT J, DEVILLERS O, PREPARATA FP. COMPUTING THE UNION OF 3-COLORED TRIANGLES International Journal of Computational Geometry & Applications. 1: 187-196. DOI: 10.1142/S021819599100013X |
0.383 |
|
| 1991 |
Hornick SW, Preparata FP. Deterministic P-RAM simulation with constant redundancy Information and Computation. 92: 81-96. DOI: 10.1016/0890-5401(91)90021-S |
0.306 |
|
| 1990 |
Preparata FP, Vitter JS, Yvinec M. Computation of the Axial View of a Set of Isothetic Parallelepipeds Acm Transactions On Graphics (Tog). 9: 278-300. DOI: 10.1145/78964.78967 |
0.372 |
|
| 1990 |
PREPARATA FP. PLANAR POINT LOCATION REVISITED International Journal of Foundations of Computer Science. 1: 71-86. DOI: 10.1142/S0129054190000072 |
0.359 |
|
| 1990 |
Bilardi G, Preparata FP. Characterization of associative operations with prefix circuits of constant depth and linear size Siam Journal On Computing. 19: 246-255. DOI: 10.1137/0219016 |
0.32 |
|
| 1990 |
Preparata FP, Vuillemin JE. Practical Cellular Dividers Ieee Transactions On Computers. 39: 605-614. DOI: 10.1109/12.53574 |
0.332 |
|
| 1990 |
Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions† Journal of Symbolic Computation. 10: 335-347. DOI: 10.1016/S0747-7171(08)80068-5 |
0.429 |
|
| 1990 |
Preparata FP, Tamassia R. Dynamic planar point location with optimal query time Theoretical Computer Science. 74: 95-114. DOI: 10.1016/0304-3975(90)90007-5 |
0.597 |
|
| 1990 |
Alevizos P, Boissonnat J, Preparata FP. An optimal algorithm for the boundary of a cell in a union of rays Algorithmica. 5: 573-590. DOI: 10.1007/Bf01840405 |
0.37 |
|
| 1990 |
Tamassia R, Preparata FP. Dynamic maintenance of planar digraphs, with applications Algorithmica. 5: 509-527. DOI: 10.1007/Bf01840401 |
0.598 |
|
| 1989 |
Bilardi G, Preparata FP. Size-Time Complexity of Boolean Networks for Prefix Computations Journal of the Acm (Jacm). 36: 362-382. DOI: 10.1145/62044.62052 |
0.363 |
|
| 1989 |
Preparata FP, Tamassia R. Fully Dynamic Point Location in a Monotone Subdivision Siam Journal On Computing. 18: 811-830. DOI: 10.1137/0218056 |
0.604 |
|
| 1989 |
Lee DT, Preparata FP. Parallel batched planar point location on the CCC Information Processing Letters. 33: 175-179. DOI: 10.1016/0020-0190(89)90137-3 |
0.389 |
|
| 1988 |
Edelsbrunner H, Preparata FP. Minimum polygonal separation Information and Computation. 77: 218-232. DOI: 10.1016/0890-5401(88)90049-1 |
0.441 |
|
| 1987 |
Alt H, Hagerup T, Mehlhorn K, Preparata FP. Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones Siam Journal On Computing. 16: 808-835. DOI: 10.1137/0216053 |
0.371 |
|
| 1987 |
Mehlhorn K, Preparata FP. Area-time optimal division for T = Ω((log n)1 + ε) Information and Computation. 72: 270-282. DOI: 10.1016/0890-5401(87)90034-4 |
0.382 |
|
| 1987 |
Sarrafzadeh M, Preparata FP. A bottom-up layout technique based on two-rectangle routing Integration, the Vlsi Journal. 5: 231-246. DOI: 10.1016/0167-9260(87)90017-4 |
0.545 |
|
| 1986 |
Mehlhorn K, Preparata FP. Routing through a Rectangle Journal of the Acm (Jacm). 33: 60-85. DOI: 10.1145/4904.4994 |
0.429 |
|
| 1986 |
Chazelle B, Preparata FP. Halfspace range search: An algorithmic application of k-sets Discrete & Computational Geometry. 1: 83-93. DOI: 10.1007/Bf02187685 |
0.385 |
|
| 1986 |
Mehlhorn K, Preparata FP, Sarrafzadeh M. Channel routing in knock-knee mode: Simplified algorithms and proofs Algorithmica. 1: 213-221. DOI: 10.1007/Bf01840443 |
0.427 |
|
| 1986 |
Bilardi G, Preparata FP. Area-time lower-bound techniques with applications to sorting Algorithmica. 1: 65-91. DOI: 10.1007/Bf01840437 |
0.344 |
|
| 1986 |
Lipski W, Preparata FP. A unified approach to layout wirability Mathematical Systems Theory. 19: 189-203. DOI: 10.1007/Bf01704913 |
0.334 |
|
| 1985 |
Bilardi G, Preparata FP. A minimum area VLSI network for O(Iog n) time sorting Ieee Transactions On Computers. 336-343. DOI: 10.1109/Tc.1985.5009384 |
0.436 |
|
| 1985 |
Sarrafzadeh M, Preparata FP. Compact Channel Routing of Multiterminal Nets North-Holland Mathematics Studies. 109: 255-279. DOI: 10.1016/S0304-0208(08)73111-6 |
0.472 |
|
| 1985 |
Apostolico A, Preparata FP. Structural properties of the string statistics problem Journal of Computer and System Sciences. 31: 394-411. DOI: 10.1016/0022-0000(85)90060-1 |
0.334 |
|
| 1985 |
Bilardi G, Preparata FP. The VLSI optimality of the aks sorting network Information Processing Letters. 20: 55-59. DOI: 10.1016/0020-0190(85)90062-6 |
0.362 |
|
| 1984 |
Bilardi G, Preparata FP. An Architecture for Bitonic Sorting with Optimal VLSI Performance Ieee Transactions On Computers. 646-651. DOI: 10.1109/Tc.1984.5009338 |
0.358 |
|
| 1984 |
Lee DT, Preparata FP. EUCLIDEAN SHORTEST PATHS IN THE PRESENCE OF RECTILINEAR BARRIERS Networks. 14: 393-410. DOI: 10.1002/Net.3230140304 |
0.422 |
|
| 1983 |
Mehlhorn K, Preparata FP. Area-Time optimal VLSI integer multiplier with minimum computation time Information and Control. 58: 137-156. DOI: 10.1016/S0019-9958(83)80061-8 |
0.411 |
|
| 1983 |
Apostolico A, Preparata FP. Optimal off-line detection of repetitions in a string Theoretical Computer Science. 22: 297-315. DOI: 10.1016/0304-3975(83)90109-3 |
0.441 |
|
| 1983 |
Preparata FP. Optimal three-dimensional VLSI layouts Mathematical Systems Theory. 16: 1-8. DOI: 10.1007/Bf01744565 |
0.302 |
|
| 1982 |
Nievergelt J, Zurich ETH, Preparata FP. Plane-Sweep Algorithms for Intersecting Geometric Figures Communications of the Acm. 25: 739-747. DOI: 10.1145/358656.358681 |
0.348 |
|
| 1982 |
NIEVERGELT J, PREPARATA FP. PLANE SWEEP ALGORITHMS FOR INTERSECTING GEOMETRIC FIGURES Commun Acm. 686-697. DOI: 10.1145/358656.358681 |
0.451 |
|
| 1982 |
Bentley JL, Preparata FP, Faust MG. Approximation Algorithms for Convex Hulls Communications of the Acm. 25: 64-68. DOI: 10.1145/358315.358392 |
0.427 |
|
| 1982 |
Lee DT, Preparata FP. An improved algorithm for the rectangle enclosure problem Journal of Algorithms. 3: 218-224. DOI: 10.1016/0196-6774(82)90021-9 |
0.457 |
|
| 1982 |
Edelsbrunner H, Maurer HA, Preparata FP, Rosenberg AL, Welzl E, Wood D. Stabbing line segments Bit. 22: 274-281. DOI: 10.1007/Bf01934440 |
0.383 |
|
| 1981 |
Preparata FP, Vuillemin J. The Cube-Connected Cycles: A Versatile Network for Parallel Computation Communications of the Acm. 24: 300-309. DOI: 10.1145/358645.358660 |
0.34 |
|
| 1981 |
Preparata FP. A New Approach to Planar Point Location Siam Journal On Computing. 10: 473-482. DOI: 10.1137/0210035 |
0.427 |
|
| 1981 |
Lipski W, Preparata FP. Segments, rectangles, contours Journal of Algorithms. 2: 63-76. DOI: 10.1016/0196-6774(81)90008-0 |
0.396 |
|
| 1981 |
Lipski W, Preparata FP. Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems Acta Informatica. 15: 329-346. DOI: 10.1007/Bf00264533 |
0.387 |
|
| 1979 |
Preparata FP. An Optimal Real-Time Algorithm for Planar Convex Hulls Communications of the Acm. 22: 402-405. DOI: 10.1145/359131.359132 |
0.448 |
|
| 1979 |
Lee DT, Preparata FP. An Optimal Algorithm for Finding the Kernel of a Polygon Journal of the Acm (Jacm). 26: 415-421. DOI: 10.1145/322139.322142 |
0.417 |
|
| 1979 |
Preparata FP. A Note on Locating a Set of Points in a Planar Subdivision Siam Journal On Computing. 8: 542-545. DOI: 10.1137/0208043 |
0.389 |
|
| 1979 |
Preparata FP, Muller DE. Finding the intersection of n half-spaces in time O(n log n) Theoretical Computer Science. 8: 45-55. DOI: 10.1016/0304-3975(79)90055-0 |
0.416 |
|
| 1978 |
Preparata FP. New Parallel-Sorting Schemes Ieee Transactions On Computers. 669-673. DOI: 10.1109/TC.1978.1675167 |
0.326 |
|
| 1978 |
Muller DE, Preparata FP. Finding the intersection of two convex polyhedra Theoretical Computer Science. 7: 217-236. DOI: 10.1016/0304-3975(78)90051-8 |
0.42 |
|
| 1978 |
Johnson DS, Preparata FP. The densest hemisphere problem Theoretical Computer Science. 6: 93-107. DOI: 10.1016/0304-3975(78)90006-3 |
0.402 |
|
| 1978 |
Adleman L, Booth KS, Preparata FP, Ruzzo WL. Improved time and space bounds for Boolean matrix multiplication Acta Informatica. 11: 61-70. DOI: 10.1007/Bf00264600 |
0.408 |
|
| 1977 |
Preparata FP, Hong SJ. CONVEX HULLS OF FINITE SETS OF POINTS IN TWO AND THREE DIMENSIONS Communications of the Acm. 20: 87-93. DOI: 10.1145/359423.359430 |
0.46 |
|
| 1977 |
Lee DT, Preparata FP. Location of a Point in a Planar Subdivision and Its Applications Siam Journal On Computing. 6: 594-606. DOI: 10.1137/0206043 |
0.458 |
|
| 1976 |
Muller DE, Preparata FP. Restructuring of Arithmetic Expressions For Parallel Evaluation Journal of the Acm (Jacm). 23: 534-543. DOI: 10.1145/321958.321973 |
0.387 |
|
| 1975 |
Kung HT, Luccio F, Preparata FP. On Finding the Maxima of a Set of Vectors Journal of the Acm (Jacm). 22: 469-476. DOI: 10.1145/321906.321910 |
0.36 |
|
| 1975 |
Muller DE, Preparata FP. Bounds to Complexities of Networks for Sorting and for Switching Journal of the Acm (Jacm). 22: 195-201. DOI: 10.1145/321879.321882 |
0.334 |
|
| 1975 |
Preparata FP. A fast stable sorting algorithm with absolutely minimum storage Theoretical Computer Science. 1: 185-190. DOI: 10.1016/0304-3975(75)90019-5 |
0.402 |
|
| 1972 |
Preparata FP, Yeh RT. Continuously valued logic Journal of Computer and System Sciences. 6: 397-418. DOI: 10.1016/S0022-0000(72)80011-4 |
0.303 |
|
| 1972 |
Preparata FP, Ray SR. An approach to artificial nonsymbolic cognition Information Sciences. 4: 65-86. DOI: 10.1016/0020-0255(72)90005-9 |
0.312 |
|
| 1971 |
Chien RT, Hong SJ, Preparata FP. Some results in the theory of arithmetic codes Information and Control. 19: 246-264. DOI: 10.1016/S0019-9958(71)90125-2 |
0.305 |
|
| 1966 |
Preparata FP. Convolutional Transformations of Binary Sequences: Boolean Functions and Their Resynchronizing Properties Ieee Transactions On Electronic Computers. 898-908. DOI: 10.1109/Pgec.1966.264472 |
0.325 |
|
| 1965 |
Preparata FP. On the Realizability of Special Classes of Autonomous Sequential Networks Ieee Transactions On Electronic Computers. 14: 791-797. DOI: 10.1109/Pgec.1965.264072 |
0.325 |
|
| Show low-probability matches. |
