[CPM-SPIRE-L] CFP: SOSA 2025

Nicola Prezza nicola.prezza at unive.it
Thu Jul 4 00:51:38 PDT 2024


We invite submissions to the SIAM Symposium on Simplicity in Algorithms
(SOSA 25). The symposium will take place in New Orleans, Jan 13-14, 2025,
collocated with SODA and ALENEX.

IMPORTANT DATES

Short Abstract Submission and Paper Registration: August 5, 11:59pm
Anywhere on Earth
Submissions received after this time will not be considered.
Full Paper Submission: August 8, 11:59 p.m. Anywhere on Earth

Initial reviews: September 9
Rebuttals due: September 13, 11:59 p.m. Anywhere on Earth
Notifications: early October

Submission link: https://easychair.org/my/conference?conf=sosa25

More information about the conference, program committee and detailed
submission instructions can be found at
https://siam.org/conferences/cm/conference/sosa25

About the conference:

Symposium on Simplicity in Algorithms (SOSA) 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 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 required to prove novel theorems. That is, the results themselves can
be known, but their presentation must be new.

-- 

Nicola Prezza

Associate Professor

Department of Environmental Sciences, Informatics and Statistics


Ca' Foscari University of Venice

Via Torino, 155 - 30170 Mestre, Venezia (VE), Italia

nicola.prezza at unive.it
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://fenris.cs.ucr.edu/pipermail/cpm-spire-l/attachments/20240704/d0a62223/attachment.html>


More information about the CPM-SPIRE-L mailing list