ADLEMAN, LEONARD M. / Informatique / Chercheurs

Centre International de Recherche Scientifique

Chercheurs

Informatique / ADLEMAN, LEONARD M.

adlemanpollux.usc.edu

Position

Henry Salvatori Professor of Computer Science
And Professor of Molecular Biology
University of Southern California
Los Angeles, California

Thèmes de recherche

Algorithms
Computational Complexity
Computer Viruses
Cryptography
DNA Computing
Immunology
Molecular Biology
Number Theory
Quantum ComputingAlgorithms
Computational Complexity
Computer Viruses
Cryptography
DNA Computing
Immunology
Molecular Biology
Number Theory
Quantum Computing

Prix et récompenses

2000- IEEE Kobayashi Award for Computers and Communications (Joint with Rivest and Shamir).

2000- Distinguished Professor title University of Southern California

1997- RSA Chair created at MIT in honor of inventors of RSA Cryptosystem. (First holder: Professor Shafi Goildwasser - Dept. of Computer Science, MIT)

1996- ACM Paris Kanallakis Award for Theory and Practice. For work on Public-Key-Cryptography (joint with Diffie, Hellman, Merkle, Rivest and Shamir).+

1996- Elected to the National Academy of Engineering.

1995- Distinguished Alumnus Award
Department of Computer Science and Engineering University of California, Berkeley

1991- Senior Research Award University of Southern California School of Engineering

1978- Best paper award of the IEEE Group on Information Theory "A
Method for Obtaining Digital Signatures and Public-Key
Cryptosystems," Communications of the ACM, 21(2):120-126,(February) 1978. (with R. Rivest and A. Shamir).

Publications

Leonard M. Adleman, Ming-Deh A. Huang: Function Field Sieve Method for Discrete Logarithms over Finite Fields. Information and Compuation151(1-2): 5-16 (1999)

Leonard M. Adleman, Jonathan deMarrais, Ming-Deh A. Huang: A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). TCS 226(1-2): 7-18(1999)

Sam Roweis, Erik Winfree, Richard Burgoyne, Nickolas Chelyapov, Myron Goodman, Paul Rothemund, Leonard Adleman: A sticker based architecture for DNA computation. 2nd annual workshop on DNA Computing, Princeton University. Eds. L. Landweber and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 1-29 (1999).

Leonard Adleman, Paul W. K. Rothemund, Sam Roweis, Erik Winfree: On applying molecular computation to the Data Encryption Standard. 2nd annual workshop on DNA Computing, Princeton University, Eds. L. Landweber and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 31-44 (1999).

Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang: Quantum Computability. SIAMJ. Comput. 26(5): 1524-1540 (1997)

Leonard Adleman, David Wofsy: Blind T-cell homeostasis in CD4-deficient mice. J Acquir Immune Defic Syndr Hum Retrovirol 1996 Apr 1;11(4):334-40

Leonard Adleman: On constructing a molecular computer, DNA Based Computers, Eds. R. Lipton and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 1-21 (1996)

Leonard Adleman, Ming-Deh Huang: Counting rational points on curves and Abelian varieties over finite fields. Proceedings of the 1996 Algorithmic Number Theory Symposium, Ed. H. Cohen. Cohen. Springer-Verlag Lecture Notes In Computer Science, 1122:1-16, 1996

Leonard M. Adleman: Algorithmic Number Theory and Its Relationship to Computational Complexity. Computer Science Today 1995: 159-171

Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella: Efficient Checkers for Number-Theoretic Computations. Information and Computation121(1): 93-102 (1995)

Mentions légales - Contact

Copyright © 2013 - www.cirs.info - Tous droits réservés