
	Where results make sense

Topic: Leonard Adleman

Related Topics

University of Southern California

In the News (Mon 7 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Kids.Net.Au - Encyclopedia > Leonard Adleman (Site not responding. Last check: 2007-10-20)
		Leonard Adleman is a noted theoretical computer scientist[?] and professor of computer science and molecular biology at the University of Southern California.
		He is known for being the inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing.
		For his contribution to the invention of the RSA cryptosystem, Adleman was a recipient along with Ron Rivest and Adi Shamir of the 2002 ACM Turing Award, often called the Nobel Prize of Computer Science.
	www.kids.net.au /encyclopedia-wiki/le/Leonard_Adleman (230 words)

	Leonard Adleman Summary
		Leonard Adleman is best known in the field of computing for his work on the development of the RSA system for data encryption (cryptography).
		Adleman felt that computer viruses could open up many new possibilities, and that their nuisance value could potentially be outweighed by the good that may come from the technology in the future.
		Leonard Max Adleman (born December 31, 1945) is a theoretical computer scientist and professor of computer science and molecular biology at the University of Southern California.
	www.bookrags.com /Leonard_Adleman (1231 words)

	Leonard Adleman
		Leonard Adleman is a noted theoretical computer scientist[?] and professor of computer science and molecular biology at the University of Southern California.
		He is known for being the inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing.
		For his contribution to the invention of the RSA cryptosystem, Adleman was a recipient along with Ron Rivest and Adi Shamir of the 2002 ACM Turing Award, often called the Nobel Prize of Computer Science.
	www.ebroadcast.com.au /lookup/encyclopedia/le/Leonard_Adleman.html (205 words)

	Leonard Adleman - Wikipedia, the free encyclopedia
		Leonard Max Adleman (born December 31, 1945) is a theoretical computer scientist and professor of computer science and molecular biology at the University of Southern California.
		He is known for being a co-inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing.
		Born in California, Adleman grew up in San Francisco, and attended the University of California, Berkeley, where he received his BA in mathematics in 1968 and his Ph.D. in EECS in 1976.
	en.wikipedia.org /wiki/Leonard_Adleman (371 words)

	2002 News Releases - Using 'Nature's Toolbox,' a DNA Computer Solves a Complex Problem
		The new experiment was carried out by USC computer science professor Dr. Leonard Adleman, who made headlines in 1994 by demonstrating that DNA -- the spiraling molecule that holds life's genetic code -- could be used to carry out computations.
		Adleman's new experiment solves a problem requiring the evaluation of more than one million possible solutions -- too complex for anyone to solve without the aid of a computer.
		Adleman's chief scientist, Nickolas Chelyapov, offered this illustration: Imagine that a fussy customer walks onto a million-car auto square and gives the dealer a complicated list of criteria for the car he wants.
	www.jpl.nasa.gov /releases/2002/release_2002_63.html (924 words)

	Adleman biography
		Adleman decided to join graduate school and come away with an understanding of Gödel's theorem at a level beyond the superficial.
		Adleman was soon preoccupied with the study of white blood cells called T lymphocytes whose steady decline in AIDS patients leave them vulnerable to lethal infections.
		Adleman first assigned a random DNA sequence to each vertex and edge in the graph (the sequences are known as oligonucleotides).
	www-groups.dcs.st-and.ac.uk /~history/Biographies/Adleman.html (3370 words)

	DNA Computing by Mike Wisz
		Adleman used DNA to solve a system of six vertices, which is not difficult for modern computers, but as the number of cities grows so does the number of paths between them, making a 1,000 city path impossible to solve for even the best supercomputers.
		Adleman's first step was to synthesize DNA strands of known sequences, each strand 20 nucleotides long.
		Adleman used well-established techniques of molecular biology to weed out the Hamiltonian path, the one that entered all vertices, starting at one and ending at six.
	xtrj.org /ssm6/usc_experiment.htm (874 words)

	DNA Computers
		And even if Adleman's test-tube and robot-arm computer, or someone else's design, can be made to run, they may never be able to handle important problems as quickly and cheaply as their silicon rivals.
		As Adleman says, with a note of irony: "All we have to do is outperform the miracle of our time, the electronic computer." It's unlikely that DNA computers will triumph by trying to beat electronic computers at their own game.
		To solve this with DNA in a test tube, Leonard Adleman of the University of Southern California made strands of DNA, each one 20 bases long, and each corresponding to a city or one of the allowable paths between cities.
	www.geocities.com /yeocolin/dna-computer.htm (3325 words)

	In the NEWS Unit 2
		After spending time in a molecular biology lab, computer scientist Leonard Adleman realized something that the cell has known for millions of years: A molecule of DNA is a great way to store a whole lot of information.
		Adleman set out to build the first molecular computer and to use that computer to solve a problem.
		The problem Adleman chose to solve with his molecular computer was to find the best flight path between a set of cities.
	www.phschool.com /science/biosurf/genetics/2news.html (388 words)

	ComputerBase - Lexikon: Leonard Adleman (Site not responding. Last check: 2007-10-20)
		Adleman studierte an der Universität von Kalifornien in Berkeley, wo er 1968 seinen Bachelor und 1976 den Doktortitel für Elektrotechnik und Informatik (EECS = „Electrical Engeneering and Computer Sciences“) erhielt.
		In dem Beitrag löste er mit Hilfe der DNA ein Hamiltonkreisproblem mit sieben Knotenpunkten und schilderte damit den ersten erfolgreichen Versuch zum Einsatz eines Biocomputers.
		Ebenfalls 2002 erhielt Adleman zusammen mit Ron Rivest und Adi Shamir als einer der Entwickler des RSA-Algorithmus den Turing-Preis für das Jahr 2002.
	www.computerbase.de /lexikon/Leonard_Adleman (286 words)

	Technology Review: DNA Computing
		Adleman demonstrated that the billions of molecules in a drop of DNA contained raw computational power that might-just might-overwhelm silicon.
		As Adleman and others in the field have come to realize, there may never be a computer made from DNA that directly rivals today's silicon-based microelectronics.
		As Adleman now sees it, DNA computing is a field that's less about beating silicon than about surprising new combinations of biology and computer science that are pushing the limits in both fields-sometimes in unexpected directions.
	www.technologyreview.com /articles/00/05/regalado0500.asp (548 words)

	Leonard Adleman - CryptoDox
		Leonard Adleman (born December 31, 1945) is a theoretical computer scientist and professor of computer science and molecular biology at the University of Southern California.
		He is known for being the inventor of RSA in 1977, and of DNA computing.
		Born in California, Adleman grew up in San Francisco, and attended the University of California, Berkeley, where he received his Bachelor's degree in 1968 and his Ph.D. in 1976.
	www.cryptodox.com /Leonard_Adleman (239 words)

	EETimes.com - Time to Engineer DNA Computers
		Leonard Adleman, the man who invented the "DNA computer," claims that the riches lie along the side of the road rather than at the end of the rainbow.
		Leonard Adleman envisions much more sophisticated DNA computer uses than today's apps offer because of the tools we find in a living cell.
		Adleman doesn't claim to know how engineers will use this molecule specifically, but he envisions applications that are orders of magnitude more sophisticated than today's apps.
	www.eetimes.com /story/OEG20001221S0032 (1399 words)

	3.08: Gene Genie
		Adleman, a mathematician well-known for his work in computer security and cryptography, was struck by the similarity between DNA - the basic stuff of life - and computers.
		Adleman's office is a 10-by-10 faceless cubby furnished with a metal desk and a couple of brown plastic chairs.
		Adleman had never heard of the NSA, the government's secret spy apparatus (remember, this was the '70s); the spies were calling to say that the US government classifies cryptography as a munition, and that if they mailed their article overseas, they would be prosecuted for illegal arms dealing.
	www.wired.com /wired/archive/3.08/molecular_pr.html (4442 words)

	ACM: A.M. Turing Award
		Rivest, Shamir and Adleman was "a significant advance in enabling secure communication among computers using public-key cryptography." It noted that the RSA system is used in email systems, web browsers, secure shells, virtual private networks, mobile phone, and in many other applications requiring the secure exchange of information.
		Leonard M. Adleman is Distinguished Henry Salvatori Professor of Computer Science and Professor of Molecular Biology at the University of Southern California.
		Leonard Adleman, a mathematician by training, has recently extended his professional interests to the biotechnology field.
	www.acm.org /announcements/turing_2002.html (1013 words)

	UnravellingGenetics>Applications>DNAComputers
		Adleman tested out the viability of the DNA computer by solving the Hamilton path question for seven cities.
		Although everyone agreed that his ideas were revolutionary, many scientists questioned whether Adleman's small demonstration experiment could be scaled up to solve real-world problems, and whether any practical problems existed that needed DNA computation to solve.
		Using Adleman's initial technique, a huge quantity of DNA would be required to solve practical problems because there is no easy way to custom-make the DNA strands.
	library.thinkquest.org /C001764/applications/dnacomp.htm (508 words)

	The My Hero Project - Leonard Adleman
		Adleman came up with an idea to use DNA as a sequence to create the path between the cities.
		Adleman would give each city a random sequence of six nucleotides (A, T, C, and G, representing Adenine, Thymine, Cytosine, and Guanine) and then by running DNA through several elimination style tests, would produce the correct sequence of nucleotides and thus the correct path.
		Leonard Adleman is my hero because he has worked to improve our everyday lives, and perhaps with too little credit for doing so.
	www.myhero.com /myhero/hero.asp?hero=adleman_fredericksburg_04 (1887 words)

	March 19
		Using strands of DNA rather than silicon chips, Dr. Leonard Adleman and a team at the University of Southern California solved what they say may be the largest computation done by nonelectronic means.
		By raising the number to 20, Dr. Leonard Adleman and his colleagues at U.S.C. solved what they say may be the largest problem done by nonelectronic means.
		Adleman brought DNA computers to the world's attention in 1994 by solving a simple version of the traveling salesman problem, which also belongs to the class NP-complete.
	cas.bellarmine.edu /tietjen/Evolution/AI/DNA_Computing.htm (1121 words)

	NASA ITSR: Computing with DNA
		Adleman saw this predictable pattern as an opportunity to create a new kind of computer.
		Adleman's current process requires creating, duplicating, and separating a number of DNA strands that increases exponentially with the number of variables.
		Adleman's team is exploring molecular self-assembly as a way to create nanoscale electronic and quantum devices.
	itsr.cict.nasa.gov /ts_dnacomp.html (515 words)

	Forbes.com - Magazine Article (Site not responding. Last check: 2007-10-20)
		When Leonard Adleman, a mathematician at the University of Southern California, built the first DNA computer in 1994, it looked like he found the machine of the future.
		Adleman mimicked this process in the laboratory, and used it to solve something called the traveling-salesman problem.
		But Yurke and Adleman argue that making DNA computers to replace desktop machines may not be the point of their research after all.
	www.forbes.com /2000/09/19/feat2_print.html (889 words)

	Stuffo "How DNA Computers Will Work" (Site not responding. Last check: 2007-10-20)
		Adleman, a computer scientist at the University of Southern California, came to the conclusion that DNA had computational potential after reading the book "Molecular Biology of the Gene," written by James Watson, who co-discovered the structure of DNA in 1953.
		Adleman is often called the inventor of DNA computers.
		Adleman eliminates the wrong molecules through chemical reactions, which leaves behind only the flight paths that connect all seven cities.
	www.stuffo.com /dna-computer1.htm (676 words)

	ADLEMAN
		Leonard Adleman received a B.S. in Mathematics and a Ph.D. in Computer Science from the University of California at Berkeley in 1968 and 1976, respectively.
		He was a member of the faculty of mathematics at the Massachusetts Institute of Technology from 1976 to 1980, where he contributed to the invention of the RSA Public-Key Cryptosystem, as well as its related algorithms.
		Adleman is a member of the National Academy of Engineering.
	www.algana.co.uk /FamousNames/A/adleman.htm (118 words)

	Michael Passarelli, Decrypting Cryptography
		Leonard Adleman’s path to MIT, the birthplace of RSA, was neither effortless nor rapid.
		In 1980, Leonard Adleman joined the computer science faculty at the University of Southern California, where he is currently [3].
		Recently, Leonard Adleman correctly computed the answer to the problem of how to travel through seven cities without visiting any city twice using trillions of DNA strands [4].
	www.facstaff.bucknell.edu /udaepp/090/w3/xyz.html (1789 words)

	Boston.com / Business / Researchers pursue biology-based computers
		SAN FRANCISCO -- It almost sounds too fantastic to be true, but a growing amount of research supports the idea that DNA, the basic building block of life, could also be the basis of a staggeringly powerful new generation of computers.
		What struck Adleman most that night he jumped out of bed was how a living enzyme "reads" DNA much the same way computer pioneer Alan Turing first contemplated in 1936 how a machine could read data.
		Adleman used his computer to solve the classic "traveling salesman" mathematical problem -- how a salesman can visit a given number of cities without passing through any city twice -- by exploiting the predictability of how DNA interacts.
	www.boston.com /business/globe/articles/2003/08/18/researchers_pursue_biology_based_computers (774 words)

	USC Viterbi School of Engineering : Two USC Faculty Elected to Nation’s Top Scientific and Arts Academies
		Adleman is a USC Distinguished Professor and the Henry Salvatori Professor of Computer Science.
		In a 1994 paper, Adleman demonstrated that DNA molecules could act as a computer and he used it to solve a simple problem, creating the new field of molecular computing.
		Adleman is among 72 new members of the National Academy of Sciences.
	viterbi.usc.edu /links/?117 (845 words)

	Leonard Adleman - Cleverpedia, the ultimate encyclopedia (Site not responding. Last check: 2007-10-20)
		Leonard Adleman (* 31 December 1945 in San Francisco) is a professor for computer sciences and molecular biology at the university of south California in Los Angeles.
		Adleman studied at the university of California in Berkeley, where he received 1976 its doctor title.
		Professor Adleman was a mathematical advisor for the film “Sneakers - sound lots” with Robert Redford, Regie Larry Lasker.
	cleverpedia.com /Leonard_Adleman (137 words)

Try your search on: Qwika (all wikis)