\documentstyle[11pt]{article}
\input{headerhack}
\setlength{\textwidth}{6in}
\setlength{\textheight}{8in}
\setlength{\evensidemargin}{0.25in}
\setlength{\oddsidemargin}{0.25in}
\setlength{\footskip}{.5in}
\setlength{\topmargin}{0.0in}
\renewcommand{\baselinestretch}{1.0}
\setlength{\parskip}{2\parskip plus 2pt minus 1pt}

\begin{document}

\doheading{2}{title}{September, 1993}
\htitle{Some Suggested Paper Topics}

\begin{enumerate}

\item Related to Weighing and Sorting
   \begin{itemize}
     \item the coin-weighing problem
     \item Mastermind
     \item hashing and bucket sort
     \item sorting networks
     \item some parallel sorting problems
     \item computer comparison of sorting routines
%    \item deficiency model, finding optimal (WHAT DOES THIS MEAN?)
     \item search methods
     \item finding the median of a sequence
    \end{itemize}

\item Related to Efficient Coding, Probability
    \begin{itemize}
     \item probabilistic analysis of a game (e.g., bridge)
     \item binomial, Poisson, and other distributions
     \item proof of the Hu-Tucker algorithm's correctness
     \item Markov chains
     \item random walk
     \item queueing theory
     \item Subjective notions of probability; common fallacies
    \end{itemize}

\item Coding for Error Correction
     \begin{itemize}
      \item implementation of encoding and decoding (Golay, Reed-Muller, 
		Reed-Solomon, BCH)
      \item convolutional codes and Viterbi decoding
      \item shift register sequences
     \end{itemize}

\item Coding for Secrecy
     \begin{itemize}
      \item the Merkle-Hellman scheme (and Shamir's attack on it)
      \item Byzantine agreement problems
      \item implementations of an RSA cryptosystem
      \item sharing secrets
      \item primality testing
      \item generating large primes
      \item factoring large numbers
    \end{itemize}

\item Related to Generating Functions, etc.
    \begin{itemize}
      \item Fourier series and transforms
      \item Lagrange inversion
      \item finite difference calculus
      \item linear recursion equations with constant coefficients
     \end{itemize}

\item Related to Linear Programming
     \begin{itemize}
      \item simplex method
      \item Dantzig-Wolfe decomposition
      \item the ellipsoidal method
      \item Karmarkar's algorithm
      \item linear programming sensitivity analysis
      \item game theory
      \item network flow and transportation problems
     \end{itemize}

\item Games
    \begin{itemize}
     \item games of timing (duels)
     \item the guess-decrement game
     \item the towers of Hanoi
     \item the game of Life
     \item Othello
     \item Fox and Geese
     \item the disjunctive sum of games
     \item multi-player games
     \item simulation of competition versus cooperation
     \item decision theory
    \end{itemize}

\item Algorithms
    \begin{itemize}
     \item the travelling salesman problem
     \item computing convex hulls
     \item graph coloring
     \item graph partitioning
     \item matching theory
     \item connectivity of graphs; Dijkstra's algorithm
     \item packing algorithms
     \item dynamic programming
     \item relaxation methods
     \item simulated annealing
     \item Strassen's algorithm
     \item fast Fourier transform
    \end{itemize}

\item Combinatorics
    \begin{itemize}
     \item Bell and Stirling numbers
     \item Catalan numbers
    \end{itemize}

\item Applications
    \begin{itemize}
     \item data compression (voice, image; Huffman, Ziv-Lempel)
     \item forest management
     \item genetics
     \item computational molecular biology
     \item perceptrons and neural nets
     \item signal processing
     \item computer vision
     \item traffic flow
     \item juggling
     \end{itemize}

\item Other
    \begin{itemize}
     \item the computational complexity hierarchy (NP-completeness)
     \item pseudo-random number generation
     \item testing for randomness
     \item cellular automata
     \item fractals
     \end{itemize}

\end{enumerate}

A few guidelines:
\begin{itemize}
\item Use several sources (except where this is impossible)
\item Don't copy authors' examples (devise your own)
\item Pay attention to writing style, with attention to
	grammar, punctuation, and word-choice.
\end{itemize}

\end{document}

\documentstyle[11pt]{article}
\input{headerhack}
\setlength{\textwidth}{6in}
\setlength{\textheight}{8in}
\setlength{\evensidemargin}{0.25in}
\setlength{\oddsidemargin}{0.25in}
\setlength{\footskip}{.5in}
\setlength{\topmargin}{0.0in}
\renewcommand{\baselinestretch}{1.0}
\setlength{\parskip}{2\parskip plus 2pt minus 1pt}

\begin{document}

\doheading{2}{title}{September, 1993}
\htitle{Some Suggested Paper Topics}

\begin{enumerate}

\item Related to Weighing and Sorting
   \begin{itemize}
     \item the coin-weighing problem
     \item Mastermind
     \item hashing and bucket sort
     \item sorting networks
     \item some parallel sorting problems
     \item computer comparison of sorting routines
%    \item deficiency model, finding optimal (WHAT DOES THIS MEAN?)
     \item search methods
     \item finding the median of a sequence
    \end{itemize}

\item Related to Efficient Coding, Probability
    \begin{itemize}
     \item probabilistic analysis of a game (e.g., bridge)
     \item binomial, Poisson, and other distributions
     \item proof of the Hu-Tucker algorithm's correctness
     \item Markov chains
     \item random walk
     \item queueing theory
     \item Subjective notions of probability; common fallacies
    \end{itemize}

\item Coding for Error Correction
     \begin{itemize}
      \item implementation of encoding and decoding (Golay, Reed-Muller, 
		Reed-Solomon, BCH)
      \item convolutional codes and Viterbi decoding
      \item shift register sequences
     \end{itemize}

\item Coding for Secrecy
     \begin{itemize}
      \item the Merkle-Hellman scheme (and Shamir's attack on it)
      \item Byzantine agreement problems
      \item implementations of an RSA cryptosystem
      \item sharing secrets
      \item primality testing
      \item generating large primes
      \item factoring large numbers
    \end{itemize}

\item Related to Generating Functions, etc.
    \begin{itemize}
      \item Fourier series and transforms
      \item Lagrange inversion
      \item finite difference calculus
      \item linear recursion equations with constant coefficients
     \end{itemize}

\item Related to Linear Programming
     \begin{itemize}
      \item simplex method
      \item Dantzig-Wolfe decomposition
      \item the ellipsoidal method
      \item Karmarkar's algorithm
      \item linear programming sensitivity analysis
      \item game theory
      \item network flow and transportation problems
     \end{itemize}

\item Games
    \begin{itemize}
     \item games of timing (duels)
     \item the guess-decrement game
     \item the towers of Hanoi
     \item the game of Life
     \item Othello
     \item Fox and Geese
     \item the disjunctive sum of games
     \item multi-player games
     \item simulation of competition versus cooperation
     \item decision theory
    \end{itemize}

\item Algorithms
    \begin{itemize}
     \item the travelling salesman problem
     \item computing convex hulls
     \item graph coloring
     \item graph partitioning
     \item matching theory
     \item connectivity of graphs; Dijkstra's algorithm
     \item packing algorithms
     \item dynamic programming
     \item relaxation methods
     \item simulated annealing
     \item Strassen's algorithm
     \item fast Fourier transform
    \end{itemize}

\item Combinatorics
    \begin{itemize}
     \item Bell and Stirling numbers
     \item Catalan numbers
    \end{itemize}

\item Applications
    \begin{itemize}
     \item data compression (voice, image; Huffman, Ziv-Lempel)
     \item forest management
     \item genetics
     \item computational molecular biology
     \item perceptrons and neural nets
     \item signal processing
     \item computer vision
     \item traffic flow
     \item juggling
     \end{itemize}

\item Other
    \begin{itemize}
     \item the computational complexity hierarchy (NP-completeness)
     \item pseudo-random number generation
     \item testing for randomness
     \item cellular automata
     \item fractals
     \end{itemize}

\end{enumerate}

A few guidelines:
\begin{itemize}
\item Use several sources (except where this is impossible)
\item Don't copy authors' examples (devise your own)
\item Pay attention to writing style, with attention to
	grammar, punctuation, and word-choice.
\end{itemize}

\end{document}

