CAI 2017

Dear colleagues, we are sending this CFP on behalf of the organizers of CAI 2017

Call for Papers

CAI 2017
7th International Conference on Algebraic Informatics June 25-28, 2017 Kalamata, Greece

CAI is the biennial conference serving the community interested in the intersection of theoretical computer science, algebra, and related areas.

CAI 2017 will feature invited presentations and a selective five-track program of contributed papers describing original and unpublished research.

Important Dates

Submission deadline: March 1, 2017, 23:59 PST (Pacific Standard Time) Author notification: April 15, 2017 Early registration deadline: May 15, 2017

Deadlines are firm; late submissions will not be considered.

CAI 2017 General Chair

Ilias Kotsireas, Wilfrid Laurier University, Canada

CAI Steering Committee

Symeon Bozapalidis, Aristotle University of Thessaloniki, Greece Olivier Carton, Universite Paris 7, Denis Diderot, France Manfred Droste, Universitaet Leipzig, Germany Zoltan Esik (deceased), University of Szeged, Hungary Werner Kuich, Technische Universitaet Wien, Austria Dimitrios Poulakis, Aristotle University of Thessaloniki, Greece Arto Salomaa, University of Turku, Finland


The CAI 2017 conference proceedings will be published in electronic form.
Authors of the best papers will be invited to submit a revised version of their work to a Special Issue of Theoretical Computer Science (Elsevier).


Typical but not exclusive topics of interest are:

Track 1: Automata Theory and Logic
Chair: Manfred Droste (Germany)
Invited Speaker: Heiko Vogler (TU Dresden, Germany)
Topics: This includes all topics of theoretical computer science with connections to automata theory and logic in computer science, in the broad sense.
Submissions by e-mail: A PC will select the 10% best submissions for a 'distinguished lecture'.  Authors will receive a confirmation of this and will have more time than the usual talks.

Track 2: Cryptography and Coding Theory
Chairs: Stephane Ballet (France), Dimitrios Poulakis (Greece), Robert Rolland (France) Invited Speaker: Claude Carlet (Universite Paris 8, France)
   - Elliptic Curves Cryptography
   - Lattice Cryptography
   - Cryptanalytic Methods
   - Identity Based Cryptography
   - Symmetric Ciphers
   - Public Keys Cryptosystems
   - Digital Signatures
   - Steganography
   - Quantum Cryptography
   - Cryptographic Protocols
   - Computational Number Theory
   - Boolean Functions
   - Error-Correcting Codes
   - Algebraic-Geometric Codes
   - Code Based Cryptography
   - Quantum Codes
Submissions by e-mail:

Track 3: Computer Algebra
Chairs: Rafael Sendra (Spain), Franz Winkler (Austria) Invited Speaker: Michael Wibmer (University of Pennsylvania, USA)
   - symbolic mathematical computation
   - exact algorithms
   - implementation of symbolic algorithms
   - applications
Submissions by e-mail:

Track 4: Design Theory
Chairs: Lucia Moura (Canada), Dimitris Simos (Austria) Invited Speaker: Charles Colbourn (Arizona State University, USA)
   - algebraic and combinatorial methods in design theory
   - algorithms for construction and classification of designs
   - applications of combinatorial designs in computer science,
   coding theory and information theory
   - complexity problems in design theory 
Submissions by e-mail: ,
Submission instructions: At the bottom of this mail. 

Track 5: Natural and Quantum Computing
Chair: Mika Hirvensalo (Finland)
Invited Speaker: TBA
   - evolutionary algorithms
   - molecular computing
   - neural networks
   - quantum computing
Submissions by e-mail:

For general inquiries regarding CAI 2017, please send e-mail to

Submission Guidelines

Authors are invited to submit papers, presenting original and unpublished research.
Submitted papers should not exceed 25 pages.
Simultaneous submission to other conferences with published proceedings or journals is not allowed.
Submissions should be made to the appropriate track of the conference, by e-mail to the track Chairs.
All proofs omitted due to space constraints should be given in an appendix or made accessible through a reliable link to a freely available electronic preprint.
Instructions for Submissions for the Design Theory Track, CAI 2017:

Authors are invited to submit an extended abstract (up to 6 pages), containing original research results. The authors are responsible for convincing the reviewers of the correctness and interest of their results using only those six pages. Authors can add an optional appendix with proofs, sketches of proofs, or additional material. If included, the appendix will be read at the discretion of the reviewers if required to reach a decision. The appendix has no page limit, and because it will not be published, it cannot be referenced in the extended abstract. Submission of a paper implies that the work described has not been previously published (except in the form of a lecture or academic thesis), that it is not simultaneously submitted elsewhere, and that, if accepted, it will not be published elsewhere in the same form. A special volume of Electronic Notes in Discrete Mathematics (ENDM) will be dedicated to accepted extended abstracts to the Design Theory track of CAI 2017 and the publication date is expected for the second semester of 2018. The extended abstracts must comply with the ENDM LaTeX style and are limited to 6 pages, including the front matter, text, and references. Instructions for submission preparation may be obtained in the ENDM web page Once prepared, the paper should be submitted by e-mail to the Design Theory track chairs using BOTH the email addresses below:

NOTE: The publication of the extended abstract in the Design Theory track
(ENDM) is independent and complementary to a possible submission of full papers to the volume of Theoretical Computer Science dedicated to best papers among all tracks of CAI 2017.


Popular posts from this blog

Conference announcement: FQ15 13-17 June 2022, Aubervilliers, France

Dr Marston Conder awarded the 2020 Euler Medal of the ICA

The Combinatorics 2018 conference June 3 to 9, 2018 in Arco, Province of Trento, Italy