============================================================
                 Theory Track at  SYNASC 2018
              20th International Symposium on
     Symbolic and Numeric Algorithms for Scientific Computing
           September 20-23, 2018, Timisoara, Romania
               http://synasc.ro/2018
============================================================
=== Program Commmittee, Theory of Computing  track =====
    Joel D. Day (Kiel)
    Gabriel Istrate (Timisoara, co-chair)
    Florin Manea (Kiel, co-chair)
    Mircea Marin (Timisoara, co-chair)
    Barnaby Martin (Durham)
    Igor Potapov (Liverpool)
    Markus L. Schmid (Trier)
    Henning Schnoor (Kiel)
=== Scope ==========
We invite research submisions in the general area of Theory of
Computing, including the
following (non-exhaustive) list:
    Data Structures and algorithms
    Combinatorial Optimization
    Formal languages and Combinatorics on Words
    Graph-theoretic and Combinatorial methods in Computer Science
    Algorithmic paradigms, including distributed, online,
approximation, probabilistic, game-theoretic algorithms
    Computational Complexity Theory, including structural complexity,
boolean complexity, communication complexity, average-case complexity,
derandomization and property testing
    Logical approaches to complexity, including finite model theory
    Algorithmic and computational learning theory
    Aspects of computability theory, including computability in
analysis and algorithmic information theory
    Proof complexity
    Computational social choice and game theory
    New computational paradigms: CNN computing, quantum, holographic
and other non-standard approaches to computability
    Randomized methods, random graphs, threshold phenomena and
typical-case complexity
    Automata theory and other formal models, particularly in relation
to formal verification methods such as model checking and runtime
verification
    Applications of theory, including wireless and sensor networks,
computational biology and computational economics
    Experimental algorithmics
=== Important Dates ===
24 June 2018 : Paper submission to main tracks (strict deadline)
15 July 2018 : Notification of acceptance
01 September 2018 : Registration
01 September 2018 : Revised papers according to the reviews
20-23 September 2018 : Symposium
30 November 2018 : Final papers for post-proceedings
=== SYNASC Invited Speakers ===
Olivier Bournez, Ecole Politechnique, France
Tetsuo Ida, University of Tsukuba, Japan
Dorel Lucanu, University Alexandru Ioan Cuza, Iasi, Romania
Edwin Lughofer, Johannes Kepler University, Linz, Austria
David Monniaux, University of Grenoble, France
Andrei Voronkov, University of Manchester, UK
=== Tutorials ===
SMT and its Applications to Formal Verification
    – Alessandro Cimatti, Center for Information Technology, Trento, Italy
=== Research Papers ===
Submitted research papers must contain original research results not submitted
and not published elsewhere.
SYNASC has four categories of submissions:
    * Regular papers describing fully completed research results (up to 8 pages
in the two-columns paper style).
    * System descriptions and experimental papers describing implementation
results of experimental data, with a link to the reported results (up to 4
pages in the two-columns paper style).
    * Work in progress papers, describing ongoing work and/or preliminary
results (up to 4 pages in the two-columns paper style).
    * Posters, describing ongoing work and research challenges of PhD students
(up to 2 pages in the two-columns paper style).
Both the abstract and the full paper should be submitted electronically through
http://www.easychair.org/conferences/?conf=synasc2018.
Research papers that are accepted and presented at the symposium will be
collected as post-proceedings published by Conference Publishing Service
(CPS) (included in IEEE Xplore) and will be submitted for indexing in ISI Web
of Science, DBLP, SCOPUS.
**********************************************************
*
*   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
Posts
 
