Adleman, Leonard M.
Overview
Works:  15 works in 64 publications in 4 languages and 953 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other 
Classifications:  QA241, 512.7 
Publication Timeline
.
Most widely held works about
Leonard M Adleman
 Classifying the complexity of the RSA algorithm : the state of the art by Leonor Charmaine Bosman( )
Most widely held works by
Leonard M Adleman
Algorithmic number theory : first international symposium, ANTSI, Ithaca, NY, USA, May 69, 1994 : proceedings by
Leonard M Adleman(
Book
)
25 editions published in 1994 in 4 languages and held by 390 WorldCat member libraries worldwide
"This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTSI, held at Cornell University, Ithaca, NY in May 1994. The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexitytheoretic aspects of number theory and thus report the stateoftheart in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding. Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references."PUBLISHER'S WEBSITE
25 editions published in 1994 in 4 languages and held by 390 WorldCat member libraries worldwide
"This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTSI, held at Cornell University, Ithaca, NY in May 1994. The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexitytheoretic aspects of number theory and thus report the stateoftheart in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding. Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references."PUBLISHER'S WEBSITE
Primality testing and Abelian varieties over finite fields by
Leonard M Adleman(
Book
)
18 editions published in 1992 in English and held by 378 WorldCat member libraries worldwide
From Gauss to G
18 editions published in 1992 in English and held by 378 WorldCat member libraries worldwide
From Gauss to G
On digital signatures and publickey cryptosystems by
Ronald L Rivest(
Book
)
3 editions published in 1977 in English and held by 10 WorldCat member libraries worldwide
It is shown that the single operation of raising a number to a fixed power modulo a composite modulus is sufficient to implement digital signatures: a way of creating for a (digitized) document a recognizable, unforgeable, documentdependent digitized signature whose authenticity the signer can not later deny. An electronic funds transfer system or electronic mail system clearly could use such a scheme, since the messages must be digitized in order to be transmitted
3 editions published in 1977 in English and held by 10 WorldCat member libraries worldwide
It is shown that the single operation of raising a number to a fixed power modulo a composite modulus is sufficient to implement digital signatures: a way of creating for a (digitized) document a recognizable, unforgeable, documentdependent digitized signature whose authenticity the signer can not later deny. An electronic funds transfer system or electronic mail system clearly could use such a scheme, since the messages must be digitized in order to be transmitted
Mental poker by
Adi Shamir(
Book
)
4 editions published in 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)
4 editions published in 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)
Time, space and randomness by
Leonard M Adleman(
Book
)
2 editions published in 1979 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 1979 in English and held by 8 WorldCat member libraries worldwide
Spacebounded simulation of multitape Turing machines by
Leonard M Adleman(
Book
)
3 editions published between 1979 and 1980 in English and Undetermined and held by 5 WorldCat member libraries worldwide
3 editions published between 1979 and 1980 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Computing with DNA by
Leonard M Adleman(
Book
)
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
Use of public key cryptography in communication system design by
Leonard M Adleman(
)
1 edition published in 1978 in English and held by 1 WorldCat member library worldwide
1 edition published in 1978 in English and held by 1 WorldCat member library worldwide
Computacion con ADN : la manipulacion de ADN orientada a la resolucion de problemas matematicos obliga a redefinir el termino
computacion by
Leonard M Adleman(
)
1 edition published in 1998 in Spanish and held by 1 WorldCat member library worldwide
1 edition published in 1998 in Spanish and held by 1 WorldCat member library worldwide
RSA ... conference proceedings by RSA Data Security Conference & Expo(
)
in English and held by 1 WorldCat member library worldwide
in English and held by 1 WorldCat member library worldwide
On Applying Molecular Computation to the Data Encryption Standard by
Leonard M Adleman(
)
1 edition published in 1999 in Undetermined and held by 1 WorldCat member library worldwide
Recently, Boneh, Dunworth, and Lipton (1996) described the potential use of molecular computation in attacking the United States Data Encryption Standard (DES), Here, we provide a description of such an attack using the sticker model of molecular computation. Our analysis suggests that such an attack might be mounted on a tabletop machine using approximately a gram of DNA and might succeed even in the presence of a large number of errors
1 edition published in 1999 in Undetermined and held by 1 WorldCat member library worldwide
Recently, Boneh, Dunworth, and Lipton (1996) described the potential use of molecular computation in attacking the United States Data Encryption Standard (DES), Here, we provide a description of such an attack using the sticker model of molecular computation. Our analysis suggests that such an attack might be mounted on a tabletop machine using approximately a gram of DNA and might succeed even in the presence of a large number of errors
Algorithmic number theory  ANTS I : first international symposium, Ithaca, NY, USA, May 69, 1994 ; proceedings by International Symposium on Algorithmic Number Theory(
Book
)
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Combinatorial optimization problems in selfassembly by
Leonard M Adleman(
Book
)
1 edition published in 2002 in Undetermined and held by 1 WorldCat member library worldwide
Selfassembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate selfassembly processes will ultimately be used in circuit fabrication, nanorobotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient selfassembly of shapes in the Tile Assembly Model of selfassembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape.Selfassembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate selfassembly processes will ultimately be used in circuit fabrication, nanorobotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient selfassembly of shapes in the Tile Assembly Model of selfassembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape. We prove that the first problem is NPcomplete in general, and polynomial time solvable on trees and squares. In order to pro
1 edition published in 2002 in Undetermined and held by 1 WorldCat member library worldwide
Selfassembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate selfassembly processes will ultimately be used in circuit fabrication, nanorobotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient selfassembly of shapes in the Tile Assembly Model of selfassembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape.Selfassembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate selfassembly processes will ultimately be used in circuit fabrication, nanorobotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient selfassembly of shapes in the Tile Assembly Model of selfassembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape. We prove that the first problem is NPcomplete in general, and polynomial time solvable on trees and squares. In order to pro
Computacion con ADN by
Leonard M Adleman(
)
1 edition published in 1998 in Spanish and held by 1 WorldCat member library worldwide
1 edition published in 1998 in Spanish and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Abelian pgroups Abelian varieties Adleman, Leonard M AlgebraData processing Algorithms Coding theory Combinatorial analysis Computers ComputersAccess controlPasswords Computer science Computer security Computer software Cryptography Data encryption (Computer science) DNA Electronic funds transfers Engineering Finite fields (Algebra) Mathematics Molecular biology Numbers, Prime Number theory Number theoryData processing Poker Privacy, Right of Random variables Rivest, Ronald L Shamir, Adi Turing machines
Alternative Names
Adleman, Leonard M.
Adleman, Leonard M. 1945
Len Adleman Amerikaans wiskundige
Leonard Adleman amerykański informatyk
Leonard Adleman chercheur américain en informatique théorique
Leonard Adleman Computer scientist, molecular biologist
Leonard Adleman matematico, informatico e biologo statunitense
Leonard Adleman USamerikanischer Mathematiker und Kryptologe
Леонард Адлеман
Леонард Ејдлман
Леонард Макс Адлеман
לאונרד אדלמן
لئونارد آدلمن
ليونارد أدليمان
লেনার্ড এডলম্যান
レオナルド・エーデルマン
伦纳德·阿德曼 Computer scientist, molecular biologist
Languages
Covers