The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leonid A. Levin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leonid A. Levin
    Average Case Complete Problems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:285-286 [Journal]
  2. Shafi Goldwasser, Leonid A. Levin
    Fair Computation of General Functions in Presence of Immoral Majority. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:77-93 [Conf]
  3. Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman
    Security Preserving Amplification of Hardness [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:318-326 [Conf]
  4. Russell Impagliazzo, Leonid A. Levin
    No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:812-821 [Conf]
  5. Gene Itkis, Leonid A. Levin
    Power of Fast VLSI Models Is Insensitive to Wires' Thinness [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:402-407 [Conf]
  6. Gene Itkis, Leonid A. Levin
    Fast and Lean Self-Stabilizing Asynchronous Protocols [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:226-239 [Conf]
  7. Leonid A. Levin
    Forbidden Information. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:761-0 [Conf]
  8. Leonid A. Levin
    Homogeneous Measures and Polynomial Time Invariants [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:36-41 [Conf]
  9. Boris Yamnitsky, Leonid A. Levin
    An Old Linear Programming Algorithm Runs in Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:327-328 [Conf]
  10. Leonid A. Levin, V. V. V'jugin
    Invariant Properties of Informational Bulks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:359-364 [Conf]
  11. Gene Itkis, Leonid A. Levin
    Flat Holonomies on Automata Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:23-49 [Conf]
  12. László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
    Checking Computations in Polylogarithmic Time [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:21-31 [Conf]
  13. Bruno Durand, Leonid A. Levin, Alexander Shen
    Complex tilings. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:732-739 [Conf]
  14. Oded Goldreich, Leonid A. Levin
    A Hard-Core Predicate for all One-Way Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:25-32 [Conf]
  15. Russell Impagliazzo, Leonid A. Levin, Michael Luby
    Pseudo-random Generation from one-way functions (Extended Abstracts) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:12-24 [Conf]
  16. Leonid A. Levin
    Problems, Complete in ``Average'' Instance [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:465- [Conf]
  17. Leonid A. Levin
    One-Way Functions and Pseudorandom Generators [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:363-365 [Conf]
  18. Ramarathnam Venkatesan, Leonid A. Levin
    Random Instances of a Graph Coloring Problem Are Hard [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:217-222 [Conf]
  19. Leonid A. Levin
    Aperiodic Tilings: Breaking Translational Symmetry. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:6, pp:642-645 [Journal]
  20. Leonid A. Levin
    Robust Measures of Information. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:4, pp:284-286 [Journal]
  21. Leonid A. Levin
    One-way functions and pseudorandom generators. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:4, pp:357-363 [Journal]
  22. Bruno Durand, Leonid A. Levin, Alexander Shen
    Complex Tilings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  23. Leonid A. Levin, Ramarathnam Venkatesan
    An Average Case NP-complete Graph Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  24. Leonid A. Levin
    Forbidden Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  25. Leonid A. Levin
    The Equity Tax and Shelter [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  26. Leonid A. Levin
    The Tale of One-way Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  27. Jeffrey Considine, Leonid A. Levin, David Metcalf
    Byzantine Agreement with Faulty Majority using Bounded Broadcast [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  28. Leonid A. Levin
    Aperiodic Tilings: Breaking Translational Symmetry [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  29. Oded Goldreich, Leonid A. Levin, Noam Nisan
    On Constructing 1-1 One-Way Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:29, pp:- [Journal]
  30. Leonid A. Levin
    Randomness Conservation Inequalities; Information and Independence in Mathematical Theories [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:61, n:1, pp:15-37 [Journal]
  31. Jeffrey Considine, Matthias Fitzi, Matthew K. Franklin, Leonid A. Levin, Ueli M. Maurer, David Metcalf
    Byzantine Agreement Given Partial Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:3, pp:191-217 [Journal]
  32. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
    A Pseudorandom Generator from any One-way Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1364-1396 [Journal]
  33. Leonid A. Levin
    Self-stabilization of circular arrays of automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:235, n:1, pp:143-144 [Journal]
  34. Leonid A. Levin
    Computational Complexity of Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:267-271 [Journal]
  35. Leonid A. Levin
    Self-stabilization of Circular Arrays of Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  36. Leonid A. Levin
    Notes for Miscellaneous Lectures [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  37. The Grace of Quadratic Norms: Some Examples. [Citation Graph (, )][DBLP]


  38. Arcane Information, Solving Relations, and Church Censorship. [Citation Graph (, )][DBLP]


  39. Flat Holonomies on Automata Networks [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002