International Colloquium on Automata, Languages and Programming

Last updated
International Colloquium on Automata, Languages and Programming
AbbreviationICALP
Discipline Theoretical computer science
Publication details
Publisher LIPIcs
History1972–
Frequencyannual (since 1976)
yes

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. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics. [1]

Contents

The ICALP conference series was established by Maurice Nivat, [2] who organized the first ICALP in Paris, France in 1972. The second ICALP was held in 1974, and since 1976 ICALP has been an annual event, nowadays usually taking place in July.

Since 1999, the conference was thematically split into two tracks on "Algorithms, Complexity and Games" (Track A) and "Automata, Logic, Semantics, and Theory of Programming" (Track B), corresponding to the (at least until 2005) two main streams of the journal Theoretical Computer Science. Beginning with the 2005 conference, a third track (Track C) was added in order to allow deeper coverage of a particular topic. From 2005 until 2008, the third track was dedicated to "Security and Cryptography Foundations", and in 2009, it is devoted to the topic "Foundations of Networked Computation: Models, Algorithms and Information Management". Track C was dropped from the 2020 conference, with submissions from these areas invited to submit into Track A. Because of the COVID-19 pandemic, the 2020 conference was also unusual, taking place virtually for the first time (having been originally scheduled to take place in Beijing, China and later moved to Saarbrücken, Germany). [3] ICALP 2021 took place virtually too.

Gödel Prize

The Gödel Prize, a prize for outstanding papers in theoretical computer science and awarded jointly by the EATCS and the ACM SIGACT, is presented every second year at ICALP. Presentation of the prize, which is awarded annually, alternates with the conference STOC (ACM Symposium on Theory of Computing).

See also

Related Research Articles

The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.

<span class="mw-page-title-main">Dagstuhl</span>

Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland.

<span class="mw-page-title-main">European Association for Theoretical Computer Science</span>

The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science.

<span class="mw-page-title-main">Christos Papadimitriou</span> Greek computer scientist (b. 1949)

Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.

DLT, the International Conference on Developments in Language Theory is an academic conference in the field of computer science held annually under the auspices of the European Association for Theoretical Computer Science. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Extended versions of selected papers of each year's conference appear in international journals, such as Theoretical Computer Science and International Journal of Foundations of Computer Science.

DCFS, the International Workshop on Descriptional Complexity of Formal Systems is an annual academic conference in the field of computer science.

<span class="mw-page-title-main">Bitonic tour</span>

In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice.

The Symposium on Theoretical Aspects of Computer Science (STACS) is an academic conference in the field of computer science. It is held each year, alternately in Germany and France, since 1984. Typical themes of the conference include algorithms, computational and structural complexity, automata, formal languages and logic.

Michael Stewart Paterson, is a British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007, and chair of the department of computer science in 2005.

<span class="mw-page-title-main">Susanne Albers</span> German theoretical computer scientist

Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.

The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.

The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.

<span class="mw-page-title-main">Maurice Nivat</span> French computer scientist

Maurice Paul Nivat was a French computer scientist. His research in computer science spanned the areas of formal languages, programming language semantics, and discrete geometry. A 2006 citation for an honorary doctorate (Ph.D.) called Nivat one of the fathers of theoretical computer science. He was a professor at the University Paris Diderot until 2001.

<span class="mw-page-title-main">Ryan Williams (computer scientist)</span> Computer scientist

Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.

<span class="mw-page-title-main">Peter Ružička</span> Slovak scientist

Peter Ružička was a Slovak computer scientist and mathematician who worked in the fields of distributed computing and computer networks. He was a professor at the Comenius University, Faculty of Mathematics, Physics and Informatics working in several research areas of theoretical computer science throughout his long career.

Christopher Umans is a professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.

Thomas Colcombet is a French theoretical computer scientist known for settling major open problems on tree walking automata jointly with Mikołaj Bojańczyk. Colcombet is currently a CNRS Research Director at Paris Diderot University.

References

  1. ↑ Posting by Jeff Erickson, chair of the SoCG steering committee, November 18, 2014, also quoting from an email announcement about ICALP by Luca Aceto, President of the EATCS.
  2. ↑ Rozenberg, Grzegorz; Salomaa, Arto (2002). "ICALP, EATCS and Maurice Nivat". Theoretical Computer Science. 281 (1–2): 25–30. doi: 10.1016/S0304-3975(02)00005-1 .
  3. ↑ Czumaj, Artur; Dawar, Anuj; Merelli, Emanuela (2020). "Front Matter, Table of Contents, Preface, Conference Organization". 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics. Vol. 168. doi:10.4230/LIPIcs.ICALP.2020.0.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.