The Third IFIP International Conference on
Topics in Theoretical Computer Science (TTCS 2020)
http://cs.ipm.ac.ir/ttcs/2020
Institute for Research in Fundamental Sciences (IPM)
Tehran, Iran, July 1-3, 2020
*** Deadline Extension: February 16, 2020 ***
*** NEW - Invited Speakers ***
Mohammad Taghi Hajiaghayi, University of Maryland, USA (Track A)
Filippo Bonchi, University of Pisa, Italy (Track B)
==================================================
------------------------------
Scope
------------------------------
TTCS is a bi-annual conference series, intending to serve as a forum
for novel and high-quality research in all areas of Theoretical
Computer Science. The conference is held in cooperation with the
European Association for Theoretical Computer Science (EATCS). The
proceedings will be published in the Springer LNCS series.
TTCS is organized in 2 tracks. Topics of interest include but are not
limited to:
Track A: Algorithms and Complexity
- algorithms and data structures,
- algorithmic coding theory,
- algorithmic graph theory and combinatorics,
- approximation algorithms,
- computational complexity,
- computational geometry,
- computational learning theory,
- economics and algorithmic game theory,
- fixed-parameter algorithms,
- machine learning,
- optimization,
- parallel and distributed algorithms,
- quantum computing,
- randomness in computing,
- theoretical cryptography.
Track B: Logic, Semantics, and Programming Theory
- algebra and coalgebra in computer science,
- concurrency theory,
- coordination languages,
- formal verification and model-based testing,
- logic in computer science,
- methods, models of computation and reasoning for embedded, hybrid,
and cyber-physical systems,
- stochastic and probabilistic specification and reasoning,
- theoretical aspects of other CS-related research areas,
e.g. computational science, databases, information retrieval, and
networking,
- theory of programming languages,
- type theory.
------------------------------
Important Dates
------------------------------
- Full Paper Submission: February 16, 2020
- Author notification: April 12, 2020
- Camera-ready paper: May 1, 2020
- Conference: July 1-3, 2020
------------------------------
Submissions
------------------------------
Research papers are solicited in all areas of theoretical computer
science. All papers will undergo a rigorous review process and will be
judged based on their originality, soundness, significance of the
results, and relevance to the theme of the conference.
Papers should be written in English. Research papers should not exceed
15 pages in the LNCS style format. All technical details necessary for
a proper evaluation of a submission must be included in the submission
or in a clearly-labeled appendix, to be consulted at the discretion of
program committee members. Multiple and/or concurrent submission to
other scientific venues is not allowed and will result in rejection as
well as notification to the other venue. Any case of plagiarism
(including self-plagiarism from earlier publications) will result in
rejection as well as notification to the authors' institutions.
TTCS 2020 proceedings will be published by Springer, in the Lecture
Notes in Computer Science series, in accordance to the contract
between Springer Nature Switzerland AG and the International
Federation for Information Processing (IFIP).
Papers should be submitted to the appropriate track through EasyChair
at
https://easychair.org/conferences/?conf=ttcs2020
------------------------------
Programme Committee
------------------------------
Track A: Algorithms and Complexity
Mohammad Ali Abam, Sharif University of Technology, Iran (PC co-chair)
Sepehr Assadi, Rutgers University, USA
Mohammad Hossein Bateni, GoogleRresearch, USA
Salman Beigy, IPM, Iran
Hossein Esfandiari, Harvard University, USA
Omid Etesami, IPM, Iran
Marc van Kreveld, Utrecht University, Netherlands
Mohammad Mahdian, Google Research, USA
Mohammad Mahmoody, University of Virginia, USA
Vahab Mirrokni, Google Research, USA
Gunter Rote, FU Berlin, Germany
Mohammadreza Salavatipour, University of Alberta, Canada
Masoud Seddighin, IPM, Iran
Saeed Seddighin, Harvard University, USA
Michiel Smid, Carleton Univesity, Canada
Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran
Track B: Logic, Semantics, and Programming Theory
Farhad Arbab, CWI, The Netherlands
Kyungmin Bae, Pohang University of Science and Technology, South Korea
Christel Baier, Technische Universitat Dresden, Germany
Luis S. Barbosa, University of Minho, Portugal (PC co-chair)
Mario Benevides, Universidade Federal do Rio de Janeiro, Brazil
Simon Bliduze, INRIA Lille, France
Filippo Bonchi, University of Pisa, Italy
Marcello Bonsangue, University of Leiden, The Netherlands
Flavio Corradini University of Camerino, Italy
Fredrik Dahlqvist, UCL, UK
Sergey Goncharov, FAU Erlangen-Nurnberg, Germany
Hossein Hojjat, Rochester Institute of Technology, USA
Mohammad Izadi, Sharif University of Technology, Iran
Sung-Shik Jongmans, Open University, The Netherlands
Alexander Knapp, University of Augsburg, Germany
Jan Kretinsky, Munich University of Technology, Germany
Alexandre Madeira, University of Aveiro, Portugal
Stefan Mitsch, Carnegie Mellon University, USA
Mohammad Reza Mousavi, University of Leicester, UK
Renato Neves, INESC TEC, Portugal
Peter Olveczky, University of Oslo, Norway
Prakash Panangaden, McGill University, Canada
Elaine Pimentel, UFRN, Brazil
Subodh Sharma, IIT Delhi, India
Pawel Sobocinski, Taltech, Estonia
Ana Sokolova, University of Salzburg, Austria
Carolyn Talcott, Stanford University, USA
Benoit Valiron, LRI, France
Naijun Zhan, Chinese Academy of Science, China
Link to the online cfp: https://easychair.org/cfp/TTCS2020
S.BARRY COOPER PRIZE 2020 CALL FOR NOMINATIONS
A Call for Nominations for the S.Barry Cooper Prize is now open.
Nominations for the award should be submitted by email to the Award
Committee Chair
ANUJ DAWAR (UNIVERSITY OF CAMBRIDGE)
ANUJ.DAWAR(a)CL.CAM.AC.UK
Any emails and related messages should have the subject line starting
with "S. Barry Cooper Prize 2020".
To be considered, nominations for the 2020 Prize must be received by
17 JANUARY, 2020.
A nomination package should include:
1. A statement of motivation for awarding the prize to the nominee,
including: the nominee's outstanding results, their seminal and lasting
theory building and/or exceptional service to the research communities,
as the case may be.
These should be supported by at least one of
- A list of the most important publications, accompanied by a brief
summary of the technical content of the papers and a brief explanation
of their significance. Where possible, this should include pointers to
online versions of the publications.
- A statement explaining the role played and the exceptional services
rendered by the nominee, in the research communities involved in
computability and related areas.
2. A support letter or letters signed by at least two members of the
scientific community.
The nomination package must be in English, but it may include reference
to publications in other languages.
SELECTION PROCESS
The Award Committee is solely responsible for the selection of the
winner of the award. All matters relating to the selection process that
are not specified here are left to the discretion of the Award
Committee, whose decision will be final.
ACKERMANN AWARD 2020 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
CALL FOR NOMINATIONS
Nominations are now invited for the 2020 Ackermann Award.
PhD dissertations in topics specified by the CSL and LICS
conferences, which were formally accepted as PhD theses at a
university or equivalent institution between 1.1.2018 and 31.12.2019
are eligible for nomination for the award.
The deadline for submission
is 1 April 2020. Submission details follow below.
Nominations can be submitted from 1 January 2020 and should be sent
to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de
*** The Award
The 2020 Ackermann award will be presented to the recipient(s) at CSL
2021, the annual conference of the EACSL.
The award consists of
* a certificate,
* an invitation to present the thesis at the CSL conference,
* the publication of the laudatio in the CSL proceedings, and
* financial support to attend the conference.
The jury is entitled to give the award to more (or less) than one
dissertation in a year.
*** The Jury
The jury consists of:
* Christel Baier (TU Dresden);
* Michael Benedikt (Oxford University);
* Mikolaj Bojanczyk (University of Warsaw);
* Jean Goubault-Larrecq (ENS Paris-Saclay);
* Prakash Panangaden (McGill University);
* Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL;
* Thomas Schwentick (TU Dortmund) , the president of EACSL;
* Alexandra Silva, (University College London), ACM SigLog representative.
*** How to submit
The candidate or his/her supervisor should submit
1. the thesis (ps or pdf file);
2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file);
3. a supporting letter by the PhD advisor and two supporting letters
by other senior researchers (in English);
supporting letters can also be sent directly to Thomas Schwentick
(thomas.schwentick(a)tu-dortmund.de);
4. a short CV of the candidate;
5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period.
The submission should be sent by e-mail as attachments to the chairman
of the jury, Thomas Schwentick:
thomas.schwentick(a)tu-dortmund.de
With the following subject line and text:
* Subject: Ackermann Award 20 Submission
* Text: Name of candidate, list of attachments
Submission can be sent via several e-mail messages. If this is the case,
please indicate it in the text.
* *QONFEST 2020* *
August 31-September 5, 2020, Vienna, Austria
(http://qonfest2020.conf.tuwien.ac.at/)
QONFEST is the umbrella conference comprising the joint international 2020
meetings CONCUR (31st International Conference on Concurrency Theory), QEST
(17th International Conference on Quantitative Evaluation of SysTems),
FORMATS (18th International Conference on Formal Modeling and Analysis of
Timed Systems) and FMICS (25th International Conference on Formal Methods
for Industrial Critical Systems). QONFEST 2020 will be hosted at TU Wien,
Vienna, Austria, with the conferences taking place in the main building at
Karlsplatz 13, 1040 Wien, and the workshops in the computer science building
at Favoritenstr. 911, 1040 Wien.
CALL FOR AFFILIATED WORKSHOPS
Researchers and practitioners are invited to submit proposals for workshops
to be affiliated to QONFEST 2020. Example topics include: concurrency theory
and its applications, timed systems, semantics, logics, verification
techniques, cross-fertilization between industry and academia and
opportunities for young and prospective researchers. Past QONFEST
conferences have been accompanied by successful workshops on a variety of
topics. You can have an idea of the past workshops by browsing the pages of
the previous editions of CONCUR, QEST, FORMATS and FMICS.
The purpose of the workshops is to provide participants with a friendly,
interactive atmosphere for presenting novel ideas and discussing their
application.
The workshops take place on Monday August 31, 2020 and Saturday September 5,
2020.
Proposals should include:
* The name and the preferred date of the proposed workshop (August 31 or
September 5, 2020)
* A short description of the workshop (500 words max)
* If applicable, a description of past versions of the workshop, including
dates, organizers, submission and acceptance counts, and attendance
* The expected number of participants
* The name and a link to the website(s) of the organizer(s)
* The publication plan (only invited speakers, no published proceedings,
pre-/post-proceedings published with EPTCS/ENTCS/...).
The QONFEST organization offers:
* a link from the QONFEST web site;
* setup of meeting space, and related equipment,
* coffee-breaks and lunch for the participants on the day of the workshop,
* on-line and on-site registration to the workshop,
* free workshop registration for an organizer and in case of more than 15
participants a second free workshop registration
The main responsibility for organizing the workshop goes to the workshop
organizer(s), including:
* workshop publicity (possibly including call for papers, submission and
review process)
* scheduling of workshop activities in collaboration with the QONFEST
workshop chair.
IMPORTANT DATES
Submission of workshop proposals: January 15, 2020 (but we greatly
appreciate if you announce your proposal to us as soon as possible).
Notification: January 31, 2020
SUBMISSION TO: Florian Zuleger (zuleger at forsyte dot at)
For more information, please contact me via email.
The QONFEST 2020 workshop chair,
Florian Zuleger
https://forsyte.at/people/zuleger/
Technische Universität Wien
Vienna, Austria
The Gödel Prize 2020 - Call for Nominations
Deadline: February 15, 2020
The Gödel Prize for outstanding papers in the area of theoretical
computer science is sponsored jointly by the European Association for
Theoretical Computer Science (EATCS) and the Association for Computing
Machinery, Special Interest Group on Algorithms and Computation Theory
(ACM SIGACT). The award is presented annually, with the presentation
taking place alternately at the International Colloquium on Automata,
Languages, and Programming (ICALP) and the ACM Symposium on Theory of
Computing (STOC). The 28th Gödel Prize will be awarded at the 47th
International Colloquium on Automata, Languages, and Programming to be
held during 8-12 July, 2020 in Beijing. The Prize is named in honour
of Kurt Gödel in recognition of his major contributions to
mathematical logic and of his interest, discovered in a letter he
wrote to John von Neumann shortly before von Neumann’s death, in what
has become the famous “P versus NP” question. The Prize includes an
award of USD 5,000.
Award Committee: The 2020 Award Committee consists of Samson Abramsky
(University of Oxford), Anuj Dawar (Chair, University of Cambridge),
Joan Feigenbaum (Yale University), Robert Krauthgamer (Weizmann
Institute), Daniel Spielman (Yale University) and David Zuckerman
(University of Texas, Austin).
Nominations: Nominations for the award should be submitted by email to
the Award Committee Chair: anuj.dawar(a)cl.cam.ac.uk. Please make sure
that the Subject line of all nominations and related messages begin
with “Goedel Prize 2020.” To be considered, nominations for the 2020
Prize must be received by February 15, 2020.
Those intending to submit a nomination should contact the Award
Committee chair by email well in advance to discuss it.
For full details on eligibility and requirements, please see
http://eatcs.org/index.php/goedel-prizehttp://www.sigact.org/prizes/gödel.html
or contact the Award Committee chair, Anuj Dawar <anuj.dawar(a)cl.cam.ac.uk>
--
Anuj.Dawar(a)cl.cam.ac.uk
Professor of Logic and Algorithms
Department of Computer Science and Technology
University of Cambridge Phone: +44 1223 334408
15 J.J. Thomson Avenue Fax: +44 1223 334678
Cambridge CB3 0FD, UK. http://www.cl.cam.ac.uk/users/ad260
PhD position in Theoretical Computer Science at HU Berlin
The logic and complexity group at HU Berlin lead by
Prof. Dr. Christoph Berkholz is looking for a PhD
candidate in theoretical computer science.
* Details: https://hu.berlin/luk-vacancies
* Apply by: January 23, 2020
* Starting date (expected): April 2020
The ideal candidate holds or will soon receive an excellent master's
degree in computer science or mathematics and has a strong background
in theoretical computer science with a specialisation in at least one
research field covered by the group, for example, knowledge
compilation, constraint satisfaction, finite model theory, database
theory, or proof complexity. The successful applicant is expected to
carry out research in the Emmy-Noether project "Representation
Complexity of Enumeration and Counting Algorithms" led by Christoph
Berkholz.
The position is fully funded for initially 2,5 years with the
possibility of extension and has no formal teaching obligations. The
expected starting date is April 2020. For informal inquiries do not
hesitate to contact Christoph Berkholz (berkholz(a)informatik.hu-berlin.de).
Applications (in German or English) should include:
- 1-2 page letter of motivation describing the interest in the position
and the background in theoretical computer science
- CV
- bachelor's and master's degree certificate (if available at the time
of application) as well as a list of taken courses with grades
- a copy of the master thesis and publications (if applicable)
- name and mail address of one or two references that are able and
willing to provide a letter of recommendation (ideally including the
master thesis advisor)
To obtain full consideration, send your application material referring
to Kennziffer DR/240/19 by January 23, 2020 in a single PDF file (plus
additional files for thesis/publications) to Prof. Dr. Christoph
Berkholz (berkholz(a)informatik.hu-berlin.de).
HU is seeking to increase the proportion of women in research and
teaching, and specifically encourages qualified female scholars to
apply. Severely disabled applicants with equivalent qualifications
will be given preferential consideration. People with an immigration
background are specifically encouraged to apply.
--
Prof. Dr. Christoph Berkholz
Tel: +49 30 2093 3079
Fax: +49 30 2093 3081
Email: berkholz(a)informatik.hu-berlin.de
Url: http://www.informatik.hu-berlin.de/~berkhoch
Postanschrift / Postal address:
Institut für Informatik
Humboldt-Universität zu Berlin
Unter den Linden 6
10099 Berlin
Germany
Special Session on Natural Language and Argumentation 2020 (NLA'20) at
DCAI'20
https://www.dcai-conference.net/special-sessions/nla20
at:
17th International Conference on Distributed Computing and Artificial
Intelligence
L'Aquila, Italy, 17-19 June 2020
https://www.dcai-conference.net
Scope
We are in the reality of natural and computational systems of argumentation
provided by reasoning, with natural and artificial languages. Intelligent
systems of argumentation target advanced methods for exchanging, saving,
reasoning, accessing, and updating information in memory. The special
session on Natural Language and Argumentation (NLA) covers theories and
applications. Formal models of argumentation like the Dung framework assume
that natural language arguments have properly been mapped to logical
formulas or partial proofs. Argument mining, when mainly working with
existing machine learning methods, encounters difficulties to properly
analyse arguments and relations between arguments, over general data, and
especially when natural language expressions involve logical constructions.
On the other side, traditional methods map sentences to logical formulas,
which can be available after having been handled by a theorem prover. E.g.,
categorial analyses yield discourse representation structures, by using a
parser (like Boxer, or Grail), and theorem provers (e.g., Coq) handle
corresponding logical representations. The first two approaches (the Dung
framework, and typical argument mining) suffer from the lack of development
of the relations between natural language texts and dialogues, and do not
handle the logical structure of meanings, while the third one (the
predominant, traditional logical approach) is limited by the lack of
sophisticated semantic lexicon for encompassing the logical structure
carried by some words, and interconnections with other methods.
Topics
We welcome submissions on the following topics, without limiting to them,
across approaches, methods, theories, implementations, and applications, in
support of argumentation:
- Formal models of argumentations (e.g., Dung's framework)
- Logic of preferences
- Argument mining
- Theorem provers and assistants
- Model checkers
- Theory of computation
- Theory of information
- Natural language inference
- Beliefs, attitudes, persuasions - theories and applications
- Formal languages in support of reasoning and argumentation
- Algorithms related to natural language and argumentation - theories,
implementations, applications
- Mapping NL expressions into logical representations
- Syntactic and semantic analyses of natural language
- Computational methods to natural language - approaches, theories
- Computational syntax, semantics, and/or interfaces between them
- NLP argument mining
- Ambiguity and underspecification in syntax and semantics
- Discourse and context dependency
- Reasoning with ambiguity and underspecification
- Interactive computation, reasoning, argumentation
- Computation with heterogeneous information
- Reasoning with heterogeneous and/or inconsistent information
- Dialog, interactions
- Interdisciplinary approaches to language, computation, reasoning, memory,
relevant for argumentation
- Argumentation in AI applications: e.g., to business, economy, justice,
health, medical sciences
- ...
Important Dates
Paper submission deadline: 31 January, 2020
Notification of acceptance: 09 March, 2020
Camera-Ready papers due: 30 March, 2020
Conference: 17-19 June, 2020
Paper Submission
https://www.dcai-conference.net/special-sessions
All papers must be formatted according to the AISC, Springer, template,
with a maximum length of 8 pages, including figures and references.
All proposed papers must be submitted in electronic form (PDF format) using
the DCAI 2020 conference management system:
https://www.dcai-conference.net/submission
Publication
At least one of the authors will be required to register and attend the
symposium to present the paper in order to include the paper in the
conference proceedings. All accepted and presented papers will be published
by the Advances in Intelligent Systems and Computing, AISC, Springer Verlag.
Organizing Committee
Stergios Chatzikyriakidis,
University of Gothenburg, Sweden
Emiliano Lorini,
CNRS, IRIT, France
Roussanka Loukanova,
Stockholm University, Sweden; and, Institute of Mathematics and
Informatics, Bulgarian Academy of Sciences, Bulgaria
Richard Moot,
LIRMM-CNRS, Montpellier, France
Christian Retoré,
Université de Montpellier and LIRMM-CNRS, Montpellier, France
Contact
Roussanka Loukanova (rloukanova the special symbol gmaildotcom)
-------------------------------------------------------------