The Third IFIP International Conference on
Topics in Theoretical Computer Science (TTCS 2020)
Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
July 1-3, 2020
*** Submission Deadline: January 12, 2020 ***
=========================================
------------------------------
Scope
------------------------------
TTCS is a new 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. The proceedings will be
published in 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 co-algebra 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 and its application in
program verification.
------------------------------
Important Dates
------------------------------
- Full Paper Submission: January 12, 2020
- Author notification: March 12, 2020
- Camera-ready paper: April 1, 2020
- Conference: July 1-3, 2020
------------------------------
Submissions
------------------------------
For the main conference, we solicit research papers 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.
The proceedings of TTCS 2020 will be published in the Lecture Notes in
Computer Science (LNCS) series, in accordance with the contract between
Springer Nature Switzerland AG and International Federation for Information
Processing.
Papers should be submitted to the appropriate track through our EasyChair
submission website:
https://www.easychair.org/ </wbr> conferences/?conf=ttcs2020
<https://www.easychair.org/conferences/?conf=ttcs2020> .
------------------------------
Program Committee
------------------------------
Track A: Algorithms and Complexity
- Mohammad Ali Abam, Sharif University of Technology, Iran
<http://sharif.edu/~abam/> (co-chair)
- Sepehr Assadi, Rutgers University, USA
<https://www.cs.rutgers.edu/~sa1497/>
- Mohammad Hossein Bateni, GoogleRresearch, USA
<http://mhbateni.com/academic/>
- Salman Beigy, IPM, Iran <http://math.ipm.ir/~beigi/>
- Hossein Esfandiari, Harvard University, USA
<https://sites.google.com/view/hossein-esfandiari>
- Omid Etesami, IPM, Iran <http://math.ipm.ir/~etesami/>
- Marc van Kreveld, Utrecht University, Netherlands
<http://www.staff.science.uu.nl/~kreve101/>
- Mohammad Mahdian, Google Research, USA
<https://ai.google/research/people/MohammadMahdian>
- Mohammad Mahmoody, University of Virginia, USA
<https://www.cs.virginia.edu/~mohammad/>
- Vahab Mirrokni, Google Research, USA
<https://ai.google/research/people/mirrokni/>
- Gunter Rote, FU Berlin, Germany <http://page.mi.fu-berlin.de/rote/>
- Mohammadreza Salavatipour, University of Alberta, Canada
<https://webdocs.cs.ualberta.ca/~mreza/>
- Masoud Seddighin, IPM, Iran
<https://sites.google.com/view/masoudseddighin/home>
- Saeed Seddighin, Harvard University, USA
<https://sites.google.com/view/saeedrezaseddighin>
- Michiel Smid, Carleton Univesity, Canada
<http://www.scs.carleton.ca/~michiel/>
- Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran
<http://ce.sharif.edu/~zarrabi>
Track B: Logic, Semantics, and Programming Theory
- Farhad Arbab, CWI, The Netherlands <https://homepages.cwi.nl/~farhad/>
- Kyungmin Bae, Pohang University of Science and Technology, South Korea
<http://sevlab.postech.ac.kr/~kmbae/>
- Christel Baier, Technische Universität Dresden, Germany
<https://wwwtcs.inf.tu-dresden.de/~baier/>
- Luis S. Barbosa, University of Minho, Portugal
<http://www4.di.uminho.pt/~lsb/> (co-chair)
- Mário Benevides, Universidade Federal do Rio de Janeiro, Brazil
<https://mariorfb.github.io/>
- Simon Bliduze, INRIA Lille, France <https://www.bliudze.me/simon/>
- Filippo Bonchi, University of Pisa, Italy
<http://scholar.google.com/citations?user=RMy4gDsAAAAJ&hl=en>
- Marcello Bonsangue, University of Leiden, The Netherlands
<http://liacs.leidenuniv.nl/~bonsanguemm/>
- Flavio Corradini University of Camerino, Italy
<http://www.cs.unicam.it/corradini/>
- Fredrik Dahlqvist, UCL, UK
<http://www0.cs.ucl.ac.uk/people/F.Dahlqvist.html>
- Sergey Goncharov, FAU Erlangen-Nürnberg, Germany
<https://www8.cs.fau.de/sergey>
- Hossein Hojjat, Rochester Institute of Technology, USA
<https://www.cs.rit.edu/~hh/>
- Mohammad Izadi, Sharif University of Technology, Iran
<http://ce.sharif.edu/faculty/mohammad-izadi/>
- Sung-Shik Jongmans, Open University, The Netherlands
<https://research.ou.nl/en/persons/sung-shik-jongmans-2/network/>
- Alexander Knapp, University of Augsburg, Germany
<https://www.isse.uni-augsburg.de/en/staff/knapp/>
- Jan Kretinsky, Munich University of Technology, Germany
<https://www7.in.tum.de/~kretinsk/>
- Alexandre Madeira, University of Aveiro, Portugal
<http://alfa.di.uminho.pt/~madeira/>
- Stefan Mitsch, Carnegie Mellon University, USA
<https://www.cs.cmu.edu/~smitsch/>
- Mohammad Reza Mousavi, University of Leicester, UK
<https://www2.le.ac.uk/departments/informatics/people/mohammad-mousavi>
- Renato Neves, INESC TEC, Portugal
<https://www.inesctec.pt/pt/pessoas/renato-jorge-neves>
- Peter Ölveczky, University of Oslo, Norway
<https://folk.uio.no/peterol/>
- Prakash Panangaden, McGill University, Canada
<https://www.cs.mcgill.ca/~prakash/>
- Elaine Pimentel, UFRN, Brazil
<https://sites.google.com/site/elainepimentel/>
- Subodh Sharma, IIT Delhi, India <https://www.cse.iitd.ernet.in/~svs/>
- Pawel Sobocinski, Taltech, Estonia <https://www.ioc.ee/~pawel/>
- Ana Sokolova, University of Salzburg, Austria
<http://cs.uni-salzburg.at/~anas/index.html>
- Carolyn Talcott, Stanford University, USA
<https://www.jlambda.com/clt/>
- Benoit Valiron, LRI, France <https://www.monoidal.net/>
- Naijun Zhan, Chinese Academy of Science, China
<http://lcs.ios.ac.cn/~znj/>
--
Mohammad Ali Abam
Faculty of Computer Engineering
Sharif University of Technology
Iran
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
