Travelled to:1 × Croatia
1 × Greece
5 × USA
Collaborated with:∅ O.Goldreich R.Venkatesan B.Durand A.Shen R.Impagliazzo M.Luby L.Babai L.Fortnow M.Szegedy
Talks about:function (3) way (3) one (3) problem (2) instanc (2) generat (2) random (2) hard (2) polylogarithm (1) pseudorandom (1)
Person: Leonid A. Levin
DBLP: Levin:Leonid_A=
Contributed to:
2012
200119911989198819851984Wrote 8 papers:
- LICS-2012-Levin #internet #what
- Turing’s Password: What Internet Cannot Leak (LAL), p. 11.
- STOC-2001-DurandLS
- Complex tilings (BD, LAL, AS), pp. 732–739.
- STOC-1991-BabaiFLS
- Checking Computations in Polylogarithmic Time (LB, LF, LAL, MS), pp. 21–31.
- STOC-1989-GoldreichL
- A Hard-Core Predicate for all One-Way Functions (OG, LAL), pp. 25–32.
- STOC-1989-ImpagliazzoLL #generative #pseudo
- Pseudo-random Generation from one-way functions (RI, LAL, ML), pp. 12–24.
- STOC-1988-VenkatesanL #graph #problem #random
- Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.
- STOC-1985-Levin #generative #pseudo
- One-Way Functions and Pseudorandom Generators (LAL), pp. 363–365.
- STOC-1984-Levin #problem
- Problems, Complete in “Average” Instance (LAL), p. 465.