- 18.6.92 Expected height of random search trees
- 28.5.93 Smallest rectangle enclosing a curve of length pi (worm in the box)
- 15.6.93 Random independent sets
- 21.1.94 Gram's Equation -- A probabilistic proof
- 16.5.95 Two exercises on convex hulls
- 28.6.95 Expected rank of matrices

- Not so small: Oct 2002 Basic Examples of Probabilistic Analysis (Reading Assignment)
- Not so small either: Feb 2005 Boolean Satisfiability -- Combinatorics and Algorithms (Lecture Notes)/ see here for some updates
- Talk "On the Number of Crossing-Free Configurations on Planar Point Sets", presented at the "Algorithmic and Combinatorial Geometry" Conference at the Alfréd Rényi Institute of Mathematics, Budapest, June 16, 2009 (I am sorry, it's a big file: 15MB).