\documentstyle[times,twocolumn]{article}

\textwidth=7.7in
\columnsep=.875in
\textheight=8.5in

\oddsidemargin-.75in
\evensidemargin0pt

\def\subheading#1{\begin{center} {\bf#1} \end{center}}

\def\prehead#1{\noindent {\bf #1}}

\newcommand{\note}[1]{\marginpar{\raggedright{\footnotesize #1}}\ignorespaces}

\newcommand{\percent}{\%}

\setbox0=\hbox{\bf 10:20}
\labelwidth=\wd0
\leftmargini\labelwidth
\advance\leftmargini by .5em

\makeatletter
\def\description{\ifnum \@itemdepth >3 \@toodeep\else \advance\@itemdepth \@ne
\edef\@itemitem{labelitem\romannumeral\the\@itemdepth}%
\list{\csname\@itemitem\endcsname}%
{\parsep0pt\def\makelabel##1{\bf##1\hss}}\fi\raggedright}

\let\enddescription =\endlist
\makeatother

\tabcolsep 3pt

\def\brule#1{\vrule width#1 height 0.4pt depth 0.0pt\relax}

\def\heading#1{\begin{center}\Large\bf#1\end{center}}

\pagestyle{empty}

\begin{document}
\ 
\newpage

\begin{center}
{\Huge \bf SPAA'94}
\end{center}

\heading{6th Annual ACM Symposium\\
on Parallel Algorithms\\
and Architectures\\[.1in]
Cape May, New Jersey\\
June 26 -- 29, 1994}

\vspace*{3.5in}

\heading{{\it featuring}\\[.2in]
ACM's 24th International\\
Computer Chess Championship\\[.1in]
June 25 -- 27, 1994}

\vspace*{.5in}

\begin{center}
Sponsored by\\
ACM SIGACT and ACM SIGArch\\
In Cooperation with EATCS
\end{center}


\newpage
\heading{Registration for SPAA'94}

The registration fees for SPAA'94 are listed below.  To qualify for
the early registration fee, your registration application must be
postmarked by {\bf Friday, May 20}.  Refund requests will be honored
until June 15.  The nonstudent registration fee includes the Sunday
night reception, the Monday night business meeting, the Tuesday night
banquet, coffee breaks and lunches, and a copy of the proceedings.
The student fee includes all of the above except the banquet.

Please fill out the form below and send it, along with a check or
money order made payable to ``SPAA'94,'' to:

\begin{center}
SPAA'94              \\
c/o Yuh-dauh Lyuu, Satish Rao \\
NEC Research Institute \\
4 Independence Way \\
Princeton, NJ\ \ 08540 
\end{center}

\begingroup

\parindent=0pt

\baselineskip=14pt

Name\ \hrulefill

Affiliation\ \hrulefill

Street Address\ \hrulefill

City\ \hrulefill\ State\ \hrulefill

ZIP or Postal \#\ \hrulefill

Country\ \hrulefill

Internet address\ \hrulefill

Phone\ \hrulefill

\bigskip

Please circle one, and fill in your membership number, if
appropriate:\ \hrulefill

\medskip

\begin{tabular}{@{}lcc}
\bf Category                        & \bf Fee & \bf After\\
                                    &     & \bf 5/20 \\
ACM, SIGACT or SIGArch member       & 285 & 335 \\
EATCS member                	    & 285 & 335 \\
Author or Program Committee member  & 285 & 335 \\
Student                             & 130 & 150 \\
Other                               & 345 & 395
\end{tabular}

\bigskip

Check your dietary preference:

Vegetarian\ \hrulefill\ No Restriction\ \hrulefill

\medskip

\endgroup

If you are interested in a shuttle from Philadelphia Airport or
Atlantic City Airport, please see information later in this brochure
under Transportation, and indicate time and location of flights below
or e-mail {\tt spaa94@research.nj.nec.com}.

\smallskip

\noindent Arriving flight\ \hrulefill

\smallskip

\noindent Departing flight\ \hrulefill

\newpage

\heading{Hotel Reservations}

The conference will be held at the Grand Hotel in Cape May.  The rates
for SPAA'94 are posted below and apply from Friday, June 24 through
Thursday, June 30. Checkin time is 2~{\sc p.m.}\ and checkout is 11~{\sc
a.m\@.} Arrivals earlier than 2~{\sc p.m.}\ will be accommodated as
rooms become available.  Please advise the hotel of late arrival.

Reservations should be made by {\bf Friday, May 20}.  Reservations
made after that will be accepted on a rate and space availability
basis.  To make your reservations by phone, call the Grand Hotel at
609-884-5611 or 800-257-8550 and refer to SPAA'94.  To make
reservations by mail, fill out the form below and send it to the
address below. A deposit in the form of a check or money order for one
night's stay or credit card information must be included.  When
filling out the form, make sure that you list your name exactly as it
appears on your check or credit card.  The following credit cards are
accepted: American Express, Diners Club, Visa, and Mastercard.  If you
cancel and notify the hotel at least two weeks before your specified
arrival, 75\percent\ of your deposit will be refunded.

For babysitting service request, please indicate ages of the children
and the times on the form below.

\begin{center}
The Grand Hotel\\
ATTN: SPAA'94 Reservations\\
P.O. Box 496\\
Cape May, New Jersey 08204\\
Fax: 609-898-0341
\end{center}

\begingroup

\parindent=0pt

\begingroup

\baselineskip=14pt

Single \$100\ \hrulefill\ Double (1 bed) \$100\ \hrulefill

\smallskip

Double (2 beds) \$100\ \hrulefill\ Triple \$110\ \hrulefill\ Quad
\$120\ \hrulefill

\smallskip

Check-in date\ \hrulefill\ Check-out date\ \hrulefill

\medskip


Name\ \hrulefill

\smallskip

Address\ \hrulefill

\smallskip

\brule{1.65in}\ Phone\ \hrulefill

\smallskip

Sharing room with\ \hrulefill

\smallskip
Babysitting requests (times/child's age)\ \hrulefill
\medskip

If paying for deposit by credit card, please complete:

\smallskip

Credit Card Number\ \hrulefill

\smallskip

Credit Card Type\ \hrulefill\ Expiration Date\ \hrulefill

\medskip

\begingroup

\baselineskip=12pt

I authorize The Grand Hotel of Cape May to charge the above account
an amount equal to one night's stay as deposit.

\endgroup

\smallskip

Signature\ \hrulefill


\endgroup

\newpage


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\subheading{SATURDAY, JUNE 25, 1994}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{description}

\item[11:00] {\bf Round 1 of the International Computer Chess Championship}

\item[7:00] {\bf Round 2 of the International Computer Chess Championship}

\end{description}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\subheading{SUNDAY, JUNE 26, 1994}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{description}

\item[9:30] {\bf Round 3 of the International Computer Chess Championship}

\item[4:00] {\bf Technical Session on Recent Developments in Computer Chess}

\item[5:00] {\bf Break}

\item[7:00] {\bf Round 4 of the International Computer Chess Championship}

\end{description}


\begin{description}

\item[7:00] {\bf Conference reception for all SPAA attendees}

\end{description}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\subheading{MONDAY, JUNE 27, 1994}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{description}

\item[8:00] {\bf Continental Breakfast}

\item[8:45] {\bf Welcoming Remarks by SPAA'94 Organizers}

\end{description}

\subheading{Session A}

\begin{description}

\item[9:00] {\it An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM}

Shay Halperin, Uri Zwick, {\it Tel Aviv U.} 
 
\item[9:20] {\it A Linear-Work Parallel Algorithm for Finding a Minimum
Spanning Tree }

Richard Cole, {\it NYU}; Philip N. Klein, {\it Brown}; Robert E.
Tarjan; {\it Princeton and NEC}
 
\item[9:40] {\it A Comparison of Parallel Algorithms for Connected
Components}

John Greiner, {\it CMU}

\item[10:00] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[10:20] {\bf Break}

\end{description}

%---------------------------------------------------------------------

\subheading{Session B}

\begin{description}

\item[10:50] {\it Improved Bounds for Routing and Sorting on
Multi-Dimensional Meshes}

Torsten Suel, {\it U.~Texas, Austin}
 
\item[11:10] {\it 2d-Bubblesorting in $O(\sqrt{N \lg N})$ Time in the
Average Case}
  
Doug Ierardi, {\it USC} 
 
\item[11:30] {\it Parallel Sorting by Overpartitioning}

Hui Li, Kenneth C. Sevcik, {\it Toronto}

\item[11:50] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[12:10] {\bf Lunch}

\end{description}

%---------------------------------------------------------------------

\subheading{Session C}

\begin{description}

\item[1:40] {\it Efficient Compilation of High-Level Data Parallel Algorithms}

Dan Suciu, Val Tannen, {\it U.~Pennsylvania}
 
\item[2:00] {\it SIMD Instruction Cache}

Todd E. Rockoff, {\it Flinders U.}
 
\item[2:20] {\it Improved Parity-Declustered Layouts for Disk Arrays}

Eric J. Schwabe, Ian M. Sutherland, {\it Northwestern}
 
\item[2:40] {\it Scheduling Trees Using FIFO Queues: A Control-Memory
Tradeoff}

Sandeep N. Bhatt, Fan R. K. Chung, {\it Bellcore}; Tom Leighton, {\it
MIT}; Arnold L. Rosenberg {\it U.~Massachusetts, Amherst}

\item[3:00] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[3:30] {\bf Break}

\end{description}

%---------------------------------------------------------------------

\subheading{Session D}

\begin{description}

\item[4:00] {\it Studying Overheads in Massively Parallel MIN/MAX-Tree
Evaluation}

Rainer Feldmann, Peter Mysliwietz, Burkhard Monien, {\it U.~Paderborn}
 
\item[4:20] {\it List Ranking and List Scan on the CRAY C-90}

Margaret Reid-Miller, {\it CMU} 
 
\item[4:40] {\it Dynamic Parallel Tree Contraction}

John H. Reif, {\it CMU and Duke}; Stephen R. Tate, {\it U.~North Texas} 
 
\item[5:00] {\it Experiences with Parallel N-body Simulation}

Pangfeng Liu, {\it DIMACS}; Sandeep N. Bhatt, {\it Bellcore}

\item[5:20] {\bf Discussion}

\item[5:50] {\bf Break}

\end{description}


\begin{description}

\item[7:00] {\bf Round 5 of the International Computer Chess Championship}

\end{description}

\begin{description}

\item[8:00] {\bf SPAA Business Meeting}

\end{description}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\newpage
\subheading{TUESDAY, JUNE 28, 1994}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{description}

\item[7:45] {\bf Continental Breakfast}

\end{description}

\subheading{Session E}

\begin{description}

\item[8:30] {\it Bandwidth-Based Lower Bounds on Slowdown for
Efficient Emulations Between Fixed-Connection Networks}

Clyde P. Kruskal, {\it U.~Maryland}; Kevin J. Rappoport, {\it
Pacific-Sierra Research}
 
\item[8:50] {\it $AT^2$ Bounds for a Class of VLSI Problems and String
Matching}

Micah Adler, John Byers, {\it U.C. Berkeley}
 
\item[9:10] {\it An $\Omega(\sqrt{\log\log n})$ Lower Bound for Routing in Optical Networks}

Leslie Ann Goldberg, {\it Sandia}; Mark Jerrum {\it U.~Edinburgh};
Philip D. MacKenzie, {\it U.~Texas, Austin}

\item[9:30] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[9:50] {\bf Break}

\end{description}

%---------------------------------------------------------------------

\subheading{Session F}

\begin{description}

\item[10:20] {\it Programming DEC-Alpha Based Multiprocessors The Easy
Way}

Hagit Attiya, Roy Friedman, {\it Technion}
 
\item[10:40] {\it Diffracting Trees }

Nir Shavit, Asaph Zemach {\it Tel Aviv U.}
 
\item[11:00] {\it On Testing Cache-Coherent Shared Memories }

Phillip B. Gibbons, {\it AT\&T Bell Labs}, Ephraim Korach {\it
Ben-Gurion U.}
 
\item[11:20] {\it Modeling Communication in Parallel Algorithms: A
Fruitful Interaction between Theory and Systems?}

Jaswinder Pal Singh, {\it Stanford}; Edward Rothberg, {\it Intel};
Anoop Gupta, {\it Stanford}
 
\item[11:40] {\bf Discussion }

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[12:10] {\bf Lunch, including the presentation of awards for the
International Computer Chess Championship}

\end{description}

%---------------------------------------------------------------------

\subheading{Session G}

\begin{description}

\item[1:40] {\it Scheduling Parallelizable Tasks to Minimize Average
Response Time}

John Turek, {\it IBM, Yorktown}; 
Walter Ludwig, {\it U.~Wisconsin, Madison};
Joel Wolf, {\it IBM, Yorktown}; 
Lisa Fleischer, {\it Cornell}; 
Prasoon Tiwari, {\it IBM, Yorktown}; 
Jason Glasgow, {\it Technion};
Uwe Schweigelshohn, {\it U.~Dortmund};
Philip S. Yu, {\it IBM, Yorktown}
 
\item[2:00] {\it Job Scheduling in Rings }

Perry Fizzano, {\it Dartmouth}; David Karger, {\it Stanford}; Clifford
Stein, {\it Dartmouth}; Joel Wein, {\it Polytechnic U.}
 
\item[2:20] {\it An Analysis of Diffusive Load-Balancing }

Raghu Subramanian, Isaac D. Scherson, {\it U.C. Irvine}
 
\item[2:40] {\it Dynamic Load Balancing in Distributed Networks by
Random Matchings }

Bhaskar Ghosh, {\it Yale}; S. Muthukrishnan, {\it NYU}
 
\item[3:00] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[3:30] {\bf Break}

\end{description}

%---------------------------------------------------------------------
\begin{description}

\item[7:30] {\bf SPAA Conference Banquet}

\item[] {\bf Banquet Speaker:} Monty Newborn, {\it McGill University},
speaking on {\it Computer Chess}

\end{description}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\medskip
\subheading{WEDNESDAY, JUNE 29, 1994}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{description}

\item[8:15] {\bf Continental Breakfast}

\end{description}

\subheading{Session H}

\begin{description}

\item[9:00] {\it Efficient Low-Contention Parallel Algorithms }

Phillip B. Gibbons, Yossi Matias, {\it AT\&T Bell Labs}; 
Vijaya Ramachandran, {\it U.~Texas, Austin}
 
\item[9:20] {\it Constructive Deterministic PRAM Simulation on a
Mesh-Connected Computer}

Andrea Pietracaprina, {\it Brown}; Geppino Pucci, {\it U.~Padova}; Jop
F. Sibeyn, {\it MPI, Saarbr\"{u}cken}
 
\item[9:40] {\it An Optical Shared Memory Simulation } 

Leslie Ann Goldberg, {\it Sandia}; Yossi Matias, {\it AT\&T Bell Labs};
Satish Rao, {\it NEC}
 
\item[10:00] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[10:20] {\bf Break}

\end{description}

%---------------------------------------------------------------------

\subheading{Session I}

\begin{description}

\item[10:50] {\it Construction of the Mesh and the Torus Tolerating a
Large Number of Faults }

Hisao Tamaki, {\it IBM, Yorktown}
 
\item[11:10] {\it $O(\log^2 n)$ Time Efficient Parallel Factorization
of Dense, Sparse Separable, and Banded Matrices}

John H. Reif, {\it CMU and Duke} 
 
\item[11:30] {\it How Much Can We Speedup Gaussian Elimination with
Pivoting? }

M. Leoncini, {\it U.~Pisa} 
 
\item[11:50] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[12:10] {\bf Lunch}

\end{description}

%---------------------------------------------------------------------

\subheading{Session J}

\begin{description}

\item[1:40] {\it Efficient Algorithms for All-to-All Communications
in Multi-Port Message-Passing Systems }

Jehoshua Bruck, Ching-Tien Ho, {\it IBM, Almaden};
Shlomo Kipnis, {\it IBM, Haifa};
Derrick Weathersby, {\it U.~Washington, Seattle}
 
\item[2:00] {\it An Architecture for Optimal All-to-All Personalized
Communication }

Susan Hinrichs, Corey Kosak, Dave O'Hallaron, Thomas M. Stricker,
Riichiro Take, {\it CMU}
 
\item[2:20] {\it Communication-Efficient Matrix Multiplication on
Hypercubes }

Himanshu Gupta, P. Sadayappan, {\it Ohio State}
 
\item[2:40] {\it A Model for Multi-Grained Parallelism }

John E. Savage, {\it Brown} 
 
\item[3:00] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[3:30] {\bf Break}

\end{description}

%---------------------------------------------------------------------

\subheading{Session K}

\begin{description}

\item[4:00] {\it Increasing Network Bandwidth on Meshes }

Jerry Stamatopoulos, Jon A. Solworth, {U.~Illinois, Chicago}
 
\item[4:20] {\it Bounds on the Greedy Routing Algorithm for Array
Networks }

Michael Mitzenmacher, {\it U.C. Berkeley}
 
\item[4:40] {\it Minimal Adaptive Routing on the Mesh with Bounded
Queue Size }

Donald D. Chinn, {\it U.~Washington, Seattle}; Tom Leighton, {\it
MIT}; Martin Tompa, {\it U.~Washington, Seattle}
 
\item[5:00] {\it Segment Router: A Novel Router Design for Parallel
Computers }

S. Konstantinidou, {\it IBM, Yorktown}

\item[5:20] {\bf Discussion}

\end{description}

%---------------------------------------------------------------------

\begin{description}

\item[5:50] {\bf Adjourn}

\end{description}

\endgroup

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%


\newpage
\heading{ACM's 24th International Computer Chess Championship}

All SPAA attendees are invited to attend ACM's 24th International
Computer Chess Championship, which will be held as a special event
Saturday through Monday, June 25--27, 1994.  The five-round
Swiss-style event will be played at a rate of 40 moves in the first
two hours and 20 moves every hour thereafter.  Two rounds are
scheduled on Saturday, two on Sunday, and the final round will take
place Monday evening.  The field will be limited to twelve teams.
With the level of play of the top programs at the grandmaster level,
the event promises to be one more important milestone in the history
of the rapid progress of chess programming.  Several of the
participants are expected to use large multiprocessing systems, while
others will use high-speed personal computers.  For more information
or to enter, contact Monty Newborn, School of Computer Science, McGill
University, 3480 University Street, Montreal, Quebec, Canada H3A~2A7;
Phone: 514-398-7079; Internet: {\tt newborn@cs.mcgill.ca}.  Entries
close on June 2, 1994.

\newpage
\heading{General Information}

\prehead{Location:} All conference events will take place at the
oceanfront Grand Hotel in Cape May, New Jersey.  Cape May is one of
the oldest seashore resorts in America and is situated between the
Atlantic Ocean and Delaware Bay.  It is a quaint village that features
over 600 fully restored Victorian homes.  Activities include trolley
and walking tours of Cape May, whale watching and other boat tours,
deep sea fishing, birdwatching, golf, tennis, surfing, and swimming.
There are also numerous parks nearby, including Leamings Run
Botanical Gardens and Cape May Point State Park, which features a
lighthouse, nature trails and a nature center.  Other nearby
attractions include Atlantic City with numerous evening shows as well
as gambling, the amusement parks on the boardwalk in the Wildwoods
which have more rides than Disneyland, and Cold Spring Village, a
recreated historic village, life and crafts of yesterday.  Information
on all these activities will be included in your registration packets.

\prehead{Climate:} June temperatures are pleasant, ranging as high as
$85^\circ$~F. (about $30^\circ$~C.) during the day down to as low as
$60^\circ$~F. (about $15^\circ$~C.) at night.

\prehead{Registration:} A registration desk will be open from 7:00~{\sc
p.m.}\ until 9:00~{\sc p.m.}\ on Sunday, July 21, and during the day on
Monday through Wednesday.

\prehead{Student Support:} Some travel money may be available for
students wishing to attend SPAA'94.  Priority will be given to
speakers and authors with insufficient funds.  If interested, please
contact Bruce Maggs via the Internet at {\tt bmm@cs.cmu.edu}.

\prehead{Reception and Banquet:} There will be a reception for all
registrants from 7:00~{\sc p.m.}\ until 10:00~{\sc p.m.}\ on Sunday
evening at the Grand Hotel.  The conference banquet will be at
7:30~{\sc p.m.}\ on Tuesday evening.  Extra banquet tickets will be
available at the conference for \$35 each.

\prehead{Business Meeting:} The annual SPAA business meeting will be
held at 8:00~{\sc p.m.}\ on Monday evening.  All registrants are
encouraged to attend.  A variety of subjects will be discussed,
including the location of future SPAA's and program committee policy.
A special discussion will be held this year on how the program
committee should evaluate empirical research.

\prehead{Further Information:} For further information, contact the
local arrangement chairs Yuh-Dauh Lyuu or Satish Rao, NEC Research
Institute, 4 Independence Way, Princeton, NJ\ \ 08540; Phone:
609-951-2714; Fax: 609-951-2496; Internet: {\tt
spaa94@research.nj.nec.com}.

\newpage
\heading{Transportation} 

If your transportation requirements are not addressed in the following
text, please contact the local arrangement chairs via the Internet at
{\tt spaa94@research.nj.nec.com}.

\prehead{By Air:} The Grand Hotel is located at Beach Avenue and
Philadelphia Avenue in Cape May, New Jersey.  Cape May is located about
45 minutes (by car) from the Atlantic City Airport, two hours from the
Philadelphia Airport, and three hours from Newark Airport.  Airlines
that fly to the Atlantic City Airport (609-645-7895) include
Continental Express, Northwest, USAir, and Spirit.

Avis is offering a discount on weekly rates for rental cars to
attendees of the SPAA conference.  Rates start at \$140 when
originating at Atlantic City or Philadelphia Airport and at \$180 when
originating at Newark.  If you are interested, please call
800-331-1600, and mention ``the SPAA Conference'' and the conference
number Y524004.

SPAA'94 will provide free shuttle service between Philadelphia Airport
and Cape May with the following tentative schedule:
\begin{center}
{\bf Philadelphia Airport to Grand Hotel} \\
      June 25,  4:00~{\sc p.m.} \\
      June 25,  8:00~{\sc p.m.} \\
      June 26,  4:00~{\sc p.m.}  \\
      June 26,  8:00~{\sc p.m.} \\
{\bf Grand Hotel to Philadelphia Airport} \\
      June 29,  6:00~{\sc p.m.} \\
      June 30,  8:00~{\sc a.m.} \\
      June 30,  11:00~{\sc a.m.}  
\end{center}

\noindent SPAA'94 may also be able to provide free shuttle service
between Atlantic City Airport and Cape May.  If you are interested in
shuttle service from either airport, please indicate on the
registration form when and where your flights will arrive and depart.

\prehead{By Train:} Amtrak (800-872-7245) serves Atlantic City, and
New Jersey Transit (201-762-5100) provides busses between Atlantic
City and Cape May.  The train station is across the street from the
bus terminal.

\prehead{By Bus:} New Jersey Transit buses depart from Atlantic City
Bus Terminal (201-762-5100), from Philadelphia (215-569-3752), and the
from the Port Authority Bus Terminal (201-460-8444) in New York City.

\prehead{By Car:} Cape May is located at the southernmost tip of the
New Jersey shore.  Using the Garden State Parkway (toll road), travel
south to the end of the Parkway.  Continue straight through a traffic
light over a large concrete overpass and then over a small canal
bridge into the city of Cape May.  You will be on Lafayette Street.
Continue to the first traffic light, and turn left onto Madison
Avenue.  Once you reach the ocean, take a left onto Beach Drive.  The
hotel is on the left at Philadelphia Avenue.

To reach the Garden State Parkway from Philadelphia Airport, travel
north on Interstate 95.  Take Interstate 76 East across the Walt
Whitman Bridge.  After crossing the bridge, stay in the left lane.
You will be on the North-South Freeway (Route~42).  Follow 8 to 11
miles to the Atlantic City Expressway East (toll road) to the Garden
State Parkway South.

To reach the Garden State Parkway from the Delaware Memorial Bridge,
take Route 40 East to Route 55 South to Route 47 South to the Garden
State Parkway South.

To get to Cape May from the Cape May--Lewes Ferry (609-886-9699),
follow Route 109 and signs Cape May/Wildwood, and then, to the
concrete overpass and canal bridge into the city of Cape May.  You
will be on Lafayette Street.  Continue to the first traffic light, and
turn left onto Madison Avenue.  Once you reach the ocean, take a left
onto Beach Drive.  The hotel is on the left at Philadelphia Avenue.

\newpage
\heading{SPAA'94 Organization}

{\raggedright
\subheading{Conference Chair}

Lawrence Snyder, {\it U.~Washington, Seattle}

\subheading{Treasurer} 

Bruce Maggs, {\it CMU}

\subheading{Local Arrangements}

Satish Rao, Yuh-Dauh Lyuu,
{\it NEC Research Institute}

\subheading{Program Committee}

Gianfranco Bilardi, {\it U.~Padova}\\
Tom Blank, {\it MasPar}\\
Guy Blelloch, {\it CMU}\\
David Culler, {\it U.C. Berkeley}\\
Robert Cypher, {\it IBM, Almaden}\\
Torben Hagerup, {\it Max Planck Institute}\\
Charles E. Leiserson (Chair), {\it MIT}\\
Trevor N. Mudge, {\it U.~Michigan, Ann Arbor}\\
Cynthia A. Phillips, {\it Sandia National Laboratories}\\
Steve Scott, {\it Cray Research}\\
C. Gregory Plaxton, {\it U.~Texas, Austin}\\
Rob Schreiber, {\it RIACS}

\subheading{Corporate Affiliates}

DIMACS Center for Discrete Mathematics and Theoretical Computer Science\\
{\it New Brunswick, NJ}\\[6pt]

Elsevier Science Publishers\\
{\it Amsterdam, The Netherlands}\\[6pt]

NEC Research Institute\\
{\it Princeton, NJ}\\[6pt]

Plenum Publishing Corporation\\
{\it New York, NY}\\[6pt]

PWS Publishing Company\\
{\it Belmont, CA}\\[6pt]

}

\end{document}





