From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/3965 Path: news.gmane.org!not-for-mail From: Luke Ong Newsgroups: gmane.science.mathematics.categories Subject: TCS 2008: 1st Call for Papers Date: Sun, 07 Oct 2007 17:25:37 +0100 Message-ID: NNTP-Posting-Host: main.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: quoted-printable X-Trace: ger.gmane.org 1241019631 11120 80.91.229.2 (29 Apr 2009 15:40:31 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 29 Apr 2009 15:40:31 +0000 (UTC) To: categories@mta.ca Original-X-From: rrosebru@mta.ca Mon Oct 8 10:13:58 2007 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 08 Oct 2007 10:13:58 -0300 Original-Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1IesKJ-0003g8-6a for categories-list@mta.ca; Mon, 08 Oct 2007 10:07:15 -0300 Original-Sender: cat-dist@mta.ca Precedence: bulk X-Keywords: X-UID: 22 Original-Lines: 107 Xref: news.gmane.org gmane.science.mathematics.categories:3965 Archived-At: First Announcement and Call for Papers 5th IFIP International Conference on Theoretical Computer Science (TCS-2008) http://www.aicanet.it/wcc2008/TCS2008cfp1.pdf Held in conjunction with the 20th IFIP World Computer Congress September 7-10, 2008, Milano, Italy Conference Co-Chairs: Giorgio Ausiello, IT Giancarlo Mauri, IT Programme Co-Chairs: Track A: Juhani Karhum=C3=83=C2=A4ki, FI Track B: Luke Ong, GB Programme Committee: Track A: Algorithms, Complexity & Models of Computation Ricardo Baeza-Yates (Santiago), Marie-Pierre Beal (Paris),Harry Buhrman (Amsterdam), Xiaotie Deng (Hong Kong), Josep Diaz (Barcelona), Volker Diekert (Stuttgard), Manfred Droste (Leipzig), Ding-zhu Du (Dallas), Juraj Hromkovic (Zurich), Oscar Ibarra (Santa Barbara), Pino Italiano (Rome), Kazuo Iwama (Kyoto), Juhani Karhum=C3=83=C2=A4ki (Turku, chair), = Pekka Orponen (Helsinki), George Paun (Bucharest), Jiri Sgall (Prague), Alexander Shen (Moscow), Vijai Vazirani (Atlanta), Mikhail Volkov (Ekaterinburg) Track B: Logic, Semantics, Specification and Verification Rajeev Alur (Pennsylvania), Ulrich Berger (Swansea), Andreas Blass (Ann Arbor), Anuj Dawar (Cambridge), Mariangiola Dezani-Ciancaglini (Turin), Gilles Dowek (Paris), Peter Dybjer (Stockholm), Masami Hagiya (Tokyo), Martin Hofmann (Munich), Leonid Libkin (Edinburgh), Huimin Lin (Beijing), Stephan Merz (Nancy), Dale Miller (Paris), Eugenio Moggi (Genova), Anca Muscholl (Bordeaux), Luke Ong (Oxford, chair), Davide Sangiorgi (Bologna), Thomas Schwentick (Dortmund), Thomas Streicher (Darmstadt), P. S. Thiagarajan (Singapore), Wolfgang Thomas (Aachen) Submission will be in two stages: a short abstract due on 8 February and the 12-page paper due on 15 February 2008. The results of the paper must be unpublished and not submitted for publication elsewhere, including journals and the proceedings of other symposia or workshops. Authors will be notified of acceptance or rejection via e-mail by 31 March. Full versions of accepted papers (camera-ready) must be written in English, and will be due by 22 April 2008. One author of each accepted paper should present it at the conference. Scope and Topics TCS2008 will be composed of two distinct, but interrelated tracks: Track A on Algorithms, Complexity and Models of Computation, and Track B on Logic, Semantics, Specification and Verification. Suggested, but not exclusive, topics of interest include: Track A - Algorithms, Complexity and Models of Computation Analysis and design of algorithms; Automata and formal languages; Cellular automata and systems; Combinatorial, graph and optimization algorithms; Computational learning theory; Computational complexity; Computational geometry; Cryptography; Descriptive complexity; Evolutionary and genetic computing; Experimental algorithms; Mobile computing; Molecular computing and algorithmic aspects of bioinformatics; Network computing; Neural computing; Parallel and distributed algorithms; Probabilistic and randomized algorithms; Quantum computing; Structural information and communication complexity. Track B - Logic, Semantics, Specification and Verification Automata theory; automated deduction; constructive and non-standard logics in computer science; concurrency theory and foundations of distributed and mobile computing; database theory; finite model theory; formal aspects of program analysis, foundations of hybrid and real-time systems; lambda and combinatory calculi; logical aspects of computational complexity; modal and temporal logics; model checking and verification; probabilistic systems; logics and semantics of programs; foundations of security; term rewriting; specifications; type, proof and category theory in computer science. Paper submission Papers presenting original research in conference topics are being sought. The proceedings will be published by SSBM (Springer Science and Business Media). Submissions, as well as final versions, are limited to 12 pages, in the final SSBM format. The instructions for preparing the papers can be downloaded from http://www.springeronline.com/sgw/cda/frontpage/0,11855,4-40492-0-0- or ftp://ftp.springer.de/pub/tex/latex/ifip/ . Only electronic submissions will be accepted, via Track A: http://www.easychair.org/TCS2008-TrackA Track B: http://www.easychair.org/TCS2008-TrackB The submission deadline, length limitations and formatting instructions are firm: any submissions that deviate from these may be rejected without further considerations. IMPORTANT DATES: 8 February 2008: Abstract submission deadline 15 February 2008: 12-page paper submission deadline 31 March 2008: Notification of acceptance 7 April 2008: Copyright release submission deadline 22 April 2008: Camera-ready copy submission deadline Organized by IFIP Technical Committee 1 (Foundations of Computer Science) and IFIP WG 2.2 (Formal Descriptions of Programming Concepts) in association with SIGACT and EATCS