SYNASC 2025: Call for Papers

SYNASC aims to stimulate the interaction among multiple communities focusing on defining, optimizing, and executing complex algorithms in several application areas. The focus of the conference then ranges from symbolic and numeric computation to formal methods applied to programming, artificial intelligence, distributed computing, and computing theory. The interplay between these areas is essential in the current scenario where the economy and society demand for the development of complex, data-intensive, trustworthy, and high-performance computational systems.

Submission Types

• Regular papers: describing fully completed research results (up to 8 pages of text, excluding references, in the two-column paper style).
• System descriptions and experimental papers: describing software prototypes, results of simulations, or experimental data analysis, with a link to the reported results (up to 8 pages of text, excluding references, in the two-column paper style).
• Short papers: describing ongoing work, preliminary results and/or research challenges of PhD students (up to 4 pages of text, excluding references, in the two-columns paper style).

Topics

SYNASC is organized into six tracks:

Symbolic Computation

• computer algebra
• symbolic analysis
• symbolic combinatorics
• symbolic techniques applied to numerics
• symbolic regression
• hybrid symbolic and numeric algorithms
• numerics and symbolics for geometry
• programming with constraints, narrowing
• applications of symbolic computation to artificial intelligence and vice-versa

Numerical Computing

• iterative approximation of fixed points
• solving systems of nonlinear equations
• numerical and symbolic algorithms for differential equations
• numerical and symbolic algorithms for optimization
• parallel algorithms for numerical computing
• scientific visualization and image processing

Logic and Programming

• automatic reasoning
• formal system verification
• formal verification and synthesis
• software quality assessment
• static analysis
• timing analysis
• automated testing

Distributed Computing

• modelling of parallel and distributed systems
• parallel and distributed algorithms
• architectures for parallel and distributed systems
• applications for parallel and distributed systems
• acceleration of AI or Big Data applications using distributed and parallel computing
• networked intelligence and Internet of Things

Artificial Intelligence

• knowledge discovery, representation, and management
• automated reasoning, uncertain reasoning, and constraint strategies
• recommender and expert systems
• intelligent systems, agents, and networks
• agent-based complex systems
• AI-based systems for scientific computing
• machine learning – including deep learning models and technologies
• explainable and trustworthy AI
• information retrieval, data mining, text mining, and web mining
• computational intelligence - including fuzzy, neural, and evolutionary computing
• AI applications: natural language processing, computer vision, signal processing, stock market, computational neuroscience, robotics, autonomous vehicles, medical diagnosis, cybersecurity, digital design, online education, algorithm invention and analysis

Theory of Computing

• 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

• Paper submission for main tracks (final deadline): July 6, 2025 (AoE)
• Paper submission for workshops and special sessions (final deadline): July 6, 2025 (AoE)
• Notification of acceptance: July 28, 2025
• Registration: September 12, 2025
• Revised papers according to the reviews: September 12, 2025
• Symposium: September 22-25, 2025

Submission

• Submission Link: https://easychair.org/conferences/?conf=synasc2025
• All submissions must contain original research results and should not have been submitted or published elsewhere.

Publication

SYNASC 2025 post-proceedings will be published by the Conference Publishing Service (CPS) and sent for indexing in Web of Science, Scopus, DBLP.

Venue

The conference will be held at the West University of Timisoara, Romania, blvd. Vasile Pârvan, 4.

Contact Information

All questions about submissions should be emailed to contact@synasc.ro.