8-11 July 2014
Copenhagen, Denmark
ICALP 2014 Call for Papers
==========================
The 41st International Colloquium on Automata, Languages, and Programming
(ICALP) takes place from Tuesday, 8 July 2014 to Friday, 11 July 2014 at
IT University of Copenhagen, Denmark.
ICALP is the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS). The main conference
is preceded by a series of workshops on Monday, 7 July 2014.
Web site: icalp2014.itu.dk
Local organisation: Thore Husfeldt (chair), ITU
Contact: icalp2014@itu.dk
Important dates
---------------
Submission deadline: Friday, 14 February 2014,
Submission server: www.easychair.org/conferences/?conf=icalp2014
Author notification: Friday, 11 April 2014
Final manuscript due: Monday, 28 April 2014
Early registration: To be announced
Conference: 8 July 2014 to 11 July 2014
Invited speakers
----------------
Sanjeev Arora, Princeton University
Maurice Herlihy, Brown University
Victor Kuncak, EPFL Lausanne
Claire Mathieu, ENS Paris
Proceedings
-----------
ICALP proceedings are published in the Springer-Verlag ARCoSS (Advanced
Research in Computing and Software Science) subseries of LNCS (Lecture
Notes in Computer Science).
Topics
======
Papers presenting original research on all aspects of theoretical computer
science are sought. Typical but not exclusive topics of interest are:
Track A: Algorithms, Complexity and Games
-----------------------------------------
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Randomness in Computation
* Quantum Computing
Track B: Logic, Semantics, Automata and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models
* Automata Theory, Formal Languages
* Emerging and Non-standard Models of Computation
* 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
* E-commerce, Privacy, Spam
* Formal Methods for Network Information Management
* Foundations of Trust and Reputation in Networks
* Algorithms and Models for Mobile and Wireless Networks and Computation
* Models of Complex Networks
* Models and Algorithms for Global Computing
* Network Economics and Incentive-Based Computing Related to Networks
* Models and Algorithms for 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 and Ranking
* Web Mining and Analysis
Submission Guidlines
--------------------
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 prior publication or 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 strongly recommended that submissions
adhere to the specified format and length. Submissions that are clearly
too long may be rejected immediately. Material other than the abstract,
references and the first 12 pages may be considered as supplementary and
will be read at the committee's discretion.
Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference. In order to be
eligible for a best student paper award, a paper should be authored only
by students and should be marked as such upon submission.
Committees
==========
Track A: Algorithms, complexity, and games
------------------------------------------
* Elias Koutsoupias (chair), University of Oxford, United Kingdom
* Dimitris Achlioptas, UC Santa Cruz, USA
* Pankaj Agrawal, Duke University, USA
* Nikhil Bansal, Eindhoven University of Technology, Netherlands
* Gerth Stølting Brodal, Aarhus University, Denmark
* Jean Cardinal, Université libre de Bruxelles, Belgium
* Ning Chen, Nanyang Technological University, Singapore
* Giorgos Christodoulou, University of Liverpool, United Kingdom
* Xiaotie Deng, Shanghai Jiao Tong University, China
* Ilias Diakonikolas, University of Edinburgh, United Kingdom
* Chaled Elbassioni, Masdar Institute, Abu Dhabi
* Amos Fiat, Tel Aviv University, Israel
* Leslie Goldberg, University of Oxford, United Kingdom
* Vipul Goyal, Microsoft, India
* Giuseppe Italiano, University of Rome ?Tor Vergata?, Italy
* Marcin Kaminski, University of Warsaw, Poland
* Haim Kaplan, Tel Aviv University, Israel
* Ioardanis Kerenidis, University of Paris «Diderot», France
* Anna Karlin, University of Washington, USA
* Robert Krauthgamer, Weizmann Institute, Israel
* James Lee, University of Washington, USA
* Ashwin Nayak, University of Waterloo, Canada
* Jared Saia, University of New Mexico, USA
* Piotr Sankowski, University of Warsaw, Poland
* Maria Serna, UP Catalunya, Spain
* Christian Sohler, TU Dortmund, Germany
* Ryan Williams, Stanford, USA
Track B: Logic, semantics, automata and theory of Programming
-------------------------------------------------------------
* Javier Esparza (chair), Technische Universität München
* Paolo Baldan, Dipartimento di Matematica Pura e Applicata, Universita' di Padova
* Michele Boreale, Università di Firenze
* Tomáš Brázdil, Masaryk University
* Véronique Bruyère, University of Mons
* Veronique Cortier, CNRS, Loria
* Anuj Dawar, University of Cambridge
* Kousha Etessami, University of Edinburgh
* Maribel Fernandez, KCL
* David Frutos Escrig, Universidad Complutense
* Pierre Ganty, IMDEA Software Institute
* Peter Habermehl, LIAFA University Paris 7
* Manfred Kufleitner, University of Stuttgart
* S?awomir Lasota, Warsaw University
* Oded Maler, CNRS-VERIMAG
* Sebastian Maneth, NICTA and UNSW
* Madhavan Mukund, Chennai Mathematical Institute
* Jens Palsberg, UCLA
* Thomas Schwentick, Universitt Dortmund
* Sonja Smets, University of Amsterdam
* Jiri Srba, Department of Computer Science, Aalborg University
* Steve Zdancewic, University of Pennsylvania
Track C: Foundations of networked computation:
Models, algorithms and information management
------------------------------------------------------
* Pierre Fraigniaud (chair), CNRS and University Paris Diderot
* Andrea Clementi, Roma Tor Vergata
* Benjamin Doerr, Max-Planck-Institut
* Panagiota Fatourou, University of Crete
* Michal Feldman, Hebrew University of Jerusalem
* Antonio Fernández Anta, Universidad Rey Juan Carlos
* Leszek Gasieniec, University of Liverpool
* Phillip B. Gibbons. Intel Labs
* Magnus Halldorsson, Reykjavik University
* Robert Kleinberg, Cornell
* Anne-Marie Kermarrec, INRIA Rennes
* Michal Koucky, Czech Academy of Sciences
* Gopal Pandurangan, Nanyang Tech. University
* Boaz Patt-Shamir, Tel-Aviv University
* Andrea Pietracaprina
* Andrea Richa, Arizona State University
* Luís Rodrigues, Universidade Técnica de Lisboa
* Christian Scheideler
* Jukka Suomela, University of Helsinki
* Philipp Woelfel, University of Calgary
Workshops
==========
ICALP 2014 hosts a number of workshops on Monday 7 July 2014 at ITU.
Contact the ICALP organisers (icalp2014@itu.dk) if you are interested in
arranging a workshop. Registration, lunches, and rooms are provided by the
ICALP conference organisation.
TOLA (Trends in Online Algorithms) 2014
---------------------------------------
The purpose of this workshop is to bring together researchers interested
in all aspects of online algorithms, including classical competitive
analysis, alternative performance measures, and advice complexity.