Set-Theoretic Reductions of Hilbert's Tenth Problem. - Domenico Cantone; Vincenzo Cutello; Alberto Policriti (CSL, 1989)

Truth Tables for a Combinatorial Kernel of Set Theories. - Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti (ECAI, 1990)

The Automation of Syllogistic. - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (J. Autom. Reason., 1990)

On a generalization of Herbrand's theorem. - Alberto Policriti (1990)

Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability. - Franco Parlamento; Alberto Policriti (J. Autom. Reason., 1991)

Expressing Infinity Without Foundation. - Franco Parlamento; Alberto Policriti (J. Symb. Log., 1991)

The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation. - Franco Parlamento; Alberto Policriti (Math. Log. Q., 1992)

Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica? - Eugenio G. Omodeo; Alberto Policriti; Gianfranco Rossi (GULP, 1993)

Decision Procedures for Set/Hyperset Contexts. - Eugenio G. Omodeo; Alberto Policriti (DISCO, 1993)

A Derived Algorithm for Evaluating varepsilon-Expressions over Abstract Sets. - Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti (J. Symb. Comput., 1993)

Solving Systems of Equations over Hypersets. - Agostino Dovier; Eugenio G. Omodeo; Alberto Policriti; Gianfranco Rossi (GULP-PRODE (1), 1994)

A Set-Theoretic Translation Method for (Poly)modal Logics. - Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (STACS, 1995)

A Set-Theoretic Translation Method for Polymodal Logics. - Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (J. Autom. Reason., 1995)

T-Theorem Proving I. - Alberto Policriti; Jacob T. Schwartz (J. Symb. Comput., 1995)

Integrating Lists, Multisets, and Sets in a Logic Programming Framework. - Agostino Dovier; Alberto Policriti; Gianfranco Rossi (FroCoS, 1996)

Complementation in the lattice of equivalence relations. - Dikran Dikranjan; Alberto Policriti (Discret. Math., 1996)

Decidability of ∃*∀-Sentences in Membership Theories. - Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti (Math. Log. Q., 1996)

Decidability Results for Metric and Layered Temporal Logics. - Angelo Montanari; Alberto Policriti (Notre Dame J. Formal Log., 1996)

On T Logic Programming. - Agostino Dovier; Andrea Formisano 001; Alberto Policriti (APPIA-GULP-PRODE, 1997)

Set domains for structural properties of terms. - Agostino Dovier; Alberto Policriti (APPIA-GULP-PRODE, 1997)

A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics. - Angelo Montanari; Alberto Policriti (IJCAI (1), 1997)

Modal Deduction in Second-Order Logic and Set Theory - I. - Johan van Benthem; Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (J. Log. Comput., 1997)

A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms. - Agostino Dovier; Alberto Policriti; Gianfranco Rossi (Fundam. Informaticae, 1998)

Modal Deduction in Second-Order Logic and Set Theory - II. - Johan van Benthem; Giovanna D'Agostino; Angelo Montanari; Alberto Policriti (Stud Logica, 1998)

Comparing expressiveness of set constructor symbols. - Agostino Dovier; Carla Piazza; Alberto Policriti (APPIA-GULP-PRODE, 1999)

Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case. - Agostino Dovier; Eugenio G. Omodeo; Alberto Policriti (Appl. Algebra Eng. Commun. Comput., 1999)

Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability. - Angelo Montanari; Adriano Peron; Alberto Policriti (Log. J. IGPL, 1999)

Editorial. - Angelo Montanari; Alberto Policriti; Yde Venema (Log. J. IGPL, 1999)

T-Resolution: Refinements and Model Elimination. - Andrea Formisano 001; Alberto Policriti (J. Autom. Reason., 1999)

Supporting automated deduction in first-order modal logics. - Angelo Montanari; Alberto Policriti; Matteo Slanina (KR, 2000)

Derivability in Locally Quantified Modal Logics via Translation in Set Theory. - Angelo Montanari; Alberto Policriti; Matteo Slanina (MFCS, 2000)

Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory. - Carla Piazza; Alberto Policriti (TABLEAUX, 2000)

The Taming (Timing) of the States. - Angelo Montanari; Adriano Peron; Alberto Policriti (Log. J. IGPL, 2000)

Deciding modal logics using tableaux and set theory. - Carla Piazza; Alberto Policriti (APPIA-GULP-PRODE, 2001)

A Fast Bisimulation Algorithm. - Agostino Dovier; Carla Piazza; Alberto Policriti (CAV, 2001)

AppART: An ART Hybrid Stable Learning Neural Network for Universal Function Approximation. - Luis Marti; Alberto Policriti; Luciano Garcia (HIS, 2001)

Modeling concurrent systems specified in a temporal concurrent constraint language-I. - Moreno Falaschi; Alberto Policriti; Alicia Villanueva (APPIA-GULP-PRODE, 2001)

Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (Springer, 2001)

Automation of Aggregate Theories: The Cornerstones of Equational Expressibility. - Andrea Formisano 001; Eugenio G. Omodeo; Alberto Policriti (APPIA-GULP-PRODE, 2002)

XS-systems: eXtended S-Systems and Algebraic Differential Automata for Modeling Cellular Behavior. - Marco Antoniotti; Alberto Policriti; Nadia Ugel; Bud Mishra (HiPC, 2002)

Simulation as Coarsest Partition Problem. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (TACAS, 2002)

Rank-Based Symbolic Bisimulation (and Model Checking). - Agostino Dovier; Raffaella Gentilini; Carla Piazza; Alberto Policriti (WoLLIC, 2002)

Simulation Reduction as Constraint. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (WFLP, 2002)

Alternative Translation Techniques for Propositional and First-Order Modal Logics. - Angelo Montanari; Alberto Policriti; Matteo Slanina (J. Autom. Reason., 2002)

Extending Kamp's Theorem to Model Time Granularity. - Angelo Montanari; Adriano Peron; Alberto Policriti (J. Log. Comput., 2002)

Rasiowa-Sikorski Style Relational Elementary Set Theory. - Eugenio G. Omodeo; Ewa Orlowska; Alberto Policriti (RelMiCS, 2003)

Binary Extensions of S1S and the Composition Method. - Enrico Marzano; Angelo Montanari; Alberto Policriti (Verification: Theory and Practice, 2003)

Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing. - Marco Antoniotti; Bhubaneswar Mishra; Carla Piazza; Alberto Policriti; Marta Simeoni (CMSB, 2003)

Biconnectivity on Symbolically Represented Graphs: A Linear Solution. - Raffaella Gentilini; Alberto Policriti (ISAAC, 2003)

Foundations of a Query and Simulation System for the Modeling of Biochemical and Biological Processes. - Marco Antoniotti; F. Park; Alberto Policriti; Nadia Ugel; Bud Mishra (Pacific Symposium on Biocomputing, 2003)

Computing strongly connected components in a linear number of symbolic steps. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (SODA, 2003)

From Bisimulation to Simulation: Coarsest Partition Problems. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (J. Autom. Reason., 2003)

Improving reachability analysis of hybrid automata for engine control. - Alberto Casagrande; Andrea Balluchi; Luca Benvenuti; Alberto Policriti; Tiziano Villa; Alberto L. Sangiovanni-Vincentelli (CDC, 2004)

Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice. - Marco Antoniotti; Carla Piazza; Alberto Policriti; Marta Simeoni; Bud Mishra (Theor. Comput. Sci., 2004)

An efficient algorithm for computing bisimulation equivalence. - Agostino Dovier; Carla Piazza; Alberto Policriti (Theor. Comput. Sci., 2004)

Three-variable statements of set-pairing. - Andrea Formisano 001; Eugenio G. Omodeo; Alberto Policriti (Theor. Comput. Sci., 2004)

Ackermann Encoding, Bisimulations, and OBDDs. - Carla Piazza; Alberto Policriti (Theory Pract. Log. Program., 2004)

Algorithmic Algebraic Model Checking I: Challenges from Systems Biology. - Carla Piazza; Marco Antoniotti; Venkatesh Mysore; Alberto Policriti; Franz Winkler 001; Bud Mishra (CAV, 2005)

An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures. - Angelo Montanari; Alberto Policriti; Nicola Vitacolonna (LPAR, 2005)

Structured Motifs Search. - Michele Morgante; Alberto Policriti; Nicola Vitacolonna; Andrea Zuccolo (J. Comput. Biol., 2005)

The axiom of elementary sets on the edge of Peircean expressibility. - Andrea Formisano 001; Eugenio G. Omodeo; Alberto Policriti (J. Symb. Log., 2005)

A Computerized Referee. - Eugenio G. Omodeo; Domenico Cantone; Alberto Policriti; Jacob T. Schwartz (Reasoning, Action and Interaction in AI Theories and Systems, 2006)

BuST-Bundled Suffix Trees. - Luca Bortolussi; Francesco Fabris; Alberto Policriti (IFIP TCS, 2006)

Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps. - Luca Bortolussi; Simone Fonda; Alberto Policriti (BIBM, 2007)

Stochastic Concurrent Constraint Programming and Differential Equations. - Luca Bortolussi; Alberto Policriti (QAPL, 2007)

Hybrid Semantics for Stochastic pi-Calculus. - Luca Bortolussi; Alberto Policriti (AB, 2008)

Systems Biology: Models and Logics. - Carla Piazza; Alberto Policriti (ICLP, 2008)

A Complete Axiomatic System for a Process-Based Spatial Logic. - Radu Mardare; Alberto Policriti (MFCS, 2008)

Hybrid Systems and Biology. - Luca Bortolussi; Alberto Policriti (SFM, 2008)

Symbolic Graphs: Linear Solutions to Connectivity Related Problems. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (Algorithmica, 2008)

Modeling Biological Systems in Stochastic Concurrent Constraint Programming. - Luca Bortolussi; Alberto Policriti (Constraints An Int. J., 2008)

The Importance of Being (A Little Bit) Discrete. - Luca Bortolussi; Alberto Policriti (FBTC@ICALP, 2008)

Inclusion dynamics hybrid automata. - Alberto Casagrande; Carla Piazza; Alberto Policriti; Bud Mishra (Inf. Comput., 2008)

GAM: Genomic Assemblies Merger: A Graph Based Method to Integrate Different Assemblies. - Alberto Casagrande; Cristian Del Fabbro; Simone Scalabrin; Alberto Policriti (BIBM, 2009)

TEA: a Transposable Elements Annotator. - Cristian Del Fabbro; Michele Morgante; Alberto Policriti; Nicola Vitacolonna (BIOCOMP, 2009)

Stochastic Programs and Hybrid Automata for (Biological) Modeling. - Luca Bortolussi; Alberto Policriti (CiE, 2009)

Automated FingerPrint Background removal: FPB. - Simone Scalabrin; Michele Morgante; Alberto Policriti (BMC Bioinform., 2009)

Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration - Luca Bortolussi; Alberto Policriti (COMPMOD, 2009)

Discrete Semantics for Hybrid Automata. - Alberto Casagrande; Carla Piazza; Alberto Policriti (Discret. Event Dyn. Syst., 2009)

Hybrid Dynamics of Stochastic pi-Calculus. - Luca Bortolussi; Alberto Policriti (Math. Comput. Sci., 2009)

Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back. - Luca Bortolussi; Alberto Policriti (Trans. Comp. Sys. Biology, 2009)

Enhanced reference guided assembly. - Federica Cattonaro; Alberto Policriti; Francesco Vezzi (BIBM, 2010)

Perspectives on Constraints, Process Algebras, and Hybrid Systems. - Luca Bortolussi; Alberto Policriti (WCB@ICLP, 2010)

The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. - Eugenio G. Omodeo; Alberto Policriti (J. Symb. Log., 2010)

Hybrid dynamics of stochastic programs. - Luca Bortolussi; Alberto Policriti (Theor. Comput. Sci., 2010)

mrNA: The MPI Randomized Numerical Aligner. - Cristian Del Fabbro; Francesco Vezzi; Alberto Policriti (BIBM, 2011)

Programmable models of growth and mutation of cancer-cell populations - Luca Bortolussi; Alberto Policriti (CompMod, 2011)

Counting extensional acyclic digraphs. - Alberto Policriti; Alexandru I. Tomescu (Inf. Process. Lett., 2011)

ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet. - Nicola Prezza; Cristian Del Fabbro; Francesco Vezzi; Emanuale De Paoli; Alberto Policriti (BCB, 2012)

Rank-Based Simulation on Acyclic Graphs. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (CILC, 2012)

A Multi-objective Optimisation Approach to the Design of Experiment in De Novo Assembly Projects. - Francesca Nadalin; Francesco Vezzi; Alberto Policriti (DEXA Workshops, 2012)

rNA: a fast and accurate short reads numerical aligner. - Francesco Vezzi; Cristian Del Fabbro; Alexandru I. Tomescu; Alberto Policriti (Bioinform., 2012)

GapFiller: a de novo assembly approach to fill the gap within paired reads. - Francesca Nadalin; Francesco Vezzi; Alberto Policriti (BMC Bioinform., 2012)

A randomized Numerical Aligner (rNA). - Alberto Policriti; Alexandru I. Tomescu; Francesco Vezzi (J. Comput. Syst. Sci., 2012)

The Bernays - Schönfinkel - Ramsey class for set theory: decidability. - Eugenio G. Omodeo; Alberto Policriti (J. Symb. Log., 2012)

Infinity, in short. - Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (J. Log. Comput., 2012)

Studying cancer-cell populations by programmable models of networks. - Luca Bortolussi; Alberto Policriti (Netw. Model. Anal. Health Informatics Bioinform., 2012)

On the Decidability of the ∃*∀* Prefix Class in Set Theory. - Alberto Policriti (CILC, 2013)

Encodings of Sets and Hypersets. - Alberto Policriti (CILC, 2013)

Markov chain algorithms for generating sets uniformly at random. - Alberto Policriti; Alexandru I. Tomescu (Ars Math. Contemp., 2013)

GAM-NGS: genomic assemblies merger for next generation sequencing. - Riccardo Vicedomini; Francesco Vezzi; Simone Scalabrin; Lars Arvestad; Alberto Policriti (BMC Bioinform., 2013)

Well-quasi-ordering hereditarily finite sets. - Alberto Policriti; Alexandru I. Tomescu (Int. J. Comput. Math., 2013)

(Hybrid) automata and (stochastic) programsThe hybrid automata lattice of a stochastic program. - Luca Bortolussi; Alberto Policriti (J. Log. Comput., 2013)

Hyper-Extensionality and One-Node Elimination on Membership Graphs. - Eugenio G. Omodeo; Carla Piazza; Alberto Policriti; Alexandru I. Tomescu (CILC, 2014)

Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. - Alberto Policriti; Nicola Prezza (ISAAC, 2014)

A Parallel Algorithm for the Best k-Mismatches Alignment Problem. - Cristian Del Fabbro; Fabio Tardivo; Alberto Policriti (PDP, 2014)

Chimera: a Bioconductor package for secondary analysis of fusion products. - Marco Beccuti; Matteo Carrara; Francesca Cordero; Fulvio Lazzarato; Susanna Donatelli; Francesca Nadalin; Alberto Policriti; Raffaele A. Calogero (Bioinform., 2014)

Hierarchical Assembly of Pools. - Riccardo Vicedomini; Francesco Vezzi; Simone Scalabrin; Lars Arvestad; Alberto Policriti (IWBBIO (2), 2015)

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. - Alberto Policriti; Nicola Gigante; Nicola Prezza (LATA, 2015)

Fast Online Lempel-Ziv Factorization in Compressed Space. - Alberto Policriti; Nicola Prezza (SPIRE, 2015)

Fast randomized approximate string matching with succinct hash data structures. - Alberto Policriti; Nicola Prezza (BMC Bioinform., 2015)

On the impact of discreteness and abstractions on modelling noise in gene regulatory networks. - Chiara Bodei; Luca Bortolussi; Davide Chiarugi; Maria Luisa Guerriero; Alberto Policriti; Alessandro Romanel (Comput. Biol. Chem., 2015)

Is Hyper-extensionality Preservable Under Deletions of Graph Elements? - Alberto Casagrande; Carla Piazza; Alberto Policriti (ICTCS, 2015)

Mapping Sets and Hypersets into Numbers. - Giovanna D'Agostino; Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Fundam. Informaticae, 2015)

Rank and simulation: the well-founded case. - Raffaella Gentilini; Carla Piazza; Alberto Policriti (J. Log. Comput., 2015)

Banishing Ultrafilters from Our Consciousness. - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

Logic Programming Applied to Genome Evolution in Cancer. - Alessandro Dal Palù; Agostino Dovier; Andrea Formisano 001; Alberto Policriti; Enrico Pontelli (CILC, 2016)

Computing LZ77 in Run-Compressed Space. - Alberto Policriti; Nicola Prezza (DCC, 2016)

Logic-Based Multi-objective Design of Chemical Reaction Networks. - Luca Bortolussi; Alberto Policriti; Simone Silvetti (HSB, 2016)

Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2. - Nicola Prezza; Francesco Vezzi; Max Käller; Alberto Policriti (BMC Bioinform., 2016)

Fast Longest Common Extensions in Small Space. - Alberto Policriti; Nicola Prezza (CoRR, 2016)

On Sets and Graphs: Perspectives on Logic and Combinatorics - Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Springer, 2017)

From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. - Alberto Policriti; Nicola Prezza (CPM, 2017)

Towards a Logic Programming Tool for Cancer Analysis. - Alice Tarzariol; Agostino Dovier; Alberto Policriti (ICTCS/CILC, 2017)

An Active Learning Approach to the Falsification of Black Box Cyber-Physical Systems. - Simone Silvetti; Alberto Policriti; Luca Bortolussi (IFM, 2017)

Set-syllogistics meet combinatorics. - Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Math. Struct. Comput. Sci., 2017)

Power (Set) ALC (Extended Abstract). - Laura Giordano 001; Alberto Policriti (CILC, 2018)

String Attractors: Verification and Optimization. - Dominik Kempa; Alberto Policriti; Nicola Prezza; Eva Rotenberg (ESA, 2018)

Power (Set) ALC. - Laura Giordano 001; Alberto Policriti (ICTCS, 2018)

Encoding Sets as Real Numbers. - Domenico Cantone; Alberto Policriti (SETS@ABZ, 2018)

LZ77 Computation Based on the Run-Length Encoded BWT. - Alberto Policriti; Nicola Prezza (Algorithmica, 2018)

Encoding Sets as Real Numbers (Extended version). - Domenico Cantone; Alberto Policriti (CoRR, 2018)

Optimization and Multistage Systems. The Thawing Case. - Eleonora Pippia; Arianna Bozzato; Emidio Tiberi; Riccardo Furlanetto; Alberto Policriti (OVERLAY@AI*IA, 2019)

Extending ALC with the power-set construct. - Laura Giordano 001; Alberto Policriti (CILC, 2019)

Extending ALC with the Power-Set Construct. - Laura Giordano 001; Alberto Policriti (JELIA, 2019)

On Prefix-Sorting Finite Automata. - Jarno Alanko; Alberto Policriti; Nicola Prezza (CoRR, 2019)

Regular Languages meet Prefix Sorting. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (SODA, 2020)

Towards a Logic Programming Tool for Cancer Data Analysis. - Alice Tarzariol; Eugenia Zanazzo; Agostino Dovier; Alberto Policriti (Fundam. Informaticae, 2020)

Adding the power-set to description logics. - Laura Giordano 001; Alberto Policriti (Theor. Comput. Sci., 2020)

Ordering Regular Languages: a Danger Zone. - Davide Martincigh; Giovanna D'Agostino; Alberto Policriti (ICTCS, 2021)

Which Regular Languages can be Efficiently Indexed? - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (CoRR, 2021)

On (co-lex) Ordering Automata. - Giovanna D'Agostino; Nicola Cotumaccio; Alberto Policriti; Nicola Prezza (CoRR, 2021)

The Labeled Direct Product Optimally Solves String Problems on Graphs. - Nicola Rizzo 001; Alexandru I. Tomescu; Alberto Policriti (CoRR, 2021)

Wheeler languages. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (Inf. Comput., 2021)

Solving String Problems on Graphs Using the Labeled Direct Product. - Nicola Rizzo 001; Alexandru I. Tomescu; Alberto Policriti (Algorithmica, 2022)

Special Issue on Algorithms and Data-Structures for Compressed Computation. - Alberto Policriti; Nicola Prezza (Algorithms, 2022)

Continued Hereditarily Finite Sets Approximations. - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (CILC, 2023)

Testing Wheelerness of Regular Languages (short paper) (text not included). - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Alberto Policriti; Nicola Prezza (ICTCS, 2023)

A Linear-size Cascade Decomposition for Wheeler Automata. - Giovanna D'Agostino; Luca Geatti; Davide Martincigh; Alberto Policriti (ICTCS, 2023)

Optimal Wheeler Language Recognition. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Bojana Kodric; Alberto Policriti; Nicola Prezza (SPIRE, 2023)

Obituary of Martin Davis (1928-2023). - Alberto Policriti; Eugenio G. Omodeo; Liesbeth De Mol (IEEE Ann. Hist. Comput., 2023)

Ordering regular languages and automata: Complexity. - Giovanna D'Agostino; Davide Martincigh; Alberto Policriti (Theor. Comput. Sci., 2023)

Co-lexicographically Ordering Automata and Regular Languages - Part I. - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (J. ACM, 2023)

On Generalised Ackermann Encodings - The Basis Issue. - Simone Boscaratto; Eugenio G. Omodeo; Alberto Policriti (CILC, 2024)

The Rational Construction of a Wheeler DFA. - Giovanni Manzini; Alberto Policriti; Nicola Prezza; Brian Riccardi (CPM, 2024)

Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level. - Roberto Pagliarini; Fabio Marroni; Carla Piazza; Giovanni Gabelli; Gabriele Magris; Gabriele Di Gaspero; Michele Morgante; Alberto Policriti (IWBBIO (2), 2024)

In Memory of Martin Davis. - Wesley Calvert; Valentina S. Harizanov; Eugenio G. Omodeo; Alberto Policriti; Alexandra Shlapentokh (CoRR, 2024)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Tomasz Kociumaka; Bojana Kodric; Alberto Policriti; Nicola Prezza (CoRR, 2024)

Incremental NFA minimization. - Christian Bianchini; Alberto Policriti; Brian Riccardi; Riccardo Romanello (Theor. Comput. Sci., 2024)

Cascade products and Wheeler automata. - Giovanna D'Agostino; Luca Geatti; Davide Martincigh; Alberto Policriti (Theor. Comput. Sci., 2024)

Wheeler Graphs and Wheeler Languages. - Nicola Cotumaccio; Giovanna D'Agostino; Daniel Gibney; Alberto Policriti; Nicola Prezza; Sharma V. Thankachan (The Expanding World of Compressed Data, 2025)

Universally Wheeler Languages. - Ruben Becker; Giuseppa Castiglione; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza; Antonio Restivo; Brian Riccardi (DLT, 2025)

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy. - Liesbeth De Mol; Yuri V. Matiyasevich; Eugenio G. Omodeo; Alberto Policriti; Wilfried Sieg; Elaine J. Weyuker (CoRR, 2025)