CINXE.COM

<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"> <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> <head> <meta http-equiv=Content-Type content="text/html; charset=us-ascii"> <meta name=ProgId content=Word.Document> <meta name=Generator content="Microsoft Word 15"> <meta name=Originator content="Microsoft Word 15"> <link rel=File-List href="index_files/filelist.xml"> <link rel=Edit-Time-Data href="index_files/editdata.mso">  <link rel=themeData href="index_files/themedata.thmx"> <link rel=colorSchemeMapping href="index_files/colorschememapping.xml">  <style>  </style>  </head> <body lang=EN-US link=blue vlink=purple style='tab-interval:.5in'> <div class=WordSection1> Leslie Valiant T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics, School of Engineering and Applied Sciences, Harvard University.<o:p></o:p> <img width=192 height=256 id="_x0000_i1025" src=1.jpg> Contact Info: Email: valiant seas harvard edu              <a href="lv-articles05.html">Earlier Publications</a> Recent Publications: 71. Circuits of the Mind, Oxford University Press, (1994, 2000). 72. Robust logics, Artificial Intelligence Journal, 117 (2000) 231-253. 73. A neuroidal architecture for cognitive computation, J. Assoc. Computing Machinery, 47:5 (2000) 854-882. 74. Quantum circuits that can be simulated classically in polynomial time, SIAM J. on Computing, 31:4 (2002) 1229-1254. 75. Expressiveness of matchgates, Theoretical Computer Science, 289:1 (2002) 457-471 (and 299 (2003) 795.) 76. Three problems in computer science, J. Assoc. Computing Machinery, 50:1 (2003) 96-99. 77. Holographic algorithms (extended abstract), Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, Oct 17-19, Rome, Italy, (2004). IEEE Press, 306-315. 78.<a href="memassoc-eccc.pdf"> Memorization and association on a realistic neural model, </a>Neural Computation, 17:3 (2005) 527-555. 79. Holographic circuits, Proc. 32nd International Colloquium on Automata, Languages and Programming, July 11-15, Lisbon, Portugal, LNCS, Vol. 3580, (2005), Springer-Verlag, 1-15. 80. Completeness for parity problems, Proc. 11th International Computing and Combinatorics Conference, Aug 16-19, Kunming, China, LNCS, Vol. 3959, (2005), Springer-Verlag, 1-9. 81. <a href="QTNC06.pdf">A quantitative theory of neural computation</a>, Biological Cybernetics, 95:3 (2006) 205-211. 82. <a href="AAAI06.pdf">Knowledge infusion,</a> Proc. 21st National Conference on Artificial Intelligence, AAAI06, Jul 16-20, Boston, MA, AAAI Press, (2006), 1546-1551. 83.<a href="focs06.pdf"> Accidental algorithms,</a> Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, Oct 22 -24, Berkeley, CA, IEEE Press, (2006), 509-517. 84. <a href="holographic11-07.pdf">Holographic algorithms</a>, SIAM J. on Computing, 37:5 (2008) 1565-1594. (Earlier version: Electronic Colloquium on Computational Complexity, Report TR05-099, (2005).) 85. <a href="KR08MichaelValiant.pdf">A first experimental demonstration of massive knowledge infusion</a>, (with Loizos Michael), Proc. 11th International Conference on Principles of Knowledge Representation and Reasoning, Sept. 16-20, 2008, Sydney, Australia, 378-389. 86. <a href="fsttcs08.pdf">Knowledge infusion: In pursuit of robustness in artificial intelligence</a>, Proc 28th Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 9-11, 2008, Bangalore, India, Indian Association for Research in Computing Science, 415-422. 87.<a href="evolvability-2008.pdf"> Evolvability,</a> J. Assoc. Computing Machinery, 56:1 (2009) 3:1 - 3:21. (Earlier version: Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, Aug. 26-31, Český Krumlov, Czech Republic, LNCS, Vol 4708, (2007) Springer-Verlag, 22-43.) 88. <a href="FV_Neuro_09.pdf">Experience-induced neural circuits that achieve high capacity</a>, (with Vitaly Feldman), Neural Computation, 21:10 (2009) 2715-2754. 89. <a href="COLT2010.pdf">Evolution with drifting targets</a>, (with Varun Kanade and Jennifer Wortman Vaughan), Proc. 23rd Annual Conference on Learning Theory, COLT 2010, (2010), 155-167. 90. <a href="bridging-2010.pdf">A bridging model for multi-core computing,</a> Journal of Computer and System Sciences, 77:1 (2011) 154-166 . 91. <a href="Hippocampus.pdf">The hippocampus as a stable memory allocator for cortex</a> Neural Computation, 24:11 (2012) 2873-2899. 92. <a href="ICALP%202011.pdf">The complexity of symmetric Boolean parity holant problems</a>, (with Heng Guo and Pinyan Lu), SIAM J. on Computing, 42:1 (2013) 324-356 . 93. <a href="PAC-%20Summary.pdf">Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World</a>, Basic Books, (2013). 94. <a href="Current%20Opinion%20Neurobiology%202014.pdf">What must a global theory of cortex explain?</a> Current Opinion in Neurobiology, 25C (2014) 15-19. 95.<a href="FOCS%202017.pdf"> Capacity of neural networks for lifelong learning of composable tasks</a>, Proc. 58th Annual IEEE Symposium on Foundations of Computer Science, October 15 - 17, 2017, Berkeley, California , 367-378 (2017). 96.<a href="observations-8-1-17.pdf"> Some observations on holographic algorithms</a>, Computational Complexity, 27:3 (2018) 351-374. <h1>97. <a href="http://journal.frontiersin.org/article/10.3389/fncir.2018.00104/full?&utm_source=Email_to_authors_&utm_medium=Email&utm_content=T1_11.5e1_author&utm_campaign=Email_publication&field=&journalName=Frontiers_in_Neural_Circuits&id=415698">Towards identifying the systems-level primitives of cortex by in-circuit testing,</a> Front. Neural Circuits, 20 November (2018):104.<o:p></o:p></h1> <h1><o:p> </o:p></h1> <o:p> </o:p> <a href="researchinterests.htm">Current Research Interests</a> <a href="bio.htm">Bio</a> <a href="cv-11-21-18.pdf">cv</a><o:p></o:p>   </div> </body> </html>