default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th ICTCS 2024: Torino, Italy
- Ugo de'Liguoro, Matteo Palazzo, Luca Roversi:
Proceedings of the 25th Italian Conference on Theoretical Computer Science, Torino, Italy, September 11-13, 2024. CEUR Workshop Proceedings 3811, CEUR-WS.org 2024
Session 1: Computational Models
- Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuit Based Longest Common Substring. 1-15 - Luis Gambarte, Iosif Petrakis:
The Grothendieck Computability Model. 16-28 - Simone Faro, Arianna Pavone, Caterina Viola:
Families of Constant-Depth Quantum Circuits for Rotations and Permutations. 29-41 - Debajyoti Bera, SAPV Tharrmashastha:
Low-Space Quantum Algorithms for Estimate-Mark-Amplify Tasks. 42-65
Session 2: Languages and Computation 1
- Lapo Cioni, Veronica Guerrini, Giovanna Rosone:
The Burrows-Wheeler Transform of an Elastic-Degenerate String. 66-80 - Pierre Popoli, Manon Stipulanti:
On the Pseudorandomness of Parry-Bertrand Automatic Sequences. 81-94 - Giuseppa Castiglione, Sabrina Mantaci, Salvatore Leonardo Pizzuto, Antonio Restivo:
A Comparison Between Similarity Measures Based on Minimal Absent Words: An Experimental Approach. 95-105 - Danilo G. Dolce, Sabrina Mantaci, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
Novel XBWT-based Distance Measures for Labeled Trees. 106-119 - Giuseppa Castiglione, Antonio Restivo:
Completing Wheeler Automata. 120-132
Session 3: Approximation and Complexity
- Michela Ascolese, Andrea Frosini, Simone Rinaldi:
Generation of Skew Convex Polyominoes. 133-145 - Nicola Galesi, Fariba Ranjbar:
The Complexity of Boolean Failure Identification. 146-157 - Alessandro Aloisio:
On Balancing Energy Consumption in Multi-Interface Networks (short paper). 158-165 - Melissa Antonelli, Arnaud Durand, Juha Kontinen:
Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper). 166-172
Session 4: Graphs, Games and Automata
- Christian Ortlieb:
Toward Grünbaum's Conjecture Bounding Vertices of Degree 4. 173-185 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
(t, r)-Broadcast Domination in Networks. 186-199 - Pierre Gaillard, Fabio Patrizi, Giuseppe Perelli:
Strategy Repair for Reachability Games (short paper). 200-205 - Alessandro Aloisio, Michele Flammini, Cosimo Vinci:
Generalized Distance Polymatrix Games (short paper). 206-212 - Federica Adobbati, Luca Bernardinello, Lucia Pomello:
A Two Player Asynchronous Game With Privacy Constraints on Petri Nets (short paper). 213-218 - Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci:
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). 219-224
Session 5: Logic and Formal Methods
- Jan-Georg Smaus:
Proving the Existence of Stable Assignments in Democratic Forking Using Isabelle/HOL. 225-240 - Mauro Milella, Giovanni Pagliarini, Guido Sciavicco, Ionel Eduard Stan:
ModalFP-Growth: Efficient Extraction of Modal Association Rules from Non-Tabular Data. 241-254 - Matteo Palazzo, Luca Paolini, Luca Roversi, Margherita Zorzi:
Host-Core Calculi for Non-classical Computations: A First Insight. 255-268 - Alessandro Aldini:
A Process Algebraic Framework for Multi-Agent Dynamic Epistemic Systems. 269-283 - Federico Bergenti, Leonardo Galliera, Paola Giannini, Stefania Monica, Riccardo Nazzari:
Global Types for Agent Interaction Protocols (short paper). 284-291 - Cosimo Perini Brogi, Rocco De Nicola, Omar Inverso:
Simpson's Proof Systems for Process Verification: A Fine-tuning (short paper). 292-299
Session 6: Languages and Computation 2
- Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Stefano Scafiti:
Improving Sampled Matching through Character Context Sampling. 300-312 - Simone Faro, Domenico Cantone:
A New Directly Accessible Compression Scheme. 313-325 - Massimiliano Goldwurm, Marco Vignati:
Some Properties of the Rate Functions of Large Deviations for Symbol Statistics. 326-339 - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Alexandru Popa:
Maximum Letter-Duplicated Subsequence (short paper). 340-345
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-14 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
