Welcome to the Stanford Theory Colloquium! The colloquium hosts
occassional talks of interest to the general Computer Science
community. Talks are usually held in one of two buildings on Stanford's campus. We have directions to both the Gates Building and to Jordan Hall.
| |

You may also be interested in the Stanford Algorithms Seminar, which meets weekly and hosts smaller talks geared towards the Computer Science Algorithms community.

If you would like to subscribe or unsubscribe to the Stanford Theory Seminar mailing list, fill in your name and e-mail address below.

- 16 April 1997:
**Bernard Chazelle**(Princeton) . Discrepancy Theory and Computational Geometry. - 31 May 1996:
**Sanjeev Arora**(Princeton). Polynomial-time Approximation Schemes for Euclidean TSP and other Geometric Problems. - 30 May 1996:
**Laszlo Lovasz**(Yale University). The delight of walking randomly. - 11 April 1996:
**Christos Papadimitriou**(UC Berkeley). Computational Approaches to Organization Theory. - 25 January 1996:
**Andrew Yao**(Princeton). An Overview of Quantum Cryptography. - 1 December 1995:
**Frank Harary**(New Mexico State University). Recent results on hypercube theory. - 9 November 1995:
**Prabhakar Raghavan**(IBM Almaden). Queueing theory without independence assumptions. - 23 May 1995:
**N.G. de Bruijn**(Eindhoven University). Reflections on type-theoretical computer-aided checking of mathematics. - 5 April 1995:
**Robin Milner**(Cambridge University). Some applications of the pi calculus. - 4 November 1992:
**Christos Papadimitriou**(UC San Diego). Complexity as a Metaphor. - 19 May 1994:
**Moshe Y. Vardi**(IBM Almaden and Rice University). Infinitary logics in computer science. - 4 May 1994:
**Leonard Adleman**(University of Southern California). Finite model theory: A personal perspective. - 21 April 1994:
**Umesh Vazirani**. "Go with the winners" algorithms. - 10 February 1994:
**Sanjeev Arora**(UC Berkeley). Probabilistic checking of proofs and hardness of approximation problems. - 18 November 1993:
**Tom Leighton**(MIT). Multicommodity flows: A survey of recent research. - 1 November 1993:
**David S. Johnson**(AT&T Bell Laboratories) . Finite model theory: A personal perspective. - 11 March 1993:
**Ashok K. Chandra**(IBM Almaden) . Towards More Realistic Models of Parallel Computers. - 9 February 1993:
**David Harel**(Weizmann Institute). Towards a theory of infinite computable structures and databases. - 9 February 1993:
**Samson Abramsky**(Imperial College). Games, types, and interactions. - 12 November 1992:
**Donald Knuth**(Stanford). Textbook example of recursion. - 21 May 1992:
**Joel Spencer**(NYU). Flip a coin! From Erdos to algorithms. - 27 April 1992:
**Christos Papadimitriou**(UC San Diego). Inefficient existence proofs and complexity. - 2 April 1992:
**Ronald Fagin**(IBM Almaden). Finite model theory: A personal perspective. - 5 March 1992:
**Richard M. Karp**(UC Berkeley and ICSI). Physical mapping of chromosomes: A combinatorial problem in molecular biology.