COCOON96 program: Latex2e version
DJ Ierardi
%This is the latex2e program for COCOON96
%Any comments may be sent to the COCOON'96 organizing
%committee at coco...@cs.ust.hk
%Created April 25, 1996
%%%%%% EARLY REGISTRATION ENDS MAY 4, 1996 %%%%%%%
\documentclass[twocolumn]{article}
\usepackage{times}
\usepackage{tabularx}
\usepackage{latexsym}
\setlength{\footskip}{0.0in}
\setlength{\headheight}{0.0in}
\setlength{\headsep}{0.0in}
\setlength{\topmargin}{0.0 in}
\setlength{\oddsidemargin}{-0.25 in}
\setlength{\evensidemargin}{-0.25 in}
\setlength{\textwidth}{7.0in}
%\setlength{\columnwidth}{3.4in}
%\setlength{\columnsep}{0.2in}
\setlength{\columnwidth}{3.3in}
\setlength{\columnsep}{0.4in}
\setlength{\textheight}{9.0in}
\setlength{\parindent}{0in}
\setlength{\parskip}{1ex}
\newcommand{\lsp}[1]{\large\renewcommand{\baselinestretch}{#1}\normalsize}
\newcommand{\hsp}{\hspace{.1in}}
\def\oln#1{\hspace*{.1in}\parbox[t]{3.1in} {{ #1}}}
%\newcommand{\myent}[3]{ \item[] {\bf #1} \newline {\it #2} \newline \oln{#3}}
%\newcommand{\myent}[3]{ \item[] {\bf #1} \newline #3 \newline {\it \oln{#2}}}
%\newcommand{\tabent}[3]{{\bf #1} & #3 \\ & {\it \oln{#2}}\\}
\newcommand{\myent}[3]{{\bf #1} & {\it #3} \\ & {#2} \smallskip \\}
\title{
\Large Program\\
{\bf The Second International Computing and Combinatorics Conference}\\
{\bf COCOON '96} \\
Hong Kong, June 17--19 1996\\
\smallskip
\large
{\em In cooperation with the \\}
{\em Hong Kong Chapter of the ACM and the IEEE
Computer Chapter, Hong Kong Section.\/}
}
\date{}
\author{}
%\addtolength{\textheight}{0.2in}
%\addtolength{\topmargin}{-0.5in}
\begin{document}
\pagestyle{empty}
\maketitle
\thispagestyle{empty}
\normalsize
\begin{center}
{\large \bf Day 1 (17 June 1996)}
\end{center}
\fbox{
\parbox{3.2in}{
\begin{center}
{\bf Keynote Address}\\
Chair: C.~K.~Wong \hsp 9:00 am -- 10:00 am \\
\medskip
{\sc Algorithmic Aspects of \\ Computer Aided Design of VLSI Circuits}\\
\medskip
{\bf Professor C.~L.~Liu} \\
{\it University of Illinois at Urbana-Champaign} \\
\end{center}
}
}
\medskip
\begin{center}
{\bf Break: 10 am -- 10:20 am}
\end{center}
\medskip
\begin{center}
{\bf Session 1 \hsp Chair: C.~K.~Wong \\ 10:20 am -- 12:00 noon}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{10:20}
{Matthew Andrews, Michel X. Goemans, Lisa Zhang}
{Improved Bounds for On-line Load Balancing}
\myent
{10:45}
{Guo-Liang Xue, Ding-Zhu Du}
{$O(n \log n)$-average-time algorithm for
shortest networks under a given topology}
\myent
{11:10}
{Tsan-Sheng Hsu, D.~T.~Lee, Kuo-Hui Tsai, Da-Wei Wang}
{Steiner problems on directed acyclic graphs}
\myent
{11:35}
{Efstratios Karaivazoglou, Paul Spirakis, Vassilis Triantafilou}
{Wormhole versus deflection routing: A case study on the mesh}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Lunch: 12:00 noon -- 1:30 pm}
\end{center}
\newpage
\begin{center}
{\bf Session 2 \hsp Chair: J.-Y.~Cai \\ 1:30 pm -- 3:10 pm}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{1:30}
{Hanno Lefmann, Pavel Pudl\'{a}k, Petr Savick\'y}
{On Sparse Parity Check Matrices}
\myent
{1:55}
{Zhixiang Chen, Carlos Cunha, Steven Homer}
{Finding a Hidden Code by Asking Questions}
\myent
{2:20}
{H. K. Dai, K. E. Flannery}
{Improved Length Lower Bounds for Reflecting Sequences}
\myent
{2:45}
{Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida}
{Combinatorial and Geometric Approaches to Counting Problems on
Linear Matroids, Graphic Arrangements and Partial Orders}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Break: 3:10 pm -- 3:30 pm}
\end{center}
\begin{center}
{\bf Session 3: \hsp Chair: D.~T.~Lee \\ 3:30 pm -- 5:10 pm}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{3:30}
{Giuseppe Di Battista, Roberto Tamassia, Luca Vismara}
{Output-Sensitive Reporting of Disjoint Paths}
\myent
{3:55}
{Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki}
{Rectangular Grid Drawings of Plane Graphs}
\myent
{4:20}
{Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa}
{Area-Efficient Algorithms for Upward Straight-Line Tree Drawings}
\myent
{4:45}
{Oswin Aichholzer, Franz Aurenhammer}
{Straight Skeletons for General Polygonal Figures in the Plane}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Reception: \hsp 5:30 pm -- 6:30 pm}
\end{center}
%\vspace{.5in}
%\medskip
%\pagebreak
%\addtolength{\topmargin}{0.5in}
%\addtolength{\textheight}{-0.2in}
\newpage
\begin{center}
{\large \bf Day 2 (18 June 1996)}
\end{center}
\begin{center}
{\bf Session 4 \hsp Chair: S.~Toda \\ 8:45 am -- 10:00 am}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{8:45}
{Eric Allender}
{A note on uniform circuit lower bounds for the counting hierarchy}
\myent
{9:10}
{Thomas Hofmeister}
{A note on the simulation of exponential threshold weights}
\myent
{9:35}
{Vince Grolmusz}
{Harmonic analysis, real approximation, and the communication complexity
of Boolean functions}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Break: 10 am -- 10:20 am}
\end{center}
\begin{center}
{\bf Session 5 \hsp Chair: T.~Nishizeki \\ 10:20 am -- 12:00 noon}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{10:20}
{Gruia C\u{a}linescu, Cristina G. Fernandes}
{Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus}
\myent
{10:45}
{Farhad Shahrokhi, Weiping Shi}
{Efficient Deterministic Algorithms for Embedding
Graphs on Books}
\myent
{11:10}
{Tsan-sheng Hsu, Ming-Yang Kao}
{Optimal Bi-Level Augmentation for selectivity enhancing graph connectivity
with applications}
\myent{11:35}
{Carlos Domingo}
{Exact Learning of Subclasses of CDNF formulas with Membership queries}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Lunch: 12:00 noon -- 1:30 pm}
\end{center}
\begin{center}
{\bf Session 6 \hsp Chair: H.~Edelsbrunner \\ 1:30 pm -- 3:10 pm}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{1:30}
{Shang-Hua Teng}
{Fast Separator-Decomposition for Finite-Element Meshes}
\myent
{1:55}
{Hans L. Bodlaender, Babette de Fluiter}
{Reduction Algorithms for Constructing Solutions in Graphs with
Small Treewidth}
\myent
{2:20}
{Ryuhei Uehara, Zhi-Zhong Chen, Xin He}
{Fast RNC and NC algorithms for finding a maximal set of paths with
an application}
\myent
{2:45}
{Juha K\"arkk\"ainen, Esko Ukkonen}
{Sparse suffix trees}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Break: 3:10 pm -- 3:30 pm}
\end{center}
\begin{center}
{\bf Session 7 \hsp Chair: C.~Yap \\ 3:30 pm -- 5:35 pm}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{3:30}
{Chi-Hsiang Yeh, Emmanouel A. Varvarigos}
{Depth-efficient threshold circuits for multiplication and
symmetric function computation}
\myent
{3:55}
{V. Arvind}
{On the self-witnessing property of computational problems}
\myent
{4:20}
{Dimitris Kavvadias, Martha Sideri}
{The Inverse Satisfiability Problem}
\myent
{4:45}
{Lane A. Hemaspaandra, Zhigen Jiang, J\"{o}rg Rothe, Osamu Watanabe}
{The Join Can Lower Complexity}
\myent
{5:10}
{Xuerong Yong}
{On the distribution of eigenvalues of graphs}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Banquet: \hsp 7:00 pm -- 10:00 pm}
\end{center}
%\vspace{.5in}
\bigskip
\begin{center}
{\large \bf Day 3 (19 June 1996)}
\end{center}
\begin{center}
{\bf Session 8 \hsp Chair: A.~Goldberg \\ 8:45 am -- 10:00 am}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{8:45}
{Mic Grigni, Vincent Mirelli, Christos Papadimitriou}
{On the difficulty of designing good classifiers}
\myent
{9:10}
{S. Ravi Kumar, Alexander Russell, Ravi Sundaram}
{Approximating Latin Square Extensions}
\myent
{9:35}
{Tatsuya Akutsu, Feng Bao}
{Approximating minimum keys and optimal substructure screens}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Break: 10 am -- 10:20 am}
\end{center}
\begin{center}
{\bf Session 9 \hsp Chair: C.~Papadimitriou \\ 10:20 am -- 12:00 noon}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{10:20}
{Jay Belanger, Jie Wang}
{Reductions and covergence rates of average time}
\myent
{10:45}
{Akio Yanbe, Kouichi Sakurai}
{On the Complexity of Computational Problems Associated with
Simple Stochastic Games}
\myent
{11:10}
{Oscar Ibarra, Pedro Diniz, Martin Rinard}
{On the complexity of commutativity analysis}
\myent
{11:35}
{A.E.F. Clementi, L. Trevisan}
{Improved Non-approximability Results for Vertex Cover Problems with
Density Constraints}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Lunch: 12:00 noon -- 1:30 pm}
\end{center}
\begin{center}
{\bf Session 10 \hsp Chair: O.~Ibarra \\ 1:30 pm -- 3:10 pm}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{1:30}
{Ming Li, John Tromp, Louxin Zhang}
{Some notes on the Nearest Neighbour Interchange distance measure}
\myent
{1:55}
{Vasant Shanbhogue, Moti Yung}
{Distributed computing in asynchronous networks with byzantine edges}
\myent
{2:20}
{S. Cho, S. Sahni}
{Weighted biased leftist trees and modified skip lists}
\myent
{2:45}
{Hoong Chuin Lau}
{Probabilistic Analysis of Local Search and NP-Completeness
Result for Constraint Satisfaction}
\end{tabularx}
%\vspace{.1in}
%\medskip
\begin{center}
{\bf Break: 3:10 pm -- 3:30 pm}
\end{center}
\begin{center}
{\bf Session 11 \hsp Chair: M.~Y.~Kao \\ 3:30 pm -- 5:35 pm}
\end{center}
\begin{tabularx}{4in}
{>{\setlength{\hsize}{.25\hsize}}X>{\setlength{\hsize}{2.0\hsize}}X}
\myent
{3:30}
{Sue Whitesides, Naixun Pei}
{On the reconfiguration of chains}
\myent
{3:55}
{Xuehou Tan, Binhai Zhu}
{Two-guarding a rectilinear polygon}
\myent
{4:20}
{R. Safavi-Naini}
{Three Systems for Shared Generation of Authenticators}
\myent
{4:45}
{Kwok-Yan Lam, San Ling, Lucas C-K Hui}
{Efficient Generation of Elliptic curve cryptosystems}
\myent
{5:10}
{Jixiang Meng}
{Superconnectivity for Minimal Multi-Loop Networks}
\end{tabularx}
\medskip
\begin{center}
{\Large \bf Conference Venue}\\
Chow Yei Ching Building\\
University of Hong Kong\\
Pokfulam Road, Hong Kong
\end{center}
The first talk on the first day,
the keynote address, will take place
in Lecture Theatre A, located on
the ground floor of the
Chow Yei Ching Building.
All other talks will take place
in Lecture Theatres B and C
on Lower Ground 1 (LG1).
\def\heading#1{\begin{center}\Large\bf#1\end{center}}
\def\brule#1{\vrule width#1 height 0.4pt depth 0.0pt\relax}
\newpage
\setlength{\columnsep}{0.2in}
\heading{Registration for COCOON'96}
The registration fees for COCOON'96 are listed below.
To qualify for the early registration fees, your registration application
must be received by {\bf May 4, 1996}.
The non-student registration fee includes the
reception, the
banquet, coffee breaks and lunches, and a copy of the proceedings.
The student fee does not include the reception, banquet or lunches.
Please fill out the form below and send it, along with a
money order or bank draft (in US\$ or HK\$)
made payable to {\it COCOON'96}, to:
\begin{center}
Dr. H.F. Ting\\
Department of Computer Science\\
The University of Hong Kong\\
Pokfulam Road, Hong Kong
\end{center}
\begingroup
\parindent=0pt
\baselineskip=14pt
\medskip
Last Name\hrulefill First Name\hrulefill\mbox{}
\smallskip
Affiliation\hrulefill\mbox{}
\smallskip
Address\hrulefill\mbox{}
\hspace*{.01in}\hrulefill\mbox{}
\hspace*{.01in}\hrulefill\mbox{}
\smallskip
E-mail\hrulefill\mbox{}
\smallskip
Phone\hrulefill Fax\hrulefill\mbox{}
\bigskip
Please circle one category below.
\bigskip
\begin{tabular}{@{}lcc}
\bf Category & \bf Fee Before May 4 & \bf After May 4\\ \
\
Regular & \$350US/\$2730HK & \$420US/\$3275HK \\ \\
Student & \$250US/\$1950HK & \$300US/\$2340HK
\end{tabular}
\endgroup
\bigskip
There will also be on-site registration in the
Chow Yei Ching Building, University
of Hong Kong.
On 17 June, 1996, registration will
be in the ground floor lobby.
On 18 and 19 June 1996, registration
will be on Lower Ground 1.
\newpage
\heading{Hotel Reservations for COCOON'96}
The conference will be held
from June 17 to June 19, 1996
at the University of Hong Kong on Hong Kong Island.
While accommodations are not available on campus the hotels
listed below provide special conference rates.
For those of you not familiar with Hong Kong note that taxis
are very cheap and easy to catch at hotels. A taxi from
the Furama hotel to the conference site would cost approximately \$3US
and take 15-20 minutes; from the Wharney or South Pacific, \$4US and
20-25 minutes.
Tsimshatsui,
the location of the New World Hotel is in the tourist district
across Victoria
Harbour from Hong Kong Island. It therefore requires much
more travelling time to get from there to the conference;
first a 10 minute walk to the Star Ferry, then a ferry crossing
of the harbour and, finally, a taxi to the university. The ferry +
taxi should
cost approximately \$3US and take 30-35 minutes total.
To make your reservations,
fill out the form below and
send it, along with
a deposit
for at least one night's stay,
to:
\begin{center}
Morning Star Travel Service Limited\\
(fax (+852) 2723 8033)\\
B19-23 Tsimshatsui Centre\\
66 Mody Road\\
Tsimshatsui East\\
Kowloon, Hong Kong
\end{center}
Reservations should be received by {\bf May 1, 1996}.
Deposit should be made
in the form of a bank draft or money order (in US\$, or HK\$)
payable to the Morning Star Travel Service Limited.
Credit cards are {\bf not} accepted.
\medskip
% US~\$1 is now roughly equivalent to HK~\$7.8.
\begingroup
\parindent=0pt
\baselineskip=14pt
\bigskip
Last Name\hrulefill First Name\hrulefill\mbox{}
\smallskip
Affiliation\hrulefill\mbox{}
\smallskip
Address\hrulefill\mbox{}
\hspace*{0.01in}\hrulefill\mbox{}
\smallskip
Nationality/Citizenship\hrulefill\mbox{}Passport \#\hrulefill\mbox{}
% \smallskip
%Passport \#\hrulefill\mbox{}
\smallskip
Phone\hrulefill\mbox{} Fax\hrulefill\mbox{}
\smallskip
Arrival flight \#\hrulefill\mbox{}
\smallskip
Hotel rates shown below include
service charge and tax.
Single and double rooms have the same rates.
Please choose one of the following hotels:
\medskip
{\Large $\Box$} Furama Hotel\\
1 Connaught Road, Central, Hong Kong\\
HK\$ 1,420 (US\$ 185) per night
\smallskip
{\Large $\Box$} Wharney Hotel\\
57-73 Lockhart Road, Wan Chai, Hong Kong\\
HK\$ 1,010 (US\$ 131) per night
\smallskip
{\Large $\Box$} South Pacific Hotel\\
23 Morrision Hill Road, Wan Chai, Hong Kong\\
HK\$ 870 (US\$ 113) per night
\smallskip
{\Large $\Box$} New World Hotel\\
22 Salisbury Road, New World Centre, Tsimshatsui, KOWLOON\\
HK\$ 1,120 (US\$ 146) per night
\medskip
{\large $\Box$}
Single\\
%\hspace*{.1in}\\
{\large $\Box$}
Double\\
\hspace*{.1in}(sharing room with\hrulefill\mbox{})
\smallskip
Date: from \hrulefill to \hrulefill (No. of nights: \hrulefill)\mbox{}
\smallskip
{\small
If falling outside the conference date, reservation
will be accepted subject to space availability.}
\smallskip
I enclose a check/money order of US\$/HK\$\brule{1in}
payable to the Morning Star
Travel Service Limited as deposit, and understand
that the balance will be settled after arrival with the Morning
Star Travel Service Limited at the conference site (instead of
the hotel) using cash, credit card, or traveler's check."
\bigskip
\noindent{\Large $\Box$} {\it Please send me information about tours to
China.}
\endgroup
\end{document}