Conference Information

SOSA 2023: Symposium on Simplicity in Algorithms

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Embed deadline badge
SOSA
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:
2022-08-11
Notification Date:
Conference Date:
2023-01-23
Location:
Florence, Italy
Viewed: 22842   Tracked: 0   Attend: 0

Conference Partner Index (CP-I)

51.9 / 100
Ranked #1,210 of 5,682 conferences · Top 22%

#60 of 142 in Theory & Algorithms

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

Inputs used: Acceptance rate: 29.9% (mean of 5 editions on file) · Editions on record: 5 · Researchers who opened this page in the past 24 months: 2

Missing from the public record: 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 65% - 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

SOSA 2023 (Symposium on Simplicity in Algorithms) is an academic conference held in Florence, Italy on 2023-01-23. The paper submission deadline is 2022-08-11.

Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they can serve as benchmarks, as an initialization step, or as the basis for a “state of the art'' algorithm; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems. Papers in all areas of algorithms research are sought. An ideal submission will advance our understanding of an algorithmic problem by, for example, introducing a simpler algorithm, presenting a simpler analysis of an existing algorithm, or offering insights that generally simplify our understanding of important algorithms or computational problems. We are especially interested in papers that make material more accessible to a wider audience, such as undergraduates, or for more specialized topics, general algorithms researchers. Submissions should contain novel ideas or attractive insights, but they are not expected to prove novel theorems. That is, the results themselves can be known, but their presentation must be new. The following meetings will be held jointly: ACM-SIAM Symposium on Discrete Algorithms (SODA23) Algorithm Engineering and Experiments (ALENEX23) SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS23) SIAM Symposium on Simplicity in Algorithms (SOSA23)
Last updated by Dou Sun on

Acceptance Ratio

Average acceptance rate: 29.9% over 5 years (2018–2022).

YearSubmittedAcceptedAccepted(%)
2022562544.6%
2021882629.5%
2020551527.3%
2019682029.4%
2018811518.5%

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
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
IEEE Access3.6IEEE2169-3536
AIEEE Transactions on Dependable and Secure Computing7.5IEEE1545-5971

Comments 0

No comments yet.

Please Login to post a comment