ICTCS 2024
Italian Conference on Theoretical Computer Science 2024

Table of Contents

• Preface
  Summary: There were 44 papers submitted for peer-review to this conference. Out of these, 30 papers were accepted for this volume, 20 as regular papers and 10 as short papers.

Invited Talks

• String Diagrams in Computer Science (text not included)
  Pawel Sobocinsky
• Reasoning and Rationality in the Age of Generative AI (textnot included)
  Antonio Lieto

IC-EATCS Best Young researcher

• No-Regret Learning in Bilateral Trade via Global Budget Balance (text not included)
  Federico Fusco

IC-EATCS Best PhD Thesis ex aequo

• Data Compression Meets Automata Theory (text not included)
  Nicola Contumaccio
• Efficient and Accurate Analysis of Two Classes of Transparent Generative Models (text not included)
  Francesca Randone

IC-EATCS Best Master Thesis

• Compressibility Measures for Two-Dimensional Data (text not included)
  Lorenzo Carfagna

Session 1: COMPUTATIONAL MODELS

• Quantum Circuit Based Longest Common Substring 1-15
  Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
• The Grothendieck Computability Model 16-28
  Luis Gambarte, Iosif Petrakis
• Families of Constant-Depth Quantum Circuits for Rotations and Permutations 29-41
  Simone Faro, Arianna Pavone, Caterina Viola
• Low-Space Quantum Algorithms for Estimate-Mark-Amplify Tasks 42-65
  Debajyoti Bera, Tharmashastha SAPV

Session 2: LANGUAGES AND COMPUTATION 1

• The Burrows-Wheeler Transform of an Elastic-Degenerate String 66-80
  Lapo Cioni, Veronica Guerrini, Giovanna Rosone
• On the Pseudorandomness of Parry–Bertrand Automatic Sequences 81-94
  Pierre Popoli, Manon Stipulanti
• A Comparison Between Similarity Measures Based on Minimal Absent Words: An Experimental Approach 95-105
  Giuseppa Castiglione, Sabrina Mantaci, Salvatore Leonardo Pizzuto, Antonio Restivo
• Novel XBWT-based Distance Measures for Labeled Trees 106-119
  Danilo G. Dolce, Sabrina Mantaci, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino
• Completing Wheeler Automata 120-132
  Giuseppa Castiglione, Antonio Restivo

Session 3: APPROXIMATION AND COMPLEXITY

• Generation of Skew Convex Polyominoes 133-145
  Michela Ascolese, Andrea Frosini, Simone Rinaldi
• The Complexity of Boolean Failure Identification 146-157
  Nicola Galesi, Fariba Ranjbar
• On Balancing Energy Consumption in Multi-Interface Networks (short paper) 158-165
  Alessandro Aloisio
• Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper) 166-172
  Melissa Antonelli, Arnaud Durand, Juha Kontinen

Session 4: GRAPHS, GAMES AND AUTOMATA

• Toward Grünbaum’s Conjecture Bounding Vertices of Degree 4 173-185
  Christian Ortlieb
• (t,r)-Broadcast Domination in Networks 186-199
  Gennaro Cordasco, Luisa Gargano, Adele Rescigno
• Strategy Repair for Reachability Games (short paper) 200-205
  Pierre Gaillard, Fabio Patrizi, Giuseppe Perelli
• Generalized Distance Polymatrix Games (short paper) 206-212
  Alessandro Aloisio, Michele Flammini, Cosimo Vinci
• A Two Player Asynchronous Game With Privacy Constraints on Petri Nets (short paper) 213-218
  Federica Adobbati, Luca Bernardinello, Lucia Pomello
• On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) 219-224
  Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci

Session 5: LOGIC AND FORMAL METHODS

• Proving the Existence of Stable Assignments in Democratic Forking Using Isabelle/HOL 225-240
  Jan-Georg Smaus
• ModalFP-Growth: Efficient Extraction of Modal Association Rules from Non-Tabular Data 241-254
  Mauro Milella, Giovanni Pagliarini, Guido Sciavicco, Ionel Eduard Stan
• Host-Core Calculi for Non-classical Computations: A First Insight 255-268
  Matteo Palazzo, Luca Paolini, Luca Roversi, Margherita Zorzi
• A Process Algebraic Framework for Multi-Agent Dynamic Epistemic Systems 269-283
  Alessandro Aldini
• Global Types for Agent Interaction Protocols (short paper) 284-291
  Federico Bergenti, Leonardo Galliera, Paola Giannini, Stefania Monica, Riccardo Nazzari
• Simpson’s Proof Systems for Process Verification: A Fine-tuning (short paper) 292-299
  Cosimo Perini Brogi, Rocco De Nicola, Omar Inverso

Session 6: LANGUAGES AND COMPUTATION 2

• Improving Sampled Matching through Character Context Sampling 300-312
  Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Stefano Scafiti
• A New Directly Accessible Compression Scheme 313-325
  Simone Faro, Domenico Cantone
• Some Properties of the Rate Functions of Large Deviations for Symbol Statistics 326-339
  Massimiliano Goldwurm, Marco Vignati
• Maximum Letter-Duplicated Subsequence (short paper) 340-345
  Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Alexandru Popa

Presented papers, published elsewhere

• Achieving Envy-Freeness Through Items Sale
  Vittorio Bilò, Evangelos Markakis, Cosimo Vinci