John
H. Reif
- A. Hollis Edens Professor, Trinity
College of Arts and Sciences, Duke University.
- Professor of Computer Science at Duke University, since 1986.
- Rm. D223, L.S.R.C. Building, Box 90129, Duke
University, Durham, NC 27708-0129
- Email:
- Phone: (919) 660-6568 Fax: (919) 660-6519
- My assistant Camelia
Pierson at phone 919-660-6534 is available to help if you need to
contact me and I'm not here.
Conference
Organization:
Program Chairman of Third
Conference on FOUNDATIONS OF NANOSCIENCE: SELF-ASSEMBLED ARCHITECTURES AND
DEVICES(FNANO06), Snowbird, Utah, noon April 23-noon April
27, 2006.
Program Chairman of Second Conference on FOUNDATIONS OF NANOSCIENCE:
SELF-ASSEMBLED ARCHITECTURES AND DEVICES(FNANO05),
Snowbird, Utah, noon April 24-noon April 28, 2005.
Program Chairman of First Conference on FOUNDATIONS OF NANOSCIENCE:
SELF-ASSEMBLED ARCHITECTURES AND DEVICES(FNANO04),
Snowbird, Utah, April 21-23, 2004.
Program
coChairman (with Chen), The
9th International Meeting on DNA Based Computers, Madison, Wisconsin,
June 1-4, 2003.
Program Chairman of 34th ACM Symposium on Theory of
Computing(STOC2002)
MontrŽal, QuŽbec, Canada, May 19-21, 2002.
Research Interests:
- Biomolecular Computing and Self Assembly
of DNA Nanostructures
- My Papers in Biomolecular Computing and
Self Assembly of DNA Nanostructures
- Presentation
on DNA tiling lattices & DNA motors [ppt]
[pdf]
- Algorithms:
- Parallel Algorithms for Graphs, Algebra, Geometry and Sorting
- Other Alternative Models of Computation:
- Moleculular Electronics
Recent
paper on DNA Barcodes(experimentally demonstrating a method for programmed
molecular patterning): Hao Yan, Thomas H. LaBean, Liping Feng, and John H.
Reif, Directed Nucleation Assembly of Barcode Patterned DNA Lattices, Proceedings of the National Academy of Science(PNAS), Volume
100, No. 14, pp. 8103-8108, July 8, (2003). [PostScript] [PDF] Recent Publicity on DNA Barcodes paper.
Research Papers
- Many of my papers are available for
download in PostScript and PDF formats, organized by areas of my research.
Also, my vita has a list of my papers ordered by dates as well as locations
of many of my papers that can be downloaded.
- Lists (but no downloads) of some conference
papers are also available from the STOC conference database and the FOCS conference database
Papers
by Reif Categorized by Topics(104
downloadable out of total of 218 papers)
á
- Biomolecular
Computing and Self Assembly of DNA Nanostructures (44 papers)
á
- Motion Planning
and Kinodynamics in Robotics (28 papers)
-
Sequential and Parallel Algebraic and
Numerical Algorithms (29 papers)
- Sequential and Parallel Graph Algorithms
(24 papers)
- Sequential and Parallel Program
Optimization (16 papers)
- Randomized
Parallel Algorithms (6 papers)
- Optics and Optical Computing (11 papers)
- Computational Geometry (6 papers)
- N-Body and Molecular Simulations (5
papers)
- Quantum Computing (4 papers)
- Parallel Architectures (6 papers)
- Sequential and Parallel Optimization (3
papers)
- Sequential and Parallel Sorting (5
papers)
- Distributed and Real Time Algorithms (5
papers)
- Reliable Computing and Fault Testing (5
papers)
- Data Compression Algorithms (10 papers)
- Searching Algorithms and Learning Theory
(6 papers)
- Complexity of Games
(5 papers)
- Finance and Investment Theory (2 papers)
Edited Books
- VLSI Algorithms and Architectures, 3rd Aegean
Workshop on Computing, AWOC 88, Corfu, Greece, July 1988.
- Synthesis of Parallel Algorithms 22 chapters, over
1000 pages. Published by Morgan
Kaufmann,
Spring, 1993.
- Parallel Algorithm Derivation and Program
Transformation, 228 pages (edited with R. Paige and R. Wachter).
Published by Kluwer
Academic Publishers, June, 1993.
- Handbook of Randomized Computing (Edited by S. Rajasekaran, P. M.
Pardalos, J.H. Reif and J. Rolim), Kluwer Volume I and II, Academic Press,
London, 2001.
Teaching
- CPS 130 Introduction to
Efficient Algorithms, Fall 2006.
- CPS 237 Randomized
Algorithms, Spring, 2006
- CPS 130 Introduction to
Efficient Algorithms, Fall 2005.
- CPS 130 Introduction to
Efficient Algorithms, Spring 2005.
- CPS 230 Introduction to
Efficient Algorithms, Fall 2004.
- CPS 130 Introduction to
Efficient Algorithms, Spring 2004.
- CPS 237 Randomized Algorithms,
Fall, 2003.
- CPS 130 Introduction to
Efficient Algorithms, Spring 2003.
- CPS 230 Design and Analysis
of Efficient Algorithms, Fall 2002.
- CPS 237 Randomized
Algorithms, Spring 2002.
- CPS 130 Introduction to
Efficient Algorithms, Fall 2001.
- CPS 140:
Mathematical Foundations of Computer Science, Spring 2001.
- CPS 296.2 Computational
Biology, Fall 2000.
Information about my previous graduate
students can be found in my vita and at the computer
science genealogy.
Memberships and Awards
- Fellow, American
Association for the Advancement of Science(AAAS), since 2003.
- Fellow, Association
for Computing Machinery (ACM), since 1997.
- Fellow, Institute of
Electrical and Electronics Engineers (IEEE), since 1993.
- Fellow, Institute of Combinatoric s and its
Applications, since 1991.
- Society of Industrial and Applied
Mathematicians (SIAM)
- Sigma Xi Scientific Research Society
Biographical Information
- Family, Schooling, Work and Play. This is an informal
recounting, interweaving discussions of my Family, Schooling, Work (e.g., in
Computer Science), and Play (e.g., skiing).
- Family: Wife Jane Anderson, and two children,
Katie and Emily.
- Education: Ph.D. in Applied Mathematics
(Harvard University, July 1977).
- Professor of Computer Science at Duke
University since 1986.
Recreational Interests
- Extreme Skiing (Redman
at Mnt Baldy main chute, Alta, Utah)
Cross-Country Skiing
- WindSurfing &
learning KiteSurfing (KiteSurfing Instructions)
- Kayaking & Canoeing
- Hiking
Quotes
- ÒWater comes gushing forth from the sand,
the deeper and deeper it is dug; likewise, intelligence will grow, the more and
more a person studies.Ó - Thirukkural
-
ÒI have learnt this at least by my experiment, that if one advances
confidently in the direction of his dreams in the night, and endeavors to live
the life he has imagined, he will meet with a success unexpected in common
hours.Ó -Thoreau
Please
let me know if you have any problems with these web pages.