% This is a list of the lecture notes for spring 2001.
%
\def\hlabel#1{%
  \global\expandafter\def\csname @lecture@#1\endcsname}
\def\hlabelref#1{\csname @lecture@#1\endcsname}
%
\hlabel{notes1}{1}              % lecture1.tex
\hlabel{notes2}{2}              % lecture2.tex
\hlabel{notes3}{3}              % lecture3.tex
\hlabel{notes4}{4}              % lecture4.tex
\hlabel{notes5}{5}              % lecture5.tex
\hlabel{notes6}{6}              % lecture5.tex
\hlabel{notes7}{7}              % lecture5.tex
\hlabel{notes8}{8}              % lecture8.tex
\hlabel{notes9}{9}              % lecture9.tex
\hlabel{notes10}{10}            % lecture9.tex
\hlabel{notes11}{11}            % lecture9.tex
\hlabel{notes12}{12}            % lecture9.tex
\hlabel{bijections}{13}     % Functions, Counting, and the Pigeonhole Principle
\hlabel{basic counting}{14} % Basic Counting
\hlabel{permutations}{15}   % Permutations and Combinations
\hlabel{repetitions}{16}    % More on Permutations and Combinations
\hlabel{infinite sets}{17}  % Infinite Sets
\hlabel{basic probability}{18}       % Introduction to Probability
\hlabel{conditional probability}{19} % Conditional Probability
\hlabel{independence}{20}            % Independence
\hlabel{random variables}{21}        % Random Variables
\hlabel{expectation}{22}             % Expectation
\hlabel{walds theorem}{23}           % Computing Expectation
\hlabel{tail bounds}{24}             % Tail Bounds
\hlabel{more tail bounds}{25}        % Tail Bounds (cont'd)
\hlabel{random walks}{26}            % Random Walks
