ICALP 2009 Final Call for Papers

Previous Topic Next Topic
classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view

ICALP 2009 Final Call for Papers

Ioannis Chatzigiannakis
The submission server for ICALP 2009 is open.

Submission deadline: February 10, Tuesday

HTML Version of the CFP: http://icalp09.cti.gr/cfp.html

Details follow.


                    CALL FOR PAPERS - ICALP'09

                 36th International Colloquium on
               Automata,  Languages and Programming

                July 5-12, 2009, Rhodes, Greece


The 36th International Colloquium on Automata, Languages and
Programming, the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS), will take place
from the 5th to the 12th of July 2009 in Rhodes, Greece. The main
conference will take place from the 6th till the 11th of July, and will
be preceded and followed by a series of Workshops.

Following the successful experience of the last four editions, ICALP
2009 will complement the established structure of the scientific program
based on Track A on Algorithms, Automata, Complexity and Games, and
Track B on Logic, Semantics, and Theory of Programming, corresponding to
the two main streams of the journal Theoretical Computer Science, with a
special Track C on Foundations of Networked Computation: Models,
Algorithms and Information Management. The aim of Track C is to allow a
deeper coverage of a particular topic, to be specifically selected for
each year's edition of ICALP on the basis of its timeliness and
relevance for the theoretical computer science community.

Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:

Track A - Algorithms, Automata, Complexity and Games:

    * Algorithmic Game Theory
    * Approximation Algorithms
    * Automata Theory
    * Combinatorics in Computer Science
    * Computational Biology
    * Computational Complexity
    * Computational Geometry
    * Cryptography
    * Data Structures
    * Design and Analysis of Algorithms
    * Internet Algorithmics
    * Machine Learning
    * Parallel, Distributed and External Memory Computing
    * Randomness in Computation
    * Quantum Computing

Track B - Logic, Semantics, and Theory of Programming:

    * Algebraic and Categorical Models
    * Automata Theory, Formal Languages
    * Non-standard Approaches to Computability
    * Databases, Semi-Structured Data and Finite Model Theory
    * Principles of Programming Languages
    * Logics, Formal Methods and Model Checking
    * Models of Concurrent, Distributed, and Mobile Systems
    * Models of Reactive, Hybrid and Stochastic Systems
    * Program Analysis and Transformation
    * Specification, Refinement and Verification
    * Type Systems and Theory, Typed Calculi

Track C - Foundations of Networked Computation: Models, Algorithms and
Information Management

    * Algorithmic Aspects of Networks
    * Auctions
    * Computing with Incentives
    * E-commerce, Privacy, Spam
    * Formal Methods for Network Information Management
    * Foundations of Trust and Reputation in Networks
    * Internet Algorithmics
    * Mobile and Wireless Networks
    * Models of Complex Networks
    * Models and Algorithms for Global Computing
    * Models of Mobile Computation
    * Networks Economics
    * Networks of Low Capability Devices
    * Overlay Networks and P2P Systems
    * Social Networks
    * Specification, Semantics, Synchronization of Networked Systems
    * Theory of Security in Networks and Distributed Computing
    * Web Searching, Ranking
    * Web Mining and Analysis


Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style presenting original research on the theory of
Computer Science. Submissions should indicate to which track (A, B, or
C) the paper is submitted. No simultaneous submission to other
publication outlets (either a conference or a journal) is allowed. The
proceedings will be published in the Lecture Notes in Computer Science
Series by Springer-Verlag.

It is recommended that submissions adhere to the specified format and
length. Submissions that are clearly too long may be rejected
immediately. Additional material intended for the referee but not for
publication in the final version - for example details of proofs - may
be placed in a clearly marked appendix that is not included in the
page limit.

For further information on how to submit a paper to the conference,
please visit the URL



    * Georg Gottlob (Oxford University)
    * Thomas Henzinger (Ecole Polytechnique Fédérale de Lausanne)
    * Kurt Mehlhorn (Max-Planck-Institut für Informatik, Saarbrücken)
    * Noam Nisan (Google, Tel Aviv, and Hebrew University)
    * Christos Papadimitriou (University of California at Berkeley)


    * Submissions: February 10, 2009.
    * Notification: April 6, 2009
    * Final version due: April 27, 2009


Track A

    * Susanne Albers, Univ. of Freiburg (PC chair)
    * Gerth Brodal, Univ. of Aarhus
    * Martin Dyer, Univ. of Leeds
    * Irene Finocchi, Univ. of Rome "La Sapienza"
    * Anna Gal, Univ. of Texas at Austin
    * Naveen Garg, IIT Delhi
    * Raffaele Giancarlo, Univ. of Palermo
    * Andrew Goldberg, Microsoft
    * Mordecai Golin, Hong Kong Univ.
    * Michel Habib, LIAFA, Paris 7
    * Thore Husfeldt, Lund Univ.
    * Kazuo Iwama, Univ. of Kyoto
    * Howard Karloff, AT&T Labs
    * Yishay Mansour, Tel Aviv Univ. and Google
    * Jiri MatouÅ¡ek, Charles Univ. Prague
    * Marios Mavronicolas, Univ. of Cyprus
    * Piotr Sankowski, Univ of Warsaw & ETH Zurich
    * Raimund Seidel, Univ. of Saarbrücken
    * Paul Spirakis, CTI & Univ. of Patras
    * Dorothea Wagner, Univ. of Karlsruhe
    * Peter Widmayer, ETH Zurich
    * Ronald de Wolf, CWI Amsterdam

Track B

    * Albert Atserias,Univ. Politecnica de Catalunya, Barcelona
    * Jos Baeten, Eindhoven Univ. of Technology
    * Gilles Barthe, IMDEA Software, Madrid
    * Mikolaj Bojanczyk, Warsaw Univ.
    * Christian Choffrut, Univ. Denis Diderot, Paris
    * Roberto di Cosmo, Univ. Denis Diderot, Paris
    * Thierry Coquand, Göteborg Univ.
    * Kousha Etessami, Univ. of Edinburgh
    * Kim Guldstrand Larsen, Aalborg Univ
    * Dexter Kozen, Cornell Univ., Ithaca, NY
    * Stephan Kreutzer, Oxford Univ.
    * Orna Kupferman, Hebrew Univ.
    * Dale Miller, Ecole Polytechnique, Palaiseau
    * Markus Müller-Olm, Univ. Münster
    * Anca Muscholl, Univ. Bordeaux 1
    * R. Ramanujam, Inst. of Math. Sciences, Chennai
    * Simona Ronchi Della Rocca, Univ. of Torino
    * Jan Rutten, CWI, Amsterdam
    * Vladimiro Sassone, Univ. of Southampton
    * Peter Sewell, Univ. of Cambridge
    * Howard Straubing, Boston College
    * Wolfgang Thomas, RWTH Aachen Univ. (PC chair)

Track C

    * Hagit Attiya, Technion
    * Andrei Broder, Yahoo
    * Xiaotie Deng, City Univ. of Hong Kong
    * Danny Dolev, Hebrew Univ.
    * Michele Flammini, Univ. of L'Aquila
    * Pierre Fraigniaud, CNRS, Paris
    * Ashish Goel, Univ. of Stanford
    * Matthew Hennessy, Trinity College Dublin
    * Kohei Honda, Univ. of London
    * Elias Koutsoupias, Univ. of Athens
    * Alberto Marchetti Spaccamela, Univ. of Rome "La Sapienza" (PC
    * Yossi Matias, Google and Tel Aviv Univ. (PC co-chair)
    * Silvio Micali, MIT
    * Muthu Muthukrishnan, Google, NY
    * Moni Naor, Weizmann Institute
    * Mogens Nielsen, Univ. of Aarhus
    * Harald Raecke, Univ. of Warwick
    * Jose Rolim, Univ. of Geneva
    * Christian Schindelhauer, Univ. of Freiburg
    * Roger Wattenhofer, ETH Zurich
    * Martin Wirsing, Univ. of Munich


Paul G. Spirakis
Elias Koutsoupias
Christos Kaklamanis


For further information see: http://icalp09.cti.gr/