|
|
|
|
Symposia on Fundamentals of Computation Theory are held every two years. Papers presenting original research in all areas of theoretical computer science are sought. Topics of interest include efficient algorithms and data structures, automata and formal languages, categorical and topological approaches, circuits, computational and structural complexity, 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.
The symposium will feature invited lectures and sessions for presenting technical contributions. We intend to organize satellite workshops on quantum computation, molecular computation, bioinformatics, formal languages, circuit complexity, randomized and approximation algorithms.
The invited speakers are:
| Gilles Brassard (Montreal) | Janis Barzdins (Riga) | |
| Klaus Jansen (Kiel) | Juhani Karhumaki (Turku) | |
| Marek Karpinski (Bonn) | Boris Plotkin (Jerusalem) | |
| Umesh Vazirani (Berkeley) |
Workshop on Efficient Algorithms - WEA 2001
The proceedings of FCT have always been published as volumes of Lecture Notes in Computer Science by Springer-Verlag. The proceedings of FCT 2001 will be published as LNCS 2138. It is now available online. You can find it at the URL
http://link.springer.de/link/service/series/0558/tocs/t2138.htm
orhttp://link.springer-ny.com/link/service/series/0558/tocs/t2138.htm
Program Committee consists of:
| Andris Ambainis (Berkeley) | Setsuo Arikava (Fukuoka) | |
| Yuri Breitbart (Bell Labs) | Cristian Calude (Auckland) | |
| Bogdan Chlebus (Warsaw) | Alexander Dikovsky (Nantes) | |
| Rusins Freivalds (Riga), Chair | Jozef Gruska (Brno) | |
| Tero Harju (Turku) | Kazuo Iwama (Kyoto) | |
| Aleksander Letichevskij (Kiev) | Andrzej Lingas (Lund) | |
| Christoph Meinel (Trier) | Valery Nepomniaschy (Novosibirsk) | |
| Jaan Penjam (Tallinn) | Anatol Slissenko (Paris) | |
| Carl Smith (Maryland) | Paul Spirakis (Patras) | |
| Esko Ukkonen (Helsinki) | Eli Upfal (Brown) | |
| Mars Valiev (Moscow) |
Organizing Committee consists of:
| Baiba Apine | Aija Berzina | |
| Juris Borzovs, Chair |
Arija Deme | |
|
Anita Ermusa |
Marats Golovkins | |
|
Martins Gills |
||
|
Filips Jelisejevs |
Anita Kalnina | |
|
Arnolds Kikusts |
Maksims Kravcevs | |
| Ieva Lapina | Sanda Linde | |
| Inara Opmane |
Janis Plume, Vice Chair | |
|
Karlis Prieditis |
|
Darja Zukova |
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) using the address: rand@rausis.latnet.lv
Authors from countries where access to Internet is difficult should contact the conference chair.
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.
-Submission deadline: extended!!! March 9, 2001,
-Notification: April 9, 2001,
-Camera-ready copy due: May 7, 2001
The organizers are aware that for rather many potential participants it is crucially important that the accommodation expenses and the fees are as low as possible. We also hope to get some financial support for travel for some of the participants. Please contact the Program Committee if you need the support.
The next FCT 2003 conference will take place in Malmo, Sweden, August 12-15, 2003, with A. Lingas - PC Chair, and B. Nilsson - Local Conference Chair.
