Franco P. Preparata

Franco P. Preparata

Franco P. Preparata (born December 1935) is a computer scientist, the An Wang Professor of Computer Science at Brown University. He is best known for his 1985 computational geometry book with Michael Shamos, for many years the standard textbook in the field, but Preparata has worked in many other areas of computer science: his initial work was on coding theory, and his 1981 paper in distributed computing describing the cube-connected cycles computer communications network is still highly cited, as is his 1967 paper on fault diagnosis. 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 [ [http://www.ewh.ieee.org/soc/icss/awards.php CAS Society award descriptions] and [http://www.ewh.ieee.org/soc/icss/awards-darlington.html Darlington Award past recipient list] on the IEEE web site.] , and he has attracted media coverage [ [http://www.sciencedaily.com/releases/2000/10/001018215846.htm Brown Researchers Use Wildcards To Develop Better Way To Sequence DNA] , ScienceDaily, October 19, 2000.] for his more recent work in computational biology.

Preparata was born in Italy in December, 1935. [Date calculated from the December, 2005 date of his 70th birthday listed on the Franco Fest web site.] He received a doctorate from the University of Rome in 1959. After a postdoctorate at CNR and several years of working in industry he joined the faculty of the University of Illinois at Urbana-Champaign in 1965, where he stayed for many years, advising 16 Ph.D. students there. [ [http://www.francofest.net/students.html List of Preparata's students] from the Franco Fest web site.] He received his Italian Libera Docenza in 1969. In 1991, Preparata moved from Illinois to Brown University where he has remained active in research and student advising. In 1997, the University of Padova awarded Preparata an honorary doctorate. Preparata is an ACM Fellow [ [http://fellows.acm.org/fellow_citation.cfm?id=1481076&srt=all ACM Fellows Award citation: Franco Preparata] ] , an IEEE Fellow [ [http://www.ieee.org/web/membership/fellows/Regional/fellows_rone_l-z.html IEEE Region 1 Fellows L-Z] .] , and a Fellow of the Japan Society for the Advancement of Science.

Selected bibliography

*cite journal
author = Preparata, Franco P.; Metze, G.; Chien, R. T.
title = On the Connection Assignment Problem of Diagnosable Systems
journal = IEEE Transactions on Electronic Computers
year = 1967
volume = EC-16
issue = 6
pages = 848–854
doi = 10.1109/PGEC.1967.264747

*cite book
author = Preparata, Franco P.; Shamos, Michael I.
title = Computational Geometry
year = 1985
publisher = Springer-Verlag
series = Monographs in Computer Science
id = ISBN 978-3540961314

*cite journal
author = Preparata, Franco P.; Vuillemin, Jean
title = The cube-connected cycles: a versatile network for parallel computation
journal = Communications of the ACM
volume = 24
issue = 5
year = 1981
pages = 300–309
doi = 10.1145/358645.358660

*cite journal
author = Zhou, D.; Preparata, Franco P.; Kang, Sung Mo
title = Interconnection delay in very high-speed VLSI
journal = IEEE Transactions on Circuits and Systems
volume = 38
issue = 7
year = 1991
pages = 779–790
doi = 10.1109/31.135749

ee also

* Preparata code

Notes

External links

* [http://www.cs.brown.edu/~franco/ Preparata's home page] and [http://research.brown.edu/pdf/1106970027.pdf curriculum vitae] at Brown.

* [http://www.francofest.net/ Franco Fest 2006] , a conference held in honor of Preparata's 70th birthday.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Preparata code — In coding theory, the Preparata codes form a class of non linear double error correcting codes. They are named after Franco P. Preparata who first described them in 1968. Construction Let m be an odd number, and n = 2m − 1. We first… …   Wikipedia

  • List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Der-Tsai Lee — was in Taipei, Taiwan, March 29, 2009 Born April 5, 1949 ( …   Wikipedia

  • QuickHull — ist ein Algorithmus zur Berechnung der Konvexen Hülle einer beliebigen Punktemenge im zwei und dreidimensionalen Raum. Die Konvexe Hülle einer Menge von Punkten wird beschrieben durch einen geschlossenen Polygonzug welcher die Verbindung aller… …   Deutsch Wikipedia

  • Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… …   Wikipedia

  • Star-shaped polygon — A star shaped polygon (not to be confused with star polygon) is a polygonal region in the plane which is a star domain, i.e., a polygon P is star shaped, if there exists a point z such that for each point p of P the segment zp lies entirely… …   Wikipedia

  • Computational geometry — is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to… …   Wikipedia

  • Monotone polygon — Green indicates one intersection, blue indicates two intersections, and red indicates three or more. The top two polygons are monotone with respect to L while the bottom two are not. In geometry, a polygon P in the plane is called monotone with… …   Wikipedia

  • Geometría computacional — Cilindro renderizado mediante un programa de ordenador. La geometría computacional es una rama de las ciencias de la computación dedicada al estudio de algoritmos que pueden ser expresados en términos de la geometría. Algunos de los problemas… …   Wikipedia Español

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”