会议信息

SOSA 2023: Symposium on Simplicity in Algorithms

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
SOSA
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2022-08-11
通知日期:
会议日期:
2023-01-23
会议地点:
Florence, Italy
浏览: 22836   关注: 0   参加: 0

会伴指数 (CP-I)

51.9 / 100
全站第 1,210 名 / 共 5,682 个会议 · 前 22%

理论与算法 第 60 / 142

学术认可 (35%) 无数据 —— 按中性基准 50 分计入 —
投稿选择性 (20%)
78
会议传承 (20%)
48
社区关注 (10%)
8
资料公开度 (15%)
55

用到的输入: 录用率：29.9%（有记录的 5 届的均值） · 有据可查的届次：5 · 过去 24 个月打开过本页的研究者：2 人

公开资料里还缺: 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 65% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-09-14

征稿

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)
由 Dou Sun 最后更新于

录用率

平均录用率: 29.9% 5 年间 (2018–2022).

年份提交数录用数录用率(%)
2022562544.6%
2021882629.5%
2020551527.3%
2019682029.4%
2018811518.5%

相关会议

相关期刊

CCF全称影响因子出版商ISSN
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

评论 0

暂无评论。

请登录后发表评论