Contact Info:
Email: valiant (at) deas.harvard.edu
Tel: 617-495-5817
Fax: 617-495-9837
Office: 351, Maxwell Dworkin,
33, Oxford Street,
Cambridge, MA 02138.
Office Hours: Feb 5: 12-1pm, Feb 6: 3-4.30. Subsequent weeks: Thurs 1.30-2.30pm.
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. Memorization and association on a realistic neural model, 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 quantitative theory of neural computation, Biological Cybernetics, 95:3 (2006) 205-211.
82. Knowledge infusion, Proc. 21st National Conference on Artificial Intelligence, AAAI06, Jul 16-20, Boston, MA, AAAI Press, (2006), 1546-1551.
83. Accidental algorithms, Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, Oct 22 -24, Berkeley, CA, IEEE Press, (2006), 509-517.
84. Holographic algorithms, SIAM J. on Computing, 37:5, (2008) 1565-1594. (Earlier version: Electronic Colloquium on Computational Complexity, Report TR05-099, (2005).)
85. Evolvability, JACM, to appear. (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.)