24. April 2026

Max-Planck Forschende veröffentlichen 20 Papers auf der LICS/ICALP 2026

Bild der Pressemitteilung

Logo des MPI-SWS: ©MPI-SWS


Forschende des Max-Planck-Instituts für Softwaresysteme (MPI-SWS), des Max-Planck-Instituts für Informatik (MPI-INF) und des Max-Planck-Instituts für Sicherheit und Privatsphäre (MPI-SP) haben gemeinsam 20 Papers für die Konferenzen LICS 2026 und ICALP 2026 verfasst, zwei der führenden Konferenzen im Bereich der theoretischen Informatik. LICS ist die führende Konferenz zum Thema Logik in der Informatik und ICALP ist die Flaggschiff-Konferenz der Europäischen Vereinigung für Theoretische Informatik.

MPI-SWS Papers:

  1. Automata on S-adic Words. Valérie Berthé, Toghrul Karimov und Mihir Vahanwala (ICALP, Track B)
  2. Hypersequent calculi have Ackermannian upper bounds. A. R. Balasubramanian, Vitor Greati und Revantha Ramanayake (LICS)
  3. Infinite-state games with energy objectives beyond counters. Irmak Saglam und Georg Zetzsche (ICALP, Track B)
  4. On the Subspace Orbit Problem and the Simultaneous Skolem Problem. Piotr Bacik und Anton Varonka (LICS)
  5. On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic. Piotr Bacik, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, Madhavan Venkatesh und Emil Rugaard Wieser (LICS)
  6. Optimally Controlling a Random Population. Hugo Gimbert, Corto Mascle, Patrick Totzke (ICALP, Track B)
  7. Optimal Sequential Flows. Hugo Gimbert, Corto Mascle, Patrick Totzke (ICALP, Track A)
  8. Population Protocols over Ordered Agents. Michael Blondin, Michaël Cadilhac, Benjamin Courchesne, Lucie Guillou, Corto Mascle, and Isa Vialard (ICALP, Track B)
  9. The Complexity of Nested Reset Counter Systems. A. R. Balasubramanian und Franzisco Schmidt (LICS)
  10. The complexity of downward closures of indexed languages. Richard Mandel, Corto Mascle und Georg Zetzsche (LICS)

MPI-SP Papers:

  1. Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions. Gilles Barthe, Minbo Gao, Jam Kabeer Ali Khan, Matthijs Muis, Ivan Renison, Keiya Sakabe, Michael Walter, Yingte Xu, Tianshi Yu und Li Zhou (LICS)

MPI-INF Papers:

  1. A Faster Directed Single-Source Shortest Path Algorithm. Ran Duan, Xiao Mao, Xinkai Shu, Longhui Yin (ICALP, Track A)
  2. Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time. Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis (ICALP, Track A)
  3. Faster algorithms for k-Orthogonal Vectors in low dimension. Anita Dürr, Evangelos Kipouridis, Michael Lampis, Karol Wegrzycki (ICALP, Track A)
  4. Fast decremental tree sums in forests. Benjamin Aram Berendsohn, Marek Sokołowski (ICALP, Track A)
  5. Improved Tree Sparsifiers in Near-Linear Time. Daniel Agassy, Dani Dorfman, Haim Kaplan (ICALP, Track A)
  6. Low Rank MSO. Mikołaj Bojańczyk, Michał Pilipczuk, Wojciech Przybyszewski, Marek Sokołowski und Giannos Stamoulis (LICS)
  7. Node-Weighted Triangles: Faster and Simpler. Shyan Akmal, Nick Fischer (ICALP, Track A)
  8. Permutation Patterns in Streams. Benjamin Aram Berendsohn (ICALP, Track A)
  9. Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes. Anouk Duyster, Tomasz Kociumaka (ICALP, Track A)