FCT'03
Andrzej Lingas
andrzej at cs.lth.se
Mon Sep 30 22:17:20 PDT 2002
\documentclass[11pt]{article}
\usepackage[T1]{fontenc}
\topmargin=-1cm
\usepackage{t1enc}
\usepackage[swedish]{babel}
\textheight 9.3in
\textwidth 6.50in
\oddsidemargin 0.00in
\evensidemargin 0.00in
\marginparwidth 2.00cm
\marginparsep 0.50cm
\topmargin 0.00in
\headheight 0.00in
\headsep 0.00in
%\textwidth 16 cm
%\textheight 23 cm
\renewcommand{\baselinestretch}{1.0}
\newcommand{\what}{\sf}
\newcommand{\who}{\rm}
\newcommand{\where}{\it}
\begin{document}
\thispagestyle{empty}
\parskip=4pt
\parindent=0pt
\begin{center}
{\huge {
\bf FCT\ 2003}}
\par
\vskip 0.5 cm
\noindent
{\bf 14-th International Symposium on Fundamentals of Computation Theory}
\par
\vskip 1 cm
\noindent{\bf
Malmö, Sweden, August 12-15, 2003}
\end{center}
\par
\vskip 1 cm
\noindent
The symposia on Fundamentals of Computation Theory are held every two
years. The proceedings of FCT have always been
published as volumes of Lecture Notes in Computer Science by
Springer-Verlag.
\par
\vskip 0.2 cm
\noindent
The 14-th symposium will be held in Malmö, Sweden, at the Malmö Högskola.
The symposium will have invited lectures by Sanjeev Arora (Princeton), Christos Papadimitriou (Berkeley)
and \\
George P\u{a}un (Romanian Academy) and
sessions for presenting
technical contributions.
\par
\vskip 0.5 cm
\noindent
Papers presenting original research in all areas of theoretical
computer science are sought. Topics of interest include:
\vskip 0.2 cm
\parbox{0.3 cm}{\ \ \ }
\parbox{15.7 cm}{
design and analysis of algorithms, abstract data types, approximation
algorithms, automata and formal languages, categorical and topological
approaches, circuits, computational and structural complexity, circuit
and proof theory, computational geometry, computer systems theory,
concurrency theory, cryptography, domain theory, distributed
algorithms and computation, molecular computation, quantum computation
and information, granular computation, probabilistic computation,
learning theory, rewriting, semantics, logic in computer science,
specification, transformation and verification, algebraic aspects of
computer science.}
\par
\vskip 0.3 cm
\noindent
\subsection*{Submissions}
Authors are invited to submit extended abstracts of their papers,
presenting original contributions to the theory of computer
science. Papers should be submitted electronically (in
Postscript) to {\sl Andrzej.Lingas at cs.lth.se}
\par
\vskip 0.2 cm
\noindent
Authors from countries where access to Internet is difficult should
contact the chair of the programme committee using the address:
Andrzej Lingas,
Department of Computer Science,
Lund University,
Box 118,
SE-221 00 Lund,
Sweden
\par
\vskip 0.2 cm
\noindent
Submissions should consist of: a cover page, with the author's full
name, address, fax number, e-mail address, a 100-word abstract,
keywords and an extended abstract describing original research.
Papers should not be exceeding 12 pages in the standard LNCS-style.
\parskip=4pt
\vspace{0.3 cm}
%\Large {\bf Important dates }}
\subsection*{Important dates}
\begin{itemize}
\item Submissions: February 20, 2003
\item Notification: April 1, 2003
\item Camera-ready copy: April 30, 2003
%item Symposium: August 12-15, 2003
\end{itemize}
\newpage
\parskip=4pt
\vspace{0.5 cm}
{\Large {\bf Conference chair}}
\medskip
%\subsection*{Conference chair}
\medskip
{\who Bengt Nilsson }\\
{\where Malmö Högskola}\\
{\where Teknik och samhälle}\\
{\where SE-205 06 Malmö}\\
{\where Sweden}\\
\parskip=4pt
\vspace{0.5cm}
{\Large {\bf Program Committee}}
\medskip
{\who Arne Andersson}, {\where Uppsala} \\
{\who Stefan Arnborg}, {\where KTH Stockholm} \\
{\who Stephen Alstrup}, {\where ITU Copenhagen}\\
{\who Zoltan Esik}, {\where Szeged}\\
{\who Rusins Freivalds}, {\where UL Riga} \\
{\who Alan Frieze}, {\where CMU Pittsburgh}\\
{\who Leszek G\c asieniec}, {\where Liverpool}\\
{\who Magnus Halldorsson}, {\where UI Reykjavik}\\
{\who Klaus Jansen}, {\where Kiel}\\
{\who Juhani Karhumäki}, {\where Turku}\\
{\who Marek Karpinski}, {\where Bonn}\\
{\who Christos Levcopoulos}, {\where Lund}\\
{\who Ming Li}, {\where Waterloo}\\
{\who Andrzej Lingas}, {\where Lund} (Chair)\\
{\who Jan Maluszy\'{n}ski}, {\where Linköping}\\
{\who Fernando Orejas}, {\where Barcelona}\\
{\who Jürgen Prömel}, {\where Berlin}\\
{\who Rüdiger Reischuk}, {\where Lubeck}\\
{\who Wojciech Rytter}, {\where Warsaw/New Jersey IT}\\
{\who Miklos Santha}, {\where Paris-Sud}\\
{\who Andrzej Skowron}, {\where Warsaw}\\
{\who Paul Spirakis}, {\where Patras}\\
{\who Esko Ukkonen}, {\where Helsinki}\\
{\who Ingo Wegener}, {\where Dortmund}\\
{\who Paul Winter}, {\where Copenhagen}\\
{\who Vladimiro Sassone}, {\where Sussex}\\
\parskip=4pt
\vspace{0.5cm}
{\Large {\bf Organizing Committee}}
%\subsection*{Organizing Committee}
\medskip
{\who Bengt Nilsson}, {\where Malmö} (Chair)\\
{\who Oscar Garrido}, {\where Malmö}\\
{\who Thore Husfeldt}, {\where Lund}\\
{\who Miros{\l}aw Kowaluk}, {\where Warsaw}\\
\end{document}
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
More information about the Compgeom-announce
mailing list