<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<style type="text/css" style="display:none;"><!-- P {margin-top:0;margin-bottom:0;} --></style>
</head>
<body dir="ltr">
<style type="text/css" style="display:none;"><!-- P {margin-top:0;margin-bottom:0;} --></style>
<div id="divtagdefaultwrapper" style="font-size:12pt;color:#000000;font-family:Calibri,Helvetica,sans-serif;" dir="ltr">
<p></p>
<div>==================================================<br>
49th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2024 in Cochem, Germany: February 19-23, 2024.<br>
Homepage: https://www.uni-trier.de/index.php?id=90670&L=2<br>
==================================================<br>
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/. <br>
================================================== <br>
Important Dates<br>
August 28th, 2023: abstract deadline (firm)<br>
September 1st, 2023: full paper deadline (firm)<br>
mid-November, 2023: author notification<br>
==================================================<br>
News<br>
All invited Speakers announced the prospective titles of their talks.<br>
SOFSEM 24 proceedings will be published in the ARCoSS subline of LNCS.<br>
There will be a Best Paper and a Best Student Paper Award sponsored by Springer.<br>
==================================================<br>
Invited Speakers<br>
Edith Elkind, Univ. Oxford, UK: Fairness in Multiwinner Voting<br>
Sevag Gharibian, Univ. Paderborn, Germany: Quantum algorithms and complexity theory: Does theory meet practice?<br>
Rob van Glabbeek, Univ. Edinburgh, UK & Stanford Univ., USA & UNSW, AUS: Modeling Time Qualitatively in Process Algebra and Concurrency Theory<br>
Markus L Schmid, HU Berlin, Germany: The Information Extraction Framework of Document Spanners - An Overview of Concepts, Results, and Recent Developments<br>
Sandra Zilles, Univ. Regina, Canada: Machine Teaching - A Combinatorial Approach to Machine Learning from Small Amounts of Data<br>
==================================================<br>
Program Chairs<br>
Henning Fernau, Univ. Trier, Germany<br>
Serge Gaspers, UNSW Sydney, Australia<br>
Ralf Klasing, CNRS, Univ. Bordeaux, France<br>
==============================<br>
List of topics:<br>
algorithmic game theory<br>
algorithmic learning theory<br>
approximation algorithms<br>
automata theory<br>
coding theory<br>
combinatorics, including polyhedral combinatorics<br>
complexity theory<br>
computational biology<br>
computational geometry<br>
computational models and computability<br>
computational statistics<br>
data compression: algorithms and theory<br>
database theory<br>
discrete structures<br>
distributed algorithms<br>
formal languages<br>
formal methods<br>
foundations of artificial intelligence<br>
foundations of machine learning<br>
games: algorithmic and complexity aspects<br>
grammatical inference<br>
graph algorithms, including applications like graph drawing<br>
graph theory<br>
information retrieval<br>
information theory<br>
kernelization algorithms<br>
logic in computer science<br>
network science<br>
neural networks theory<br>
online algorithms<br>
quantum algorithms and computing<br>
parallel computing<br>
parameterized algorithms<br>
probabilistic methods<br>
randomized algorithms<br>
reconfiguration and reoptimization<br>
self-organizing systems<br>
string algorithms<br>
========================================<br>
<br>
</div>
<br>
<p></p>
</div>
<hr style="display:inline-block;width:98%" tabindex="-1">
<div id="divRplyFwdMsg" dir="ltr"><font face="Calibri, sans-serif" style="font-size:11pt" color="#000000"><b>Von:</b> Fernau, Henning, Univ.-Prof. Dr.<br>
<b>Gesendet:</b> Dienstag, 4. Juli 2023 17:09:16<br>
<b>An:</b> dmanet@zpr.uni-koeln.de; podc-related@listserv.acm.org; cpm-spire-l@lists.cs.ucr.edu; grammarlearning@liste.lis-lab.fr; reconf@lists.uwaterloo.ca; diskrete-mailingliste@mathematik.de; gdnet@graphdrawing.org; compgeom-announce@inria.fr<br>
<b>Betreff:</b> AW: Prepare your papers for SOFSEM 2024</font>
<div> </div>
</div>
<div><style type="text/css" style="display:none;"><!-- P {margin-top:0;margin-bottom:0;} --></style>
<div id="divtagdefaultwrapper" style="font-size:12pt;color:#000000;font-family:Calibri,Helvetica,sans-serif;" dir="ltr">
<p>SORRY: PLEASE IGNORE THE PREVIOUS MESSAGE!</p>
<p><br>
</p>
<p>I forgot some lines in the beginning!</p>
<p><br>
</p>
<p>I will re-send a new message with EVERYTHING.</p>
<p><br>
</p>
<p>Best regards,</p>
<p>Henning<br>
</p>
</div>
<hr style="display:inline-block;width:98%" tabindex="-1">
<div id="divRplyFwdMsg" dir="ltr"><font face="Calibri, sans-serif" style="font-size:11pt" color="#000000"><b>Von:</b> Fernau, Henning, Univ.-Prof. Dr.<br>
<b>Gesendet:</b> Dienstag, 4. Juli 2023 17:04:47<br>
<b>An:</b> dmanet@zpr.uni-koeln.de; podc-related@listserv.acm.org; cpm-spire-l@lists.cs.ucr.edu; grammarlearning@liste.lis-lab.fr; reconf@lists.uwaterloo.ca; diskrete-mailingliste@mathematik.de; gdnet@graphdrawing.org; compgeom-announce@inria.fr<br>
<b>Betreff:</b> Prepare your papers for SOFSEM 2024</font>
<div> </div>
</div>
<div>
<div id="divtagdefaultwrapper" style="font-size:12pt;color:#000000;font-family:Calibri,Helvetica,sans-serif;" dir="ltr">
<p></p>
<div>==================================================<br>
News<br>
All invited Speakers announced the prospective titles of their talks.<br>
SOFSEM 24 proceedings will be published in the ARCoSS subline of LNCS.<br>
There will be a Best Paper and a Best Student Paper Award sponsored by Springer.<br>
==================================================<br>
Invited Speakers<br>
Edith Elkind, Univ. Oxford, UK: Fairness in Multiwinner Voting<br>
Sevag Gharibian, Univ. Paderborn, Germany: Quantum algorithms and complexity theory: Does theory meet practice?<br>
Rob van Glabbeek, Univ. Edinburgh, UK & Stanford Univ., USA & UNSW, AUS: Modeling Time Qualitatively in Process Algebra and Concurrency Theory<br>
Markus L Schmid, HU Berlin, Germany: The Information Extraction Framework of Document Spanners - An Overview of Concepts, Results, and Recent Developments<br>
Sandra Zilles, Univ. Regina, Canada: Machine Teaching - A Combinatorial Approach to Machine Learning from Small Amounts of Data<br>
==================================================<br>
Program Chairs<br>
Henning Fernau, Univ. Trier, Germany<br>
Serge Gaspers, UNSW Sydney, Australia<br>
Ralf Klasing, CNRS, Univ. Bordeaux, France<br>
==============================<br>
List of topics:<br>
algorithmic game theory<br>
algorithmic learning theory<br>
approximation algorithms<br>
automata theory<br>
coding theory<br>
combinatorics, including polyhedral combinatorics<br>
complexity theory<br>
computational biology<br>
computational geometry<br>
computational models and computability<br>
computational statistics<br>
data compression: algorithms and theory<br>
database theory<br>
discrete structures<br>
distributed algorithms<br>
formal languages<br>
formal methods<br>
foundations of artificial intelligence<br>
foundations of machine learning<br>
games: algorithmic and complexity aspects<br>
grammatical inference<br>
graph algorithms, including applications like graph drawing<br>
graph theory<br>
information retrieval<br>
information theory<br>
kernelization algorithms<br>
logic in computer science<br>
network science<br>
neural networks theory<br>
online algorithms<br>
quantum algorithms and computing<br>
parallel computing<br>
parameterized algorithms<br>
probabilistic methods<br>
randomized algorithms<br>
reconfiguration and reoptimization<br>
self-organizing systems<br>
string algorithms<br>
========================================</div>
<br>
<p></p>
</div>
</div>
</div>
</body>
</html>