Leonid A. Levin

Леони́д Анато́льевич Ле́вин

	2012
c21		Leonid A. Levin: Rarity for Semimeasures. FOCS 2012: 510-513
c20		Leonid A. Levin: Turing's Password: What Internet Cannot Leak. LICS 2012: 11
i15		Leonid A. Levin: Enumerable Distributions, Randomness, Dependence. CoRR abs/1208.2955 (2012)
i14		Leonid A. Levin: Randomness and Non-determinism. CoRR abs/1211.0071 (2012)
	2011
p1		Oded Goldreich, Leonid A. Levin, Noam Nisan: On Constructing 1-1 One-Way Functions. Studies in Complexity and Cryptography 2011: 13-25
i13		Samuel Epstein, Leonid A. Levin: On Sets of High Complexity Strings. CoRR abs/1107.1458 (2011)
	2010
j14		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		Leonid A. Levin: Arcane Information, Solving Relations, and Church Censorship. SSS 2010: 1
i12		Leonid A. Levin: Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory. CoRR abs/1009.5894 (2010)
	2008
j13		Bruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. J. Symb. Log. 73(2): 593-613 (2008)
c18		Leonid A. Levin: The Grace of Quadratic Norms: Some Examples. Pillars of Computer Science 2008: 457-459
	2006
c17		Gene Itkis, Leonid A. Levin: Flat Holonomies on Automata Networks. STACS 2006: 23-49
i11		Leonid A. Levin: Self-stabilization of Circular Arrays of Automata. CoRR abs/cs/0602033 (2006)
	2005
j12		Leonid A. Levin: Aperiodic Tilings: Breaking Translational Symmetry. Comput. J. 48(6): 642-645 (2005)
j11		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		Leonid A. Levin: Notes for Miscellaneous Lectures. CoRR abs/cs/0503039 (2005)
i9		Gene Itkis, Leonid A. Levin: Flat Holonomies on Automata Networks. CoRR abs/cs/0512077 (2005)
	2004
i8		Leonid A. Levin: Aperiodic Tilings: Breaking Translational Symmetry. CoRR cs.DM/0409024 (2004)
	2002
c16		Leonid A. Levin: Forbidden Information. FOCS 2002: 761-
i7		Leonid A. Levin: Forbidden Information. CoRR cs.CC/0203029 (2002)
	2001
c15		Bruno Durand, Leonid A. Levin, Alexander Shen: Complex tilings. STOC 2001: 732-739
i6		Bruno Durand, Leonid A. Levin, Alexander Shen: Complex Tilings. CoRR cs.CC/0107008 (2001)
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		Leonid A. Levin: The Equity Tax and Shelter. CoRR cs.CE/0012013 (2000)
i3		Leonid A. Levin: The Tale of One-way Functions. CoRR cs.CR/0012023 (2000)
i2		Jeffrey Considine, Leonid A. Levin, David Metcalf: Byzantine Agreement with Faulty Majority using Bounded Broadcast. CoRR cs.DC/0012024 (2000)
	1999
j9		Leonid A. Levin: Robust Measures of Information. Comput. J. 42(4): 284-286 (1999)
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		Leonid A. Levin: Errata to "Fundamentals of Computing". SIGACT News 28(2): 80 (1997)
	1996
j6		Leonid A. Levin: Fundamentals of computing (a cheatlist). SIGACT News 27(3): 89 (1996)
j5		Leonid A. Levin: Computational Complexity of Functions. Theor. Comput. Sci. 157(2): 267-271 (1996)
	1995
j4		Leonid A. Levin: STOC Criteria. SIGACT News 26(2): 77 (1995)
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
	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		Oded Goldreich, Leonid A. Levin: A Hard-Core Predicate for all One-Way Functions. STOC 1989: 25-32
	1988
c6		Leonid A. Levin: Homogeneous Measures and Polynomial Time Invariants. FOCS 1988: 36-41
c5		Ramarathnam Venkatesan, Leonid A. Levin: Random Instances of a Graph Coloring Problem Are Hard. STOC 1988: 217-222
	1987
j3		Leonid A. Levin: One-way functions and pseudorandom generators. Combinatorica 7(4): 357-363 (1987)
	1986
j2		Leonid A. Levin: Average Case Complete Problems. SIAM J. Comput. 15(1): 285-286 (1986)
	1985
c4		Leonid A. Levin: One-Way Functions and Pseudorandom Generators. STOC 1985: 363-365
	1984
j1		Leonid A. Levin: Randomness Conservation Inequalities; Information and Independence in Mathematical Theories. Information and Control 61(1): 15-37 (1984)
c3		Leonid A. Levin: Problems, Complete in ``Average'' Instance. STOC 1984: 465
	1982
c2		Boris Yamnitsky, Leonid A. Levin: An Old Linear Programming Algorithm Runs in Polynomial Time. FOCS 1982: 327-328
	1977
c1		Leonid A. Levin, V. V. V'jugin: Invariant Properties of Informational Bulks. MFCS 1977: 359-364

Coauthor Index

Colors in the list of coauthors

Last update Thu May 23 02:41:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page