SYNASC: Symbolic and Numeric Algorithms for Scientific Computing

FacebookTwitterLinkedInGoogle

 

Past:   Proceedings on DBLP

Future:  Post a CFP for 2023 or later   |   Invite the Organizers Email

 
 

All CFPs on WikiCFP

Event When Where Deadline
SYNASC 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 12, 2022 - Sep 15, 2022 Hagenberg, Austria Jun 1, 2022
SYNASC 2021 23th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Dec 7, 2021 - Dec 10, 2021 online and in Timisoara, Romania Jul 31, 2021
SYNASC 2020 22th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 1, 2020 - Sep 4, 2020 online Jul 5, 2020
SYNASC 2019 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 4, 2019 - Sep 7, 2019 Timisoara May 31, 2019
SYNASC 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 20, 2018 - Sep 23, 2018 Timisoara, Romania Jun 24, 2018
SYNASC 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 21, 2017 - Sep 24, 2017 Timisoara Jun 15, 2017
SYNASC 2016 CFP 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing September 24-27, 2016, Timisoara, Romania
Sep 24, 2016 - Sep 27, 2016 Timisoara, Romania Jun 22, 2016 (Jun 10, 2016)
SYNASC 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 22, 2014 - Sep 25, 2014 Timisoara, Romania Jun 30, 2014 (Jun 25, 2014)
SYNASC 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 23, 2013 - Sep 26, 2013 Timisoara Jun 30, 2013 (Jun 23, 2013)
SYNASC 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 26, 2012 - Sep 29, 2012 Timisoara, Romania Jul 1, 2012
SYNASC 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 26, 2011 - Sep 29, 2011 Timisoara, Romania Jun 30, 2011 (Jun 26, 2011)
SYNASC 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Sep 23, 2010 - Sep 26, 2010 Timisoara, Romania May 30, 2010
 
 

Present CFP : 2022

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 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 current scenario where economy and society demand for the development of complex, data intensive, trustable and high performant computational systems.

In this context we invite for

research paper submissions
special session proposals
satellite workshop proposals
tutorial proposals

Submitted research papers must contain original research results and should not be submitted or published elsewhere.

There are 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).
PhD students short papers, describing ongoing work and research challenges of PhD students (up to 4 pages in the two-columns paper style).

*******************************************************************************
List of Topics

SYNASC is organized within six tracks:

Symbolic Computation:
-- computer algebra
-- symbolic analysis
-- symbolic combinatorics
-- symbolic techniques applied to numerics
-- 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

 

Related Resources

CFMAI 2022   2022 4th International Conference on Frontiers of Mathematics and Artificial Intelligence (CFMAI 2022)
ISCAI 2022   2022 4th International Symposium on Computing and Artificial Intelligence (ISCAI 2022)
MDPI mathematics 2022   From Edge Devices to Cloud Computing and Datacenters: Emerging Machine Learning Applications, Algorithms, and Optimizations
ICDM 2022   22nd IEEE International Conference on Data Mining
ICMLA 2022   IEEE International conference on Machine Learning and Applications
IEEE-ADMIT 2022   2022 International Conference on Algorithms, Data Mining, and Information Technology (ADMIT 2022)
FAIML 2022   2022 International Conference on Frontiers of Artificial Intelligence and Machine Learning (FAIML 2022)
ICSC 2023   IEEE International Conference on Semantic Computing
IOP, EI, Scopus-EMECS 2022   2022 International Conference on Electronics, Mechanical Engineering and Computer Science (EMECS 2022)-EI Compendex
ICONIP 2022   29th International Conference on Neural Information Processing-2022