Recent Publications
- G. Liotta, F. P. Preparata, and R. Tamassia, ``Robust Proximity Queries:
An illustration of degree-driven algorithm design,''
SIAM Journal on Computing, 28, 3, 864-889 (1998).
- O.Devillers and F. P. Preparata,``A probabilistic analysis of the power of
arithmetic filters,'' Discrete and Computational Geometry,
20, 4, 323-347 (1998).
- F. P. Preparata, ``Reflections on conventional and unconventional computing'',
keynote lecture, Kansai Symposium, Japan, September 1998. Memoirs 1998,
Kansai University, 75-86.
- F. P. Preparata, ``Quantum search: Can we read a superposed state?'', invited
lecture, Kansai Symposium, Japan, September 1998. Memoirs 1998,
Kansai University, 247-252.
- F. P. Preparata, A.M. Frieze, and E. Upfal,``On the power of universal bases in Sequencing by Hybridization'',
RECOMB99,Lyon(France), April 11, 1999; 295-301.
- V. Chatzi and F. P. Preparata,``Integer-coordinate crystalline meshes'',
Swiss Conference on CAD/CAM, Neuchatel(Switz.), February 22, 1999; 199-206.
- O.Devillers and F. P. Preparata,``Further results
on arithmetic filters for geometric predicates,''
Computational Geometry: Theory and Applications,
13, 141-148 (1999).
- G. Bilardi and F. P. Preparata, ``Processor-time tradeoffs under
bounded-speed
message propagation: Part II, lower bounds,'' Theory of Computing
Systems, 32, 531-559 (1999).
- A.M.Frieze, F. P. Preparata, and E.Upfal, ``Optimal reconstruction of a
sequence from its probes.''
Computational Biology , 6, 3/4, (1999); 361-368.
- J.D. Boissonnat and F. P. Preparata, ``Robust plane sweep for
intersecting segments,''
SIAM Journal on Computing , 23,5.1401-1421 (2000).
- P.F.Fischer, F. P. Preparata, and J.E.Savage,`` Generalized scans and tridiagonal
systems,'' Theoretical Computer Science , to appear.
- B. Codenotti, M. Leoncini,and F. P. Preparata, ``The role of arithmetic in fast
parallel matrix inversion,''' Algorithmica , to appear.
- O.Devillers and F. P. Preparata,``Evaluating the cylindricity of
a nominally cylindrical point set,'' Symposium on Discrete Algorithms, January
9-11, 2000; 518-527.
- F. P. Preparata and E. Upfal, "Sequencing-by-Hybridization at the information-theory bound:
An optimal algorithm.''
Computational Biology , 7, 3/4, 621-630 (2000).
Back
Back