Invariant Properties of Informational Bulks. - Leonid A. Levin; V. V. V'jugin (MFCS, 1977)

An Old Linear Programming Algorithm Runs in Polynomial Time - Boris Yamnitsky; Leonid A. Levin (FOCS, 1982)

Problems, Complete in "Average" Instance - Leonid A. Levin (STOC, 1984)

Randomness Conservation Inequalities; Information and Independence in Mathematical Theories - Leonid A. Levin (Inf. Control., 1984)

Average Case Complete Problems. - Leonid A. Levin (SIAM J. Comput., 1986)

One-way functions and pseudorandom generators. - Leonid A. Levin (Comb., 1987)

Homogeneous Measures and Polynomial Time Invariants - Leonid A. Levin (FOCS, 1988)

Random Instances of a Graph Coloring Problem Are Hard - Ramarathnam Venkatesan; Leonid A. Levin (STOC, 1988)

Power of Fast VLSI Models Is Insensitive to Wires' Thinness - Gene Itkis; Leonid A. Levin (FOCS, 1989)

A Hard-Core Predicate for all One-Way Functions - Oded Goldreich 001; Leonid A. Levin (STOC, 1989)

Pseudo-random Generation from one-way functions (Extended Abstracts) - Russell Impagliazzo; Leonid A. Levin; Michael Luby (STOC, 1989)

Fair Computation of General Functions in Presence of Immoral Majority. - Shafi Goldwasser; Leonid A. Levin (CRYPTO, 1990)

Security Preserving Amplification of Hardness - Oded Goldreich 001; Russell Impagliazzo; Leonid A. Levin; Ramarathnam Venkatesan; David Zuckerman (FOCS, 1990)

No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random - Russell Impagliazzo; Leonid A. Levin (FOCS, 1990)

Checking Computations in Polylogarithmic Time - László Babai; Lance Fortnow; Leonid A. Levin; Mario Szegedy (STOC, 1991)

Theory of computation: how to start. - Leonid A. Levin (SIGACT News, 1991)

Fast and Lean Self-Stabilizing Asynchronous Protocols - Gene Itkis; Leonid A. Levin (FOCS, 1994)

On Constructing 1-1 One-Way Functions - Oded Goldreich 001; Leonid A. Levin; Noam Nisan (Electron. Colloquium Comput. Complex., 1995)

STOC Criteria. - Leonid A. Levin (SIGACT News, 1995)

Fundamentals of computing (a cheatlist). - Leonid A. Levin (SIGACT News, 1996)

Computational Complexity of Functions. - Leonid A. Levin (Theor. Comput. Sci., 1996)

Errata to "Fundamentals of Computing". - Leonid A. Levin (SIGACT News, 1997)

Robust Measures of Information. - Leonid A. Levin (Comput. J., 1999)

A Pseudorandom Generator from any One-way Function. - Johan Håstad; Russell Impagliazzo; Leonid A. Levin; Michael Luby (SIAM J. Comput., 1999)

The Equity Tax and Shelter - Leonid A. Levin (CoRR, 2000)

Byzantine Agreement with Faulty Majority using Bounded Broadcast - Jeffrey Considine; Leonid A. Levin; David Metcalf (CoRR, 2000)

Self-stabilization of circular arrays of automata. - Leonid A. Levin (Theor. Comput. Sci., 2000)

An Average Case NP-complete Graph Problem - Leonid A. Levin; Ramarathnam Venkatesan (CoRR, 2001)

The Tale of One-Way Functions. - Leonid A. Levin (Probl. Inf. Transm., 2003)

Aperiodic Tilings: Breaking Translational Symmetry. - Leonid A. Levin (Comput. J., 2005)

Notes for Miscellaneous Lectures - Leonid A. Levin (CoRR, 2005)

Byzantine Agreement Given Partial Broadcast. - Jeffrey Considine; Matthias Fitzi; Matthew K. Franklin; Leonid A. Levin; Ueli M. Maurer; David Metcalf (J. Cryptol., 2005)

Flat Holonomies on Automata Networks. - Gene Itkis; Leonid A. Levin (STACS, 2006)

The Grace of Quadratic Norms: Some Examples. - Leonid A. Levin (Pillars of Computer Science, 2008)

Complex tilings. - Bruno Durand 001; Leonid A. Levin; Alexander Shen 001 (J. Symb. Log., 2008)

Arcane Information, Solving Relations, and Church Censorship. - Leonid A. Levin (SSS, 2010)

Some theorems on the algorithmic approach to probability theory and information theory: (1971 Dissertation directed by A.N. Kolmogorov). - Leonid A. Levin (Ann. Pure Appl. Log., 2010)

Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory - Leonid A. Levin (CoRR, 2010)

On Constructing 1-1 One-Way Functions. - Oded Goldreich 001; Leonid A. Levin; Noam Nisan (Studies in Complexity and Cryptography, 2011)

Universal Heuristics: How Do Humans Solve "Unsolvable" Problems? - Leonid A. Levin (Algorithmic Probability and Friends, 2011)

Rarity for Semimeasures. - Leonid A. Levin (FOCS, 2012)

Turing's Password: What Internet Cannot Leak. - Leonid A. Levin (LICS, 2012)

Enumerable Distributions, Randomness, Dependence - Leonid A. Levin (CoRR, 2012)

Randomness and Non-determinism - Leonid A. Levin (CoRR, 2012)

Forbidden information. - Leonid A. Levin (J. ACM, 2013)

Sets Have Simple Members. (repost). - Leonid A. Levin (CoRR, 2014)

Occam bound on lowest complexity of elements. - Leonid A. Levin (Ann. Pure Appl. Log., 2016)

An Average Case NP-complete Graph Colouring Problem. - Leonid A. Levin; Ramarathnam Venkatesan (Comb. Probab. Comput., 2018)

Fundamentals of Computing. - Leonid A. Levin (CoRR, 2020)

Climbing algorithms (invited talk). - Leonid A. Levin (STOC, 2021)

The Dual Matrix Algorithm for Linear Programming. - Leonid A. Levin (CoRR, 2021)

On Power Set Axiom. - Leonid A. Levin (CoRR, 2022)

How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson? - Leonid A. Levin (CoRR, 2022)

Gacs - Kucera theorem. - Leonid A. Levin (Theor. Comput. Sci., 2022)

Invited Paper: How Do Humans Succeed in Tasks Like Proving Fermat's Theorem or Predicting the Higgs Boson? - Leonid A. Levin (SSS, 2023)