Franco Preparata
| Franco P. Preparata | |
|---|---|
| Born | December 1935 |
| Nationality | Italian |
| Fields | Computer Science |
| Institutions |
Brown University University of Illinois at Urbana-Champaign |
| Alma mater | University of Rome |
| Doctoral students |
Der-Tsai Lee Roberto Tamassia Nancy M. Amato |
| Known for | computational geometry |
| Notable awards |
ACM Fellow (1995) IEEE Fellow (1978) |
|
Website cs |
|
Franco P. Preparata is a computer scientist, the An Wang Professor, Emeritus, of Computer Science at Brown University.
He is best known for his 1985 book "Computational Geometry: An Introduction" into which he blended salient parts of M. I. Shamos' doctoral thesis (Shamos appears as a co-author of the book). This book, which represents a snapshot of the disciplines as of 1985, has been for many years the standard textbook in the field, and has been translated into four foreign Languages (Russian, Japanese, Chinese, and Polish). He has made several contributions to the computational geometry, the most recent being the notion of "algorithmic degree" as a key feature to control robust implementations of geometric algorithms.
In addition, Preparata has worked in many other areas of, or closely related to, computer science.
His initial work was in coding theory, where he (independently and simultaneously) contributed the Berlekamp-Preparata codes (optimal convolution codes for burst-error correction) and the Preparata codes, the first known systematic class of nonlinear binary codes, with higher information content than corresponding linear BCH codes of the same length. Thirty years later these codes have been found relevant to quantum coding theory.
In 1967, he substantially contributed to a model of system-level fault diagnosis, known today as the PMC (Preparata-Metze-Chien) model, which is a main issue in the design of highly dependable processing systems. This model is still the object of intense research today (as attested by the literature).
Over the years, he was also active in research in parallel computation and VLSI theory. His 1979 paper (with J. Vuillemin), still highly cited, presented the cube-connected-cycles (CCC), a parallel architecture that optimally emulates the hypercube interconnection. This interconnection was closely reflected in the architecture of the CM2 of Thinking Machines Inc., the first massive-parallel system in the VLSI era. His 1991 paper with Zhou and Kang on interconnection delays in VLSI was awarded the 1993 "Darlington Best Paper Award" by the IEEE Circuits and Systems Society. In the late nineties, (in joint work with G. Bilardi) he confronted the problem of the physical limitations (space and speed) of parallel computation, and formulated the conclusion that mesh connections are ultimately the only scalable massively parallel architectures.
More recently the focus of his research has been Computational Biology. Among other results, he contributed (with Eli Upfal) a novel approach to DNA Sequencing by Hybridization, achieving sequencing lengths that are the square of what was previously known, which has attracted media coverage.
...
Wikipedia