Leonid A. Levin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2023

Invited Paper: How Do Humans Succeed in Tasks Like Proving Fermat's Theorem or Predicting the Higgs Boson?Leonid A. Levin. sss 2023: 513-517 [doi]

2022

Gacs - Kucera theoremLeonid A. Levin. TCS, 929:172-173, 2022. [doi]

2021

Climbing algorithms (invited talk)Leonid A. Levin. stoc 2021: 2-3 [doi]

2018

An Average Case NP-complete Graph Colouring ProblemLeonid A. Levin, Ramarathnam Venkatesan. cpc, 27(5):808-828, 2018. [doi]

2016

Occam bound on lowest complexity of elementsLeonid A. Levin. APAL, 167(10):897-900, 2016. [doi]

2013

Forbidden informationLeonid A. Levin. JACM, 60(2):9, 2013. [doi]

2012

Turing's Password: What Internet Cannot LeakLeonid A. Levin. lics 2012: 11 [doi]

Rarity for SemimeasuresLeonid A. Levin. focs 2012: 510-513 [doi]

2011

On Constructing 1-1 One-Way FunctionsOded Goldreich, Leonid A. Levin, Noam Nisan. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 13-25, Springer, 2011. [doi]

Universal Heuristics: How Do Humans Solve "Unsolvable" Problems?Leonid A. Levin. BIRTHDAY 2013: 53-54 [doi]

2010

Some theorems on the algorithmic approach to probability theory and information theory: (1971 Dissertation directed by A.N. Kolmogorov)Leonid A. Levin. APAL, 162(3):224-235, 2010. [doi]

2008

Complex tilingsBruno Durand, Leonid A. Levin, Alexander Shen. JSYML, 73(2):593-613, 2008. [doi]

Simple self-organizing networksGene Itkis, Leonid A. Levin. icsp 2008: 167-168

The Grace of Quadratic Norms: Some ExamplesLeonid A. Levin. birthday 2008: 457-459 [doi]

2006

Flat Holonomies on Automata NetworksGene Itkis, Leonid A. Levin. STACS 2006: 23-49 [doi]

2005

Byzantine Agreement Given Partial BroadcastJeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A. Levin, Ueli M. Maurer, David Metcalf. joc, 18(3):191-217, 2005. [doi]

Aperiodic Tilings: Breaking Translational SymmetryLeonid A. Levin. cj, 48(6):642-645, 2005. [doi]

2003

The Tale of One-Way FunctionsLeonid A. Levin. poit, 39(1):92-103, 2003. [doi]

2002

Forbidden InformationLeonid A. Levin. focs 2002: 761 [doi]

2001

Complex tilingsBruno Durand, Leonid A. Levin, Alexander Shen. stoc 2001: 732-739 [doi]

2000

Self-stabilization of circular arrays of automataLeonid A. Levin. TCS, 235(1):143-144, 2000. [doi]

1999

A Pseudorandom Generator from any One-way FunctionJohan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby. SICOMP, 28(4):1364-1396, 1999.

Robust Measures of InformationLeonid A. Levin. cj, 42(4):284-286, 1999.

1996

Computational Complexity of FunctionsLeonid A. Levin. TCS, 157(2):267-271, 1996. [doi]

Fundamentals of computing (a cheatlist)Leonid A. Levin. sigact, 27(3):89, 1996. [doi]

1995

On Constructing 1-1 One-Way FunctionsOded Goldreich, Leonid A. Levin, Noam Nisan. eccc, 2(29), 1995. [doi]

STOC CriteriaLeonid A. Levin. sigact, 26(2):77, 1995. [doi]

1994

Fast and Lean Self-Stabilizing Asynchronous ProtocolsGene Itkis, Leonid A. Levin. focs 1994: 226-239

1991

Checking Computations in Polylogarithmic TimeLászló Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy. stoc 1991: 21-31

Theory of computation: how to startLeonid A. Levin. sigact, 22(1):47-56, 1991. [doi]

1990

Security Preserving Amplification of HardnessOded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman. focs 1990: 318-326

Fair Computation of General Functions in Presence of Immoral MajorityShafi Goldwasser, Leonid A. Levin. crypto 1991: 77-93 [doi]

No Better Ways to Generate Hard NP Instances than Picking Uniformly at RandomRussell Impagliazzo, Leonid A. Levin. focs 1990: 812-821

1989

A Hard-Core Predicate for all One-Way FunctionsOded Goldreich, Leonid A. Levin. stoc 1989: 25-32

Pseudo-random Generation from one-way functions (Extended Abstracts)Russell Impagliazzo, Leonid A. Levin, Michael Luby. stoc 1989: 12-24

Power of Fast VLSI Models Is Insensitive to Wires ThinnessGene Itkis, Leonid A. Levin. focs 1989: 402-407

1988

Homogeneous Measures and Polynomial Time InvariantsLeonid A. Levin. focs 1988: 36-41

Random Instances of a Graph Coloring Problem Are HardRamarathnam Venkatesan, Leonid A. Levin. stoc 1988: 217-222

1987

One-way functions and pseudorandom generatorsLeonid A. Levin. combinatorica, 7(4):357-363, 1987.

1986

Average Case Complete ProblemsLeonid A. Levin. SICOMP, 15(1):285-286, 1986.

1985

One-Way Functions and Pseudorandom GeneratorsLeonid A. Levin. stoc 1985: 363-365

1984

Problems, Complete in Average InstanceLeonid A. Levin. stoc 1984: 465

Randomness Conservation Inequalities; Information and Independence in Mathematical TheoriesLeonid A. Levin. iandc, 61(1):15-37, April 1984.

1982

An Old Linear Programming Algorithm Runs in Polynomial TimeBoris Yamnitsky, Leonid A. Levin. focs 1982: 327-328

1977

Invariant Properties of Informational BulksLeonid A. Levin, V. V. V jugin. mfcs 1977: 359-364

Sign in or sign up to see more results.

runs on WebDSL