BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
7 × USA
Collaborated with:
K.L.Manders M.A.Huang K.Kompella H.W.L.Jr. Q.Cheng A.Goel D.Kempe P.M.d.Espanés P.W.K.Rothemund
Talks about:
polynomi (3) problem (2) assembl (2) random (2) time (2) self (2) use (2) cryptosystem (1) combinatori (1) singular (1)

Person: Leonard M. Adleman

DBLP DBLP: Adleman:Leonard_M=

Contributed to:

STOC 20022002
STOC 20012001
STOC 19911991
STOC 19881988
STOC 19871987
STOC 19861986
STOC 19831983
STOC 19771977
STOC 19761976

Wrote 9 papers:

STOC-2002-AdlemanCGHKER #combinator #optimisation #problem #self
Combinatorial optimization problems in self-assembly (LMA, QC, AG, MDAH, DK, PMdE, PWKR), pp. 23–32.
STOC-2001-AdlemanCGH #self
Running time and program size for self-assembled squares (LMA, QC, AG, MDAH), pp. 740–748.
STOC-1991-Adleman #integer #using
Factoring Numbers Using Singular Integers (LMA), pp. 64–71.
STOC-1988-AdlemanK #parallel #using
Using Smoothness to Achieve Parallelism (LMA, KK), pp. 528–538.
STOC-1987-AdlemanH #polynomial #random
Recognizing Primes in Random Polynomial Time (LMA, MDAH), pp. 462–469.
STOC-1986-AdlemanL #finite
Finding Irreducible Polynomials over Finite Fields (LMA, HWLJ), pp. 350–355.
STOC-1983-Adleman #on the
On Breaking Generalized Knapsack Public Key Cryptosystems (LMA), pp. 402–412.
Reducibility, Randomness, and Intractability (LMA, KLM), pp. 151–163.
STOC-1976-MandersA #polynomial #problem
NP-Complete Decision Problems for Quadratic Polynomials (KLM, LMA), pp. 23–29.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.