%Plain TeX -> abstract for V4(2) R19
\magnification=1440 \hsize = 6 true in \nopagenumbers
\noindent {\bf  Joel Spencer }
\bigskip\noindent Real Time Asymptotic Packing
\vskip.5cm\noindent
A random greedy algorithm, somewhat modified, is analyzed
by using a real time context and showing that the variables remain
close to the solution of a natural differential equation.  Given
a $(k+1)$-uniform simple hypergraph on $N$ vertices, regular of
degree $D$, the algorithm gives a packing of disjoint hyperedges
containing all but $O(ND^{-1/k}\ln^cD)$ of the vertices. 
\end