| 2023 | SSS | Invited Paper: How Do Humans Succeed in Tasks Like Proving Fermat's Theorem or Predicting the Higgs Boson? | Leonid A. Levin |
| 2021 | STOC | Climbing algorithms (invited talk). | Leonid A. Levin |
| 2012 | FOCS | Rarity for Semimeasures. | Leonid A. Levin |
| 2012 | LICS | Turing's Password: What Internet Cannot Leak. | Leonid A. Levin |
| 2010 | SSS | Arcane Information, Solving Relations, and Church Censorship. | Leonid A. Levin |
| 2006 | STACS | Flat Holonomies on Automata Networks. | Gene Itkis, Leonid A. Levin |
| 2002 | FOCS | Forbidden Information. | Leonid A. Levin |
| 2001 | STOC | Complex tilings. | Bruno Durand, Leonid A. Levin, Alexander Shen |
| 1994 | FOCS | Fast and Lean Self-Stabilizing Asynchronous Protocols | Gene Itkis, Leonid A. Levin |
| 1991 | STOC | Checking Computations in Polylogarithmic Time | Lszl Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy |
| 1990 | CRYPTO | Fair Computation of General Functions in Presence of Immoral Majority. | Shafi Goldwasser, Leonid A. Levin |
| 1990 | FOCS | Security Preserving Amplification of Hardness | Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman |
| 1990 | FOCS | No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random | Russell Impagliazzo, Leonid A. Levin |
| 1989 | FOCS | Power of Fast VLSI Models Is Insensitive to Wires' Thinness | Gene Itkis, Leonid A. Levin |
| 1989 | STOC | A Hard-Core Predicate for all One-Way Functions | Oded Goldreich, Leonid A. Levin |
| 1989 | STOC | Pseudo-random Generation from one-way functions (Extended Abstracts) | Russell Impagliazzo, Leonid A. Levin, Michael Luby |
| 1988 | FOCS | Homogeneous Measures and Polynomial Time Invariants | Leonid A. Levin |
| 1988 | STOC | Random Instances of a Graph Coloring Problem Are Hard | Ramarathnam Venkatesan, Leonid A. Levin |
| 1985 | STOC | One-Way Functions and Pseudorandom Generators | Leonid A. Levin |
| 1984 | STOC | Problems, Complete in "Average" Instance | Leonid A. Levin |
| 1982 | FOCS | An Old Linear Programming Algorithm Runs in Polynomial Time | Boris Yamnitsky, Leonid A. Levin |
| 1977 | MFCS | Invariant Properties of Informational Bulks. | Leonid A. Levin, V. V. V'jugin |