Leonard M. Adleman

Available identifiers

zbMath Open adleman.leonard-mWikidataQ918650 ScholiaQ918650MaRDI QIDQ207153

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5075309	2022-05-12	Paper
Running time and program size for self-assembled squares	2015-02-27	Paper
Combinatorial optimization problems in self-assembly	2010-08-05	Paper
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly	2010-01-06	Paper
On the Mathematics of the Law of Mass Action	2008-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q4664413	2005-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q4941233	2003-03-26	Paper
Function field sieve method for discrete logarithms over finite fields	2003-01-14	Paper
Counting points on curves and Abelian varieties over finite fields	2002-06-07	Paper
A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)	2000-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4224876	1999-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q4224877	1999-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4375592	1998-10-04	Paper
Quantum Computability	1998-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q4341740	1997-07-20	Paper
Efficient checkers for number-theoretic computations	1996-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4847920	1996-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q4847910	1996-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q4847935	1995-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4847943	1995-10-18	Paper
Fast Checkers for Cryptography	1994-09-20	Paper
A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields	1994-01-04	Paper
Primality testing and Abelian varieties over finite fields	1992-09-18	Paper
Inductive inference and unsolvability	1992-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q3972531	1992-06-25	Paper
Solving Bivariate Quadratic Congruences in Random Polynomial Time	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3808149	1987-01-01	Paper
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3719832	1985-01-01	Paper
The first case of Fermat's last theorem	1985-01-01	Paper
On distinguishing prime numbers from composite numbers	1983-01-01	Paper
Irreducibility Testing and Factorization of Polynomials	1983-01-01	Paper
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem	1983-01-01	Paper
An $O(n^{1/10.89))$ Primality Testing Algorithm,$	1981-01-01	Paper
Space-bounded simulation of multitape turing machines	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3904048	1980-01-01	Paper
NP-complete decision problems for binary quadratics	1978-01-01	Paper
Improved time and space bounds for Boolean matrix multiplication	1978-01-01	Paper
A method for obtaining digital signatures and public-key cryptosystems	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4162483	1976-01-01	Paper
Short permutation strings	1974-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Leonard M. Adleman