Curriculum Vitae:

• Postscript
• PDF

Theoretical computer science jokes:

• If the polynomial-time hierarchy were to collapse in a forest and there were no complexity theorists around to prove it, would our programs run any faster?
• Q: how many complexity theorists does it take to change a lightbulb?
  A: one, who gives it to six Californians, thus reducing it to a known joke.
• Q: Why did Alan Turing cross the road?
  A: To see if the Turing machines rushing along it would halt for him, of course.
• Kurt Gödel goes to his psychiatrist. Doctor: "What's wrong Kurt?" Gödel: "Everything seems so incomplete..."
• Old algorithmicists never die, they just { get dominated by another term / tend asymptotically to zero }.
• (heard from S. Muthukrishnan) Q: How many algorithmicists does it take to change a lightbulb?
  A: Big-oh of one.

Ah, there's nothing more exciting than science. You get all the fun of sitting still, being quiet, writing down numbers, paying attention. Science has it all. - Principal Skinner

Publications available online

• F. Ruskey and M. Weston, "More Fun with Symmetric Venn Diagrams", Theory of Computing Systems 39:3, 2006.
• F. Ruskey and M. Weston, "A Survey of Venn Diagrams", Electronic Journal of Combinatorics, Dynamic Survey, Article DS5, 2005 Update.
• C. Killian, C. Savage, F. Ruskey and M. Weston, "Half-Simple Symmetric Venn Diagrams", Electronic Journal of Combinatorics, Volume 11 (no. 1), #R86, (2004).
• M. Weston, "On Symmetry in Venn Diagrams and Independent Families", M.Sc. Thesis, University of Victoria (2003)
         Download (GZipped Postscript)

Research Errata

• Solutions to the wooden snake puzzle.
  
• A handy stylesheet for formatting C code in LaTeX documents. Just \usepackage{cprog} and then \cprogfile{foo.c}.
• Venn-Finder: a software tool for exploring Venn diagrams.
  • README.
  • Screenshots: a simple 3-curve Venn diagram, a non-simple 5-curve diagram with missing and repeated regions.
  • Download source (C++, requires LEDA libraries to compile).

Personal