John Reif

John H. Reif (born 1951) is an American academic, and Professor of Computer Science at Duke University, who has made contributions to large number of fields in computer science: ranging from algorithms and computational complexity theory to robotics and to game theory.

For the Oklahoma Supreme Court justice, see John F. Reif.

Biography

John Reif received a B.S. (magna cum laude) from Tufts University in 1973, a M.S. from Harvard University in 1975 and a Ph.D. from Harvard University in 1977.[1]

From 1983 to 1986 he was Associate Professor of Harvard University, and since 1986 he has been Professor of Computer Science at Duke University. Currently he holds the Hollis Edens Distinguished Professor, Trinity College of Arts and Sciences, Duke University. From 2011-2014 he was Distinguished Adjunct Professor, Faculty of Computing and Information Technology (FCIT), King Abdulaziz University (KAU), Jeddah, Saudi Arabia.

John Reif is President of Eagle Eye Research, Inc.,[2] which specializes in defense applications of DNA biotechnology. He has also contributed to bringing together various disjoint research communities working in different areas of nano-sciences by organizing (as General Chairman) annual Conferences on "Foundations of Nanoscience: Self-assembled architectures and devices" (FNANO[3]) for last 15 years.

He has been awarded Fellow of the following organizations: American Association for the Advancement of Science, IEEE, ACM, and the Institute of Combinatorics.

He is the son of Arnold E. Reif.

Research contributions

John Reif has made contributions to large number of fields in computer science: ranging from algorithms and computational complexity theory to robotics and to game theory. He developed efficient randomized algorithms and parallel algorithms for a wide variety of graph, geometric, numeric, algebraic, and logical problems. His Google Scholar H-index[4] is 68.

In the area of robotics, he gave the first hardness proofs for robotic motion planning as well as efficient algorithms for a wide variety of motion planning problems.

He also has led applied research projects: parallel programming languages (Proteus System for parallel programming), parallel architectures (Blitzen, a massively parallel machine), data compression (massively parallel loss-less compression hardware), and optical computing (free-space holographic routing). His papers on these algorithmic topics can be downloaded here.

Research in nanoscience

More recently, he has centered his research in nanoscience and in particular DNA nanotechnology, DNA computing, and DNA nanorobotics. In the last dozen years his group at Duke has designed and experimentally demonstrated in the lab a variety of novel self-assembled DNA nanostructures and DNA lattices, including the first experimental demonstrations of molecular scale computation and patterning using DNA assembly. His group also experimentally demonstrated various molecular robotic devices composed of DNA, including one of the first autonomous unidirectional DNA walker that walked on a DNA track. He also has done significant work on controlling errors in self-assembly and the stochastic analysis of self-assembly.[5]

See also

Publications

He is the author of over 200 publications.[6] A selection:

Books
  • Parallel Algorithm Derivation and Program Transformation, (with Robert Paige and Ralph Wachter), Kluwer Academic Publishers, Boston, MA 1993.
  • Handbook of Randomized Computing, (with Sanguthevar Rajasekaran, Panos M. Pardalos and José Rolim), Springer, New York, NY, 2001.
  • Synthesis of Parallel Algorithms, Morgan Kaufmann Publishers, San Francisco, CA, 1993.
  • DNA-based Self-assembly and Nanorobotics, (with S. Sahu), VDM Verlag, Saarbrücken, Germany, 2008.

References
  1. Reif's Vita Archived 2008-05-17 at the Wayback Machine
  2. Eagle Eye Research, Inc.
  3. FNANO
  4. h-index
  5. His papers on these topics can be downloaded here.
  6. Publications:
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.