<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<meta name="GENERATOR" content="MSHTML 11.00.10570.1001"></head>
<body><p>Apologies for the cross postings.)<br>============================================================<br> SYNASC 2023 - First Call for Papers</p><p>25th International Symposium on<br>Symbolic and Numeric Algorithms for Scientific Computing<br>September 11-14, 2023, LORIA in Nancy, France<br><a href="http://synasc.ro/2023">http://synasc.ro/2023</a></p><p>=== Aim ===</p><p>SYNASC aims to stimulate interaction among multiple communities focusing on defining, optimizing and executing complex algorithms in several application areas. The focus of the conference ranges from symbolic and numeric computation to formal methods applied to programming, artificial intelligence, distributed computing and computing theory. The interplay between these areas, in fact, is essential in the<br>current scenario where the economy and society demand for the development of complex, data-intensive, trustable and high-performance computational systems.</p><p>In this context we invite:<br> * research paper submissions<br> * special session proposals<br> * satellite workshop proposals<br> * tutorial proposals</p><p>=== Important Dates ===</p><p>15 March 2023 : Proposals for workshops, special sessions, tutorials <br>15 May 2023 : Paper submission for main tracks<br>15 July 2023 : Notification of acceptance<br>5 September 2023 : Registration<br>5 September 2023 : Revised papers according to the reviews<br>11-14 September 2023: Symposium</p><p>=== Conference format ===</p><p>SYNASC 2023 is planned as in-person conference. However, virtual participation<br>might be a possibility in exceptional situations.</p><p>=== Tracks ===</p><p>* Symbolic Computation<br> + computer algebra<br> + symbolic analysis<br> + symbolic combinatorics<br> + symbolic techniques applied to numerics<br> + hybrid symbolic and numeric algorithms<br> + numerics and symbolics for geometry<br> + programming with constraints, narrowing<br> + applications of symbolic computation to artificial intelligence and vice-versa</p><p>* Numerical Computing<br> + iterative approximation of fixed points<br> + solving systems of nonlinear equations<br> + numerical and symbolic algorithms for differential equations<br> + numerical and symbolic algorithms for optimization<br> + parallel algorithms for numerical computing<br> + scientific visualization and image processing</p><p>* Logic and Programming<br> + automatic reasoning<br> + formal system verification<br> + formal verification and synthesis<br> + software quality assessment<br> + static analysis<br> + timing analysis<br> + automated testing</p><p>* Distributed Computing<br> + modelling of parallel and distributed systems<br> + parallel and distributed algorithms<br> + architectures for parallel and distributed systems. <br> + applications for parallel and distributed systems,<br> + acceleration of AI or Big Data applications using distributed and<br> parallel computing<br> + networked intelligence and Internet of Things</p><p>* Artificial Intelligence<br> + knowledge discovery, representation, and management<br> + automated reasoning, uncertain reasoning, and constraint strategies<br> + recommender and expert systems<br> + intelligent systems, agents, and networks<br> + agent-based complex systems<br> + AI-based systems for scientific computing<br> + machine learning – including deep learning models and technologies<br> + explainable and trustworthy AI<br> + information retrieval, data mining, text mining and web mining<br> + computational intelligence - including fuzzy, neural and evolutionary computing<br> + AI applications: natural language processing, computer vision,<br> signal processing, stock market, computational neuroscience, robotics,<br> autonomous vehicles, medical diagnosis, cybersecurity, digital design,<br> online education, algorithm invention and analysis</p><p>* Theory of Computing<br> + data structures and algorithms<br> + combinatorial optimization<br> + formal languages and combinatorics on words<br> + graph-theoretic and combinatorial methods in computer science<br> + algorithmic paradigms, including distributed, online,<br> approximation, probabilistic, game-theoretic algorithms<br> + computational complexity theory, including structural complexity, boolean<br> complexity, communication complexity, average-case complexity,<br> derandomization and property testing<br> + logical approaches to complexity, including finite model theory<br> + algorithmic and computational learning theory<br> + aspects of computability theory, including computability in<br> analysis and algorithmic information theory<br> + proof complexity<br> + computational social choice and game theory<br> + new computational paradigms: CNN computing, quantum,<br> holographic and other non-standard approaches to computability<br> + randomized methods, random graphs, threshold phenomena and<br> typical-case complexity<br> + automata theory and other formal models, particularly in<br> relation to formal verification methods such as model<br> checking and runtime verification<br> + applications of theory, including wireless and sensor networks,<br> computational biology and computational economics<br> + experimental algorithmics<br> <br>=== Submission ===</p><p>All papers must contain original research results and should not be submitted or published elsewhere. There are four categories of submissions:</p><p>+Regular papers describing fully completed research results (up to 8 pages in the two-columns paper style). </p><p>+System descriptions and experimental papers describing software prototypes, results of simulations, or experimental data analysis, with a link to the reported results (up to 4 pages in the two-columns paper style).<br>+Work in progress papers, describing ongoing work and/or preliminary results (up to 4 pages in the two-columns paper style). </p><p>+Short papers and posters, describing ongoing work and research challenges of PhD students (up to 4 pages in the two-columns paper style).<br>The papers should be submitted electronically through<br> <a href="http://www.easychair.org/conferences/?conf=synasc2023">http://www.easychair.org/conferences/?conf=synasc2023</a> .</p><p>Research papers that are accepted and presented at the symposium will be collected as proceedings published by Conference Publishing Service (CPS) (included in IEEE Xplore) and will be submitted for indexing in ISI Web of Science, DBLP, SCOPUS. For all accepted papers, at least one author is required to register for the conference and present the paper.</p><p>=== Special Sessions ===</p><p>Proposals are invited for special sessions on any topic relevant to the conference. Special sessions are intended to stimulate in-depth discussions in special areas and they are fully integrated into the main conference.<br>A special session for PhD students will be organized to give them an opportunity to present their work to the research community. This is a good venue for students to share their research ideas and results with other students, to obtain feedback from experts with different perspectives and to connect to a network that can be very helpful for their career. MSc students’ submissions are also encouraged. We welcome submissions from any field of computer science research.</p><p>For details see <a href="https://synasc.ro/2023/special-sessions/">https://synasc.ro/2023/special-sessions/</a></p><p>=== Workshops ===</p><p>Proposals for satellite workshops are also invited. The satellite workshops should have topics related to SYNASC but the scientific program of each satellite workshop is managed by the workshop organizers.<br>For details see <a href="https://synasc.ro/2023/workshops/">https://synasc.ro/2023/workshops/</a></p><p>=== Tutorials ===</p><p>Proposals for tutorials are also invited. Tutorials provide fundamental exposure to topics ranging from introductory through intermediate to advanced. The number and the duration of the tutorials will be decided by the tutorial chair under the supervision of the general chair.</p><p>For details see <a href="https://synasc.ro/2023/tutorials/">https://synasc.ro/2023/tutorials/</a> </p><p>=== Committees ==<br> <br> * Steering Committee:<br> + Anca Mirela Andreica, Babes-Bolyai University of Cluj-Napoca, Romania<br> + James Davenport, University of Bath, UK<br> + Tetsuo Ida, University of Tsukuba, Japan<br> + Tudor Jebelean, Johannes Kepler University, Austria<br> + Laura Kovacs, Technical University of Vienna, Austria<br> + Dorel Lucanu, “Alexandru Ioan Cuza” University of Iasi, Romania<br> + Viorel Negru, West University of Timisoara, Romania<br> + Dana Petcu, West University of Timisoara, Romania<br> + Alin Stefanescu, University of Bucharest, Romania<br> + Stephen Watt, University of Waterloo, Canada<br> + Daniela Zaharie, West University of Timisoara, Romania</p><p> * General Chairs:<br> + Viorel Negru, West University of Timisoara, Romania<br> + Daniela Zaharie, West University of Timisoara, Romania</p><p> * Program Chairs:<br> + Sorin Stratulat, Université de Lorraine, France<br> + Mircea Marin, West University of Timisoara, Romania</p><p>-----------<br>SYNASC 2023<br>e-mail: <a href="mailto:contact@synasc.ro">contact@synasc.ro</a>
</p></body>