[Opt-Net] CfP SOFSEM 2024 - submission server is open

[Ralf Klasing]

49th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2024 in Cochem, Germany: February 19-23, 2024, organized by the University of Trier. 

Homepage: https://www.uni-trier.de/index.php?id=90670&L=2 

SOFSEM has a special focus on Foundations of Computer Science and AI, in particular algorithms, AI-based methods, computational complexity, and formal models. For more information about SOFSEM, we refer to http://www.sofsem.cz/. 

================================================== 
Important Dates 

* August 28th, 2023: abstract deadline (firm) 
* September 1st, 2023: full paper deadline (firm) 
* mid-November, 2023: author notification 

================================================== 
News 

* We welcome submissions of original research in Foundations of Computer Science and AI, formatted using LNCS style: at most 14 pages (including references) plus a clearly marked appendix. Firm abstract deadline: August 28th, 2023, AoE; full papers must be submitted until September 1st, 2023, AoE. The reviewing is single-blind. The Easychair submission server is now open <https://easychair.org/conferences/directory?a=31466484> https://easychair.org/conferences/?conf=sofsem2024. 

* All invited Speakers announced the prospective titles of their talks. 

* SOFSEM 24 proceedings will be published in the ARCoSS subline of LNCS. 

* There will be a Best Paper and a Best Student Paper Award sponsored by Springer. 

================================================== 

Invited Speakers 

* Edith Elkind, Univ. Oxford, UK: Fairness in Multiwinner Voting 
* Sevag Gharibian, Univ. Paderborn, Germany: Quantum algorithms and complexity theory: Does theory meet practice? 
* Rob van Glabbeek, Univ. Edinburgh, UK & Stanford Univ., USA & UNSW, AUS: Modeling Time Qualitatively in Process Algebra and Concurrency Theory 
* Markus L Schmid, HU Berlin, Germany: The Information Extraction Framework of Document Spanners - An Overview of Concepts, Results, and Recent Developments 
* Sandra Zilles, Univ. Regina, Canada: Machine Teaching - A Combinatorial Approach to Machine Learning from Small Amounts of Data 

================================================== 

Program Chairs 

* Henning Fernau, Univ. Trier, Germany 
* Serge Gaspers, UNSW Sydney, Australia 
* Ralf Klasing, CNRS, Univ. Bordeaux, France 

============================== 

List of topics: 

* algorithmic game theory 

* algorithmic learning theory 

* approximation algorithms 

* automata theory 

* coding theory 

* combinatorics, including polyhedral combinatorics 

* complexity theory 

* computational biology 

* computational geometry 

* computational models and computability 

* computational statistics 

* data compression: algorithms and theory 

* database theory 

* discrete structures 

* distributed algorithms 

* formal languages 

* formal methods 

* foundations of artificial intelligence 

* foundations of machine learning 

* games: algorithmic and complexity aspects 

* grammatical inference 

* graph algorithms, including applications like graph drawing 

* graph theory 

* information retrieval 

* information theory 

* kernelization algorithms 

* logic in computer science 

* network science 

* neural networks theory 

* online algorithms 

* quantum algorithms and computing 

* parallel computing 

* parameterized algorithms 

* probabilistic methods 

* randomized algorithms 

* reconfiguration and reoptimization 

* self-organizing systems 

* string algorithms 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/opt-net/attachments/20230803/2fbc47b7/attachment.html>