International Colloquium on Automata, Languages and Programming

International Colloquium on Automata, Languages and Programming

ICALP, the International Colloquium on Automata, Languages and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Its proceedings are published in Springer's Lecture Notes in Computer Science.

Traditionally, the conference was thematically split into two tracks on "Algorithms, Automata, Complexity and Games" (Track A) and Logic, "Semantics, and Theory of Programming" (Track B), corresponding to the (at least until 2005) two mainstreams of the journal Theoretical Computer Science. Beginning with the 2005 conference, a third track was added in order to allow the deeper coverage of a particular topic. From 2005 until 2008, the third track was dedicated to "Security and Cryptography Foundations" (Track C). According to the Bulletin of the European Association for Theoretical Computer Science, beginning with 2009,the third track will be devoted to the topic "Foundations of Modern Networks: Models, Algorithms, and Information Management" (tentative title). [Giorgio Aussiello, Letter from the president. [http://www.eatcs.org/bulletin/beatcs94.pdf Bulletin of the European Association for Theoretical Computer Science, No. 94] , February 2008, pp.3-5.]

External links

* [http://www.informatik.uni-trier.de/~ley/db/conf/icalp/ ICALP proceedings information] from DBLP
* [http://www.ru.is/icalp08/ ICALP 2008] , Reykjavik, Iceland
* [http://july2007.ii.uni.wroc.pl/ ICALP 2007] , Wrocław, Poland
* [http://icalp06.dsi.unive.it/ ICALP 2006] , Venice, Italy
* [http://icalp05.di.fct.unl.pt/ ICALP 2005] , Lisbon, Portugal
* [http://www.math.utu.fi/ICALP04/ ICALP 2004] , Turku, Finland

See also

* The list of computer science conferences contains other academic conferences in computer science.
* The topics of the conference cover the field of theoretical computer science.

References


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • List of computer science conferences — This is a list of academic conferences in computer science. Most of these academic conferences are annual or bi annual events.The order with which the conferences are listed in their respective fields corresponds to a rough and non authoritative… …   Wikipedia

  • Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… …   Wikipedia

  • Automate Cellulaire — À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe !) de l application répétée de cette… …   Wikipédia en Français

  • Automates cellulaires — Automate cellulaire À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe !) de l… …   Wikipédia en Français

  • Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a …   Wikipedia

  • Theoretical computer science — is the collection of topics of computer science that focuses on the more abstract, logical and mathematical aspects of computing, such as the theory of computation, analysis of algorithms, and semantics of programming languages. Although not… …   Wikipedia

  • Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… …   Wikipedia

  • Christos Papadimitriou — Professor Christos Papadimitriou giving a talk at the EPFL on 30 June 2009. Christos Harilaos Papadimitriou (Greek: Χρίστος Χαρίλαος Παπαδημητρίου; born August 16, 1949, Athens) is a Professor in the Computer Science Division at the University of …   Wikipedia

  • Automate cellulaire — À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe) de l application répétée de cette règle… …   Wikipédia en Français

  • Cuckoo hashing — example. The arrows show the alternative location of each key. A new item would be inserted in the location of A by moving A to its alternative location, currently occupied by B, and moving B to its alternative location which is currently vacant …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”