Leonid A. Levin
Леони́д Анато́льевич Ле́вин
Person information
- unicode name: Леони́д Анато́льевич Ле́вин
- affiliation: Boston University, MA, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
- [j18]Leonid A. Levin, Ramarathnam Venkatesan:
An Average Case NP-complete Graph Colouring Problem. Combinatorics, Probability & Computing 27(5): 808-828 (2018) - 2016
- [j17]Leonid A. Levin:
Occam bound on lowest complexity of elements. Ann. Pure Appl. Logic 167(10): 897-900 (2016) - 2014
- [i16]
- [i15]
- 2013
- [j16]
- 2012
- [c22]
- [c21]
- [i14]
- [i13]
- 2011
- [c20]Leonid A. Levin:
Universal Heuristics: How Do Humans Solve "Unsolvable" Problems? Algorithmic Probability and Friends 2011: 53-54 - [p1]Oded Goldreich, Leonid A. Levin, Noam Nisan:
On Constructing 1-1 One-Way Functions. Studies in Complexity and Cryptography 2011: 13-25 - 2010
- [j15]Leonid A. Levin:
Some theorems on the algorithmic approach to probability theory and information theory: (1971 Dissertation directed by A.N. Kolmogorov). Ann. Pure Appl. Logic 162(3): 224-235 (2010) - [c19]
- [i12]Leonid A. Levin:
Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory. CoRR abs/1009.5894 (2010)
2000 – 2009
- 2008
- [j14]
- [c18]Leonid A. Levin:
The Grace of Quadratic Norms: Some Examples. Pillars of Computer Science 2008: 457-459 - 2006
- [c17]
- [i11]
- 2005
- [j13]Leonid A. Levin:
Aperiodic Tilings: Breaking Translational Symmetry. Comput. J. 48(6): 642-645 (2005) - [j12]Jeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A. Levin, Ueli M. Maurer, David Metcalf:
Byzantine Agreement Given Partial Broadcast. J. Cryptology 18(3): 191-217 (2005) - [i10]
- [i9]
- 2004
- [i8]
- 2003
- [j11]
- 2002
- [c16]
- [i7]
- 2001
- [c15]
- [i6]
- [i5]Leonid A. Levin, Ramarathnam Venkatesan:
An Average Case NP-complete Graph Problem. CoRR cs.CC/0112001 (2001) - 2000
- [j10]Leonid A. Levin:
Self-stabilization of circular arrays of automata. Theor. Comput. Sci. 235(1): 143-144 (2000) - [i4]
- [i3]
- [i2]Jeffrey Considine, Leonid A. Levin, David Metcalf:
Byzantine Agreement with Faulty Majority using Bounded Broadcast. CoRR cs.DC/0012024 (2000)
1990 – 1999
- 1999
- [j9]
- [j8]Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby:
A Pseudorandom Generator from any One-way Function. SIAM J. Comput. 28(4): 1364-1396 (1999) - 1997
- [j7]
- 1996
- [j6]
- [j5]
- 1995
- [j4]
- [i1]Oded Goldreich, Leonid A. Levin, Noam Nisan:
On Constructing 1-1 One-Way Functions. Electronic Colloquium on Computational Complexity (ECCC) 2(29) (1995) - 1994
- [c14]Gene Itkis, Leonid A. Levin:
Fast and Lean Self-Stabilizing Asynchronous Protocols. FOCS 1994: 226-239 - 1991
- [c13]László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy:
Checking Computations in Polylogarithmic Time. STOC 1991: 21-31 - 1990
- [c12]Shafi Goldwasser, Leonid A. Levin:
Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO 1990: 77-93 - [c11]Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman:
Security Preserving Amplification of Hardness. FOCS 1990: 318-326 - [c10]Russell Impagliazzo, Leonid A. Levin:
No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random. FOCS 1990: 812-821
1980 – 1989
- 1989
- [c9]Gene Itkis, Leonid A. Levin:
Power of Fast VLSI Models Is Insensitive to Wires' Thinness. FOCS 1989: 402-407 - [c8]Russell Impagliazzo, Leonid A. Levin, Michael Luby:
Pseudo-random Generation from one-way functions (Extended Abstracts). STOC 1989: 12-24 - [c7]
- 1988
- [c6]
- [c5]Ramarathnam Venkatesan, Leonid A. Levin:
Random Instances of a Graph Coloring Problem Are Hard. STOC 1988: 217-222 - 1987
- [j3]
- 1986
- [j2]
- 1985
- [c4]
- 1984
- [j1]Leonid A. Levin:
Randomness Conservation Inequalities; Information and Independence in Mathematical Theories. Information and Control 61(1): 15-37 (1984) - [c3]
- 1982
- [c2]Boris Yamnitsky, Leonid A. Levin:
An Old Linear Programming Algorithm Runs in Polynomial Time. FOCS 1982: 327-328
1970 – 1979
- 1977
- [c1]
Coauthor Index
last updated on 2019-02-14 22:55 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint