The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Leslie G. Valiant: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leslie G. Valiant
    A Theory of the Learnable. [Citation Graph (6, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:11, pp:1134-1142 [Journal]
  2. Leslie G. Valiant
    The Complexity of Enumeration and Reliability Problems. [Citation Graph (5, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:410-421 [Journal]
  3. Leslie G. Valiant
    Parallelism in Comparison Problems. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:3, pp:348-355 [Journal]
  4. Leslie G. Valiant
    Learning Disjunction of Conjunctions. [Citation Graph (2, 0)][DBLP]
    IJCAI, 1985, pp:560-566 [Conf]
  5. Sven Skyum, Leslie G. Valiant
    A Complexity Theory Based on Boolean Algebra [Citation Graph (2, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:484-502 [Journal]
  6. Leslie G. Valiant, Mike Paterson
    Deterministic One-Counter Automata. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:10, n:3, pp:340-350 [Journal]
  7. Leslie G. Valiant
    Completeness Classes in Algebra [Citation Graph (1, 0)][DBLP]
    STOC, 1979, pp:249-261 [Conf]
  8. Leslie G. Valiant
    Exponential Lower Bounds for Restricted Monotone Circuits [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:110-117 [Conf]
  9. Dana Angluin, Leslie G. Valiant
    Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:2, pp:155-193 [Journal]
  10. Leslie G. Valiant
    General Context-Free Recognition in Less than Cubic Time. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:10, n:2, pp:308-315 [Journal]
  11. Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff
    Fast Parallel Computation of Polynomials Using Few Processors. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:641-644 [Journal]
  12. Leslie G. Valiant
    Universality Considerations in VLSI Circuits. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:2, pp:135-140 [Journal]
  13. Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
    Random Generation of Combinatorial Structures from a Uniform Distribution. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:169-188 [Journal]
  14. Leslie G. Valiant
    The Complexity of Computing the Permanent. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:189-201 [Journal]
  15. Leslie G. Valiant
    Negation can be Exponentially Powerful. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:303-314 [Journal]
  16. Leslie G. Valiant
    Knowledge Infusion. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  17. Leslie G. Valiant
    Functionality in Neural Nets. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:629-634 [Conf]
  18. Leslie G. Valiant
    Managing Complexity in Neurodial Circuits. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:1-11 [Conf]
  19. Leslie G. Valiant, Mike Paterson
    Deterministic one-counter automata. [Citation Graph (0, 0)][DBLP]
    Automatentheorie und Formale Sprachen, 1973, pp:104-115 [Conf]
  20. Leslie G. Valiant
    Completeness for Parity Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:1-8 [Conf]
  21. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
    A General Lower Bound on the Number of Examples Needed for Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1988, pp:139-154 [Conf]
  22. Leslie G. Valiant
    Functionality in Neural Nets. [Citation Graph (0, 0)][DBLP]
    COLT, 1988, pp:28-39 [Conf]
  23. Leslie G. Valiant
    Rationality. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:3-14 [Conf]
  24. Leslie G. Valiant
    Projection Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:287-293 [Conf]
  25. John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
    On Time versus Space and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:57-64 [Conf]
  26. Sven Skyum, Leslie G. Valiant
    A Complexity Theory Based on Boolean Algebra [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:244-253 [Conf]
  27. Leslie G. Valiant
    Holographic Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:306-315 [Conf]
  28. Leslie G. Valiant
    Cognitive Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:2-3 [Conf]
  29. Leslie G. Valiant
    Accidental Algorthims. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:509-517 [Conf]
  30. Leslie G. Valiant
    The Complexity of Combinatorial Computations: An Introduction. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1978, pp:326-337 [Conf]
  31. Thomas Cheatham, Amr F. Fahmy, Dan C. Stefanescu, Leslie G. Valiant
    Bulk synchronous parallel computing-a paradigm for transportable software. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:268-275 [Conf]
  32. Leslie G. Valiant
    Holographic Circuits. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1-15 [Conf]
  33. Leslie G. Valiant
    The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:31-37 [Conf]
  34. Leslie G. Valiant
    Recent Developments in the Theory of Learning (Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:563- [Conf]
  35. Leslie G. Valiant
    A Neuroidal Architecture for Cognitive Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:642-669 [Conf]
  36. Leslie G. Valiant
    Pragmatic Aspects of Complexity Theory (Panel). [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:7-8 [Conf]
  37. Leslie G. Valiant
    A Computational Model for Cognition (Abstract). [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:234- [Conf]
  38. Roni Khardon, Dan Roth, Leslie G. Valiant
    Relational Learning for NLP using Linear Threshold Elements. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:911-919 [Conf]
  39. Leslie G. Valiant
    Why BSP Computers? [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:2-5 [Conf]
  40. Leslie G. Valiant
    Graph-Theoretic Arguments in Low-Level Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:162-176 [Conf]
  41. Leslie G. Valiant, Sven Skyum
    Fast Parallel Computation of Polynomials Using Few Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:132-139 [Conf]
  42. Leslie G. Valiant
    A Combining Mechanism for Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:1-10 [Conf]
  43. Michael J. Kearns, Leslie G. Valiant
    Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. [Citation Graph (0, 0)][DBLP]
    Machine Learning: From Theory to Applications, 1993, pp:29-49 [Conf]
  44. Dana Angluin, Leslie G. Valiant
    Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:30-41 [Conf]
  45. Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant
    On the Learnability of Boolean Formulae [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:285-295 [Conf]
  46. Michael J. Kearns, Leslie G. Valiant
    Cryptographic Limitations on Learning Boolean Formulae and Finite Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:433-444 [Conf]
  47. John H. Reif, Leslie G. Valiant
    A Logarithmic Time Sort for Linear Size Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:10-16 [Conf]
  48. Leslie G. Valiant
    Quantum computers that can be simulated classically in polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:114-123 [Conf]
  49. Leslie G. Valiant
    The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:27-32 [Conf]
  50. Leslie G. Valiant
    On Non-linear Lower Bounds in Computational Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:45-53 [Conf]
  51. Leslie G. Valiant
    Universal Circuits (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:196-203 [Conf]
  52. Leslie G. Valiant
    Negation Can Be Exponentially Powerful [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:189-196 [Conf]
  53. Leslie G. Valiant
    A Theory of the Learnable [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:436-445 [Conf]
  54. Leslie G. Valiant
    Robust Logics. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:642-651 [Conf]
  55. Leslie G. Valiant, Gordon J. Brebner
    Universal Schemes for Parallel Communication [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:263-277 [Conf]
  56. Leslie G. Valiant, Vijay V. Vazirani
    NP Is as Easy as Detecting Unique Solutions [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:458-463 [Conf]
  57. Alexandros V. Gerbessiotis, Leslie G. Valiant
    Direct Bulk-Synchronous Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:1-18 [Conf]
  58. Leslie G. Valiant
    Negative Results on Counting. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:38-46 [Conf]
  59. Leslie G. Valiant
    Robust logics. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:117, n:2, pp:231-253 [Journal]
  60. Leslie G. Valiant
    A Quantitative Theory of Neural Computation. [Citation Graph (0, 0)][DBLP]
    Biological Cybernetics, 2006, v:95, n:3, pp:205-211 [Journal]
  61. Leslie G. Valiant
    A Bridging Model for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1990, v:33, n:8, pp:103-111 [Journal]
  62. Leslie G. Valiant
    Memorization and Association on a Realistic Neural Model [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:004, pp:- [Journal]
  63. Leslie G. Valiant
    Holographic Algorithms [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:099, pp:- [Journal]
  64. Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant
    A General Lower Bound on the Number of Examples Needed for Learning [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:3, pp:247-261 [Journal]
  65. Leslie G. Valiant
    The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1974, v:25, n:2, pp:123-133 [Journal]
  66. Leslie G. Valiant
    A Note on the Succinctness of Descriptions of Deterministic Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1976, v:32, n:2, pp:139-145 [Journal]
  67. Leslie G. Valiant
    Relative Complexity of Checking and Evaluating. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:1, pp:20-23 [Journal]
  68. Leslie G. Valiant
    Computing Multivariate Polynomials in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:1, pp:44-45 [Journal]
  69. Leslie G. Valiant
    Addendum: Computing Multivariate Polynomials in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:54- [Journal]
  70. John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
    On Time Versus Space. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:2, pp:332-337 [Journal]
  71. Michael J. Kearns, Ming Li, Leslie G. Valiant
    Learning Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:6, pp:1298-1328 [Journal]
  72. Michael J. Kearns, Leslie G. Valiant
    Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:1, pp:67-95 [Journal]
  73. Nicholas Pippenger, Leslie G. Valiant
    Shifting Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:423-432 [Journal]
  74. Leonard Pitt, Leslie G. Valiant
    Computational limitations on learning from examples. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:965-984 [Journal]
  75. John H. Reif, Leslie G. Valiant
    A logarithmic time sort for linear size networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:60-76 [Journal]
  76. Leslie G. Valiant
    A neuroidal architecture for cognitive computation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:5, pp:854-882 [Journal]
  77. Leslie G. Valiant
    Three problems in computer science. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:96-99 [Journal]
  78. Leslie G. Valiant
    Regularity and Related Problems for Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:1, pp:1-10 [Journal]
  79. Leslie G. Valiant
    Short Monotone Formulae for the Majority Function. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:363-366 [Journal]
  80. Leslie G. Valiant
    Graph-Theoretic Properties in computational Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:13, n:3, pp:278-285 [Journal]
  81. Alexandros V. Gerbessiotis, Leslie G. Valiant
    Direct Bulk-Synchronous Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:2, pp:251-267 [Journal]
  82. Leslie G. Valiant
    Projection Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1999, v:37, n:2, pp:115-130 [Journal]
  83. Leslie G. Valiant
    Memorization and Association on a Realistic Neural Model. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 2005, v:17, n:3, pp:527-555 [Journal]
  84. Leslie G. Valiant
    Quantum Circuits That Can Be Simulated Classically in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1229-1254 [Journal]
  85. Leslie G. Valiant
    A Scheme for Fast Parallel Communication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:350-361 [Journal]
  86. Leslie G. Valiant
    Negation is Powerless for Boolean Slice Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:531-535 [Journal]
  87. Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant
    A Fast Parallel Algorithm for Routing in Permutation Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:2, pp:93-100 [Journal]
  88. Leslie G. Valiant
    Optimality of a Two-Phase Strategy for Routing in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:9, pp:861-863 [Journal]
  89. G. Lev, Leslie G. Valiant
    Size Bounds for Superconcentrators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:233-251 [Journal]
  90. Mike Paterson, Leslie G. Valiant
    Circuit Size is Nonlinear in Depth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:3, pp:397-400 [Journal]
  91. Leslie G. Valiant
    Expressiveness of matchgates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:457-471 [Journal]
  92. Leslie G. Valiant, Vijay V. Vazirani
    NP is as Easy as Detecting Unique Solutions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:85-93 [Journal]
  93. Leslie G. Valiant
    Evolvability. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:22-43 [Conf]

  94. The Learning Power of Evolution. [Citation Graph (, )][DBLP]


  95. A Bridging Model for Multi-core Computing. [Citation Graph (, )][DBLP]


  96. Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. [Citation Graph (, )][DBLP]


  97. A First Experimental Demonstration of Massive Knowledge Infusion. [Citation Graph (, )][DBLP]


  98. Some Observations on Holographic Algorithms. [Citation Graph (, )][DBLP]


  99. Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. [Citation Graph (, )][DBLP]


  100. Evolution with Drifting Targets [Citation Graph (, )][DBLP]


  101. Evolvability. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002