🚀 go-pugleaf

At the STRUCTURE IN COMPLEXITY THEORY conference (Boston, June 22-25) we
will be distributing STRUCTURES ABSTRACTS: a book of one-page abstracts of
articles of interest to the STRUCTURES community.  Below is Latex code for

  (1) a formal annoucement of this, and guidelines for submission, and

  (2) a sample abstract in the format.

FOR MORE INFORMATION ON THE CONFERENCE ITSELF either send mail to
structures@top.cis.syr.edu or contact the publicity chair: Jim Royer,
School of Computer & Information Science; Syracuse University; Syracuse, NY
13244, U.S.A.; Email: royer@top.cis.syr.edu.


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% LATEX FILE ONE

\documentstyle[11pt]{article}
\setlength{\textwidth}{6.5in}
\setlength{\textheight}{10.5in}
\setlength{\oddsidemargin}{0pt}
\setlength{\evensidemargin}{0pt}
\setlength{\topmargin}{-.5in}
\begin{document}
\pagestyle{empty}

\hfil{\LARGE\bf Structures Conference Research Abstracts}\hfil

\bigskip\bigskip\bigskip

This year we will be preparing a booklet of research abstracts for
distribution at the Structures Conference.  The goal is to provide a
mechanism for researchers to publicize new results in complexity theory.
All researchers are encouraged to submit
abstracts for inclusion, with the only restrictions that (1) the subject
matter of the abstracts must be in keeping with the research themes of the
conference, (2) abstracts must be short in length, (3) each researcher
can submit at most 3 abstracts, and (4) each abstract must indicate
whether or not a complete version of the paper is available.

Researchers submitting abstracts are encouraged to
do the following:

\begin{enumerate}
\item
The abstract be in 11pt type and fit on one page.

\item
If submitting electronically please use LaTeX and please
use the easy-to-use format provided by the example
in the second LaTeX file.
Email abstracts to gasarch@cs.umd.edu

\item
If you do not have access to email then you may send
hardcopy through regular mail. Mail to
William Gasarch, Structures Abstracts, Computer Sciences Dept.,
University of Maryland at College Park, College Park, MD., 20742.

\item
Abstracts must arive
(hard copy or e-mail) at the
University of Maryland by Friday June 18, 1992.
This is a strict deadline.

\end{enumerate}

\end{document}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% SECOND LATEX FILE

\documentstyle[11pt]{article}

\begin{document}

\vskip .5in
\noindent\fbox{
\begin{minipage}{6.0in}

{\bf The Complexity of Song Writing}\hfil\smallskip\break
{\it
Todd N. Nukehal,
{\rm Department of Computer Science, Tansford University,
Smalltown, CA, 12345, USA,}\hfil\break
Milli Vanilli,
{\rm Dachbereich Informatik, Universit\"{a}t Hamburg,
Rothenbaumchaussee 67/69, 2000 Hamburg 13, WEST-GERMANY.}\hfil
}
\bigskip\break

Traditionally Kolgomorov theory tells us that it takes
$O(n)$ characters to store a song of length $n$.  Only recently
has this been improved, first by ``Old McDonald had
a Farm'' which manages $O(n/\log n)$ and
``Hickory Dickory Dock'' which manages $O(n^{1/2})$
This last result was important as it showed that
$O(n^{1-\epsilon})$ could be achieved,
contrary to popular belief and pop songs of that time.
We have made great strides in this area by showing that
``$n$ bottles of beer on the wall'' can be
stored in $O(\log n)$.  We have extended these results and have some
(admittely contrived) examples of songs that take only
$O(1)$ storage.  Disco may provide more natural,
though less listenable, examples in the future.
\smallskip\break
A full paper is (is not yet) available.
\end{minipage}
}
\end{document}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%