Conference Information

SYNASC 2021: International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Embed deadline badge
SYNASC
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2021-08-31
Notification Date:
2021-09-30
Conference Date:
2021-12-07
Location:
Timisoara, Romania
Years:
23
Viewed: 26552   Tracked: 0   Attend: 0

Conference Partner Index (CP-I)

49.4 / 100
Ranked #1,702 of 5,682 conferences · Top 30%

#76 of 142 in Theory & Algorithms #165 of 341 in Systems & Architecture

Academic recognition (35%) No data - scored at the neutral baseline of 50 —
Submission selectivity (20%) No data - scored at the neutral baseline of 50 —
Editions held (20%)
86
Community attention (10%)
10
Public record completeness (15%)
25

Inputs used: Editions on record: 23 · Researchers who opened this page in the past 24 months: 3

Missing from the public record: Historical acceptance rates (+4.5) · Past editions (+3.0) · Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 45% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-14

Call For Papers

SYNASC 2021 (International Symposium on Symbolic and Numeric Algorithms for Scientific Computing) is an academic conference held in Timisoara, Romania on 2021-12-07. The paper submission deadline is 2021-08-31. Acceptance notifications are sent on 2021-09-30.

=== Tracks === * Symbolic Computation + computer algebra + symbolic techniques applied to numerics + hybrid symbolic and numeric algorithms + numerics and symbolics for geometry + programming with constraints, narrowing * 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 * 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 * 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 * 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
Last updated by Dou Sun on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Journal of Scientific Computing3.3Springer0885-7474
Scientific Data6.9Springer2052-4463
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203

Comments 0

No comments yet.

Please Login to post a comment