Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines. - Alberto Bertoni (ICALP, 1972)

Equations of Formal Power Series over Non Commutative Semiring. - Alberto Bertoni (MFCS, 1973)

The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory. - Alberto Bertoni (GI Jahrestagung, 1974)

Mathematical Methods of the Theory of Stochastic Automata. - Alberto Bertoni (MFCS, 1974)

Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata. - Alberto Bertoni; Giancarlo Mauri; Mauro Torelli (ICALP, 1977)

An Algebraic Approach to Problem Solution and Problem Semantics. - Alberto Bertoni; Giancarlo Mauri; Mauro Torelli (MFCS, 1977)

A Characterization of Abstract Data as Model-Theoretic Invariants. - Alberto Bertoni; Giancarlo Mauri; Pierangelo Miglioli (ICALP, 1979)

Three Efficient Algorithms for Counting Problems. - Alberto Bertoni; Giancarlo Mauri; Mauro Torelli (Inf. Process. Lett., 1979)

Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools. - Alberto Bertoni; Giancarlo Mauri; Pierangelo Miglioli (Symposium on Programming, 1980)

An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages. - Alberto Bertoni; Marco Brambilla; Giancarlo Mauri; Nicoletta Sabadini (MFCS, 1981)

A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines - Alberto Bertoni; Giancarlo Mauri; Nicoletta Sabadini (STOC, 1981)

On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems. - Alberto Bertoni; Giancarlo Mauri (Inf. Process. Lett., 1981)

Equivalence and Membership Problems for Regular Trace Languages. - Alberto Bertoni; Giancarlo Mauri; Nicoletta Sabadini (ICALP, 1982)

Abstract Data Types and Their Extensions within a Constructive Logic. - Alberto Bertoni; Giancarlo Mauri; Pierangelo Miglioli; Mario Ornaghi (Semantics of Data Types, 1984)

Analysis of a Class of Algorithms for Problems on Trace Languages. - Alberto Bertoni; Massimiliano Goldwurm; Nicoletta Sabadini (AAECC, 1986)

Parallel Algorithms and the Classification of Problems. - Alberto Bertoni; Massimiliano Goldwurm; Giancarlo Mauri; Nicoletta Sabadini (WOPPLOT, 1986)

On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages. - Alberto Bertoni; Massimiliano Goldwurm (AAECC, 1987)

Computing the Counting Function of Context-Free Languages. - Alberto Bertoni; Massimiliano Goldwurm; Nicoletta Sabadini (STACS, 1987)

Generating functions of trace languages. - Alberto Bertoni; Nicoletta Sabadini (Bull. EATCS, 1988)

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). - Alberto Bertoni; Danilo Bruschi; Deborah Joseph; Meera Sitharam; Paul Young (FCT, 1989)

Membership Problems for Regular and Context-Free Trace Languages - Alberto Bertoni; Giancarlo Mauri; Nicoletta Sabadini (Inf. Comput., 1989)

Counting Problems and Algebraic Formal Power Series in Noncommuting Variables. - Alberto Bertoni; Massimiliano Goldwurm; Paolo Massazza (Inf. Process. Lett., 1990)

Polynomial Uniform Convergence of Relative Frequencies to Probabilities. - Alberto Bertoni; Paola Campadelli; Anna Morpurgo; Sandra Panizza (NIPS, 1991)

Asymmetric Boltzmann machines. - Bruno Apolloni; Alberto Bertoni; Paola Campadelli; Diego de Falco (Biol. Cybern., 1991)

Some Notes on Computational Learing Theory. - Alberto Bertoni; Paola Campadelli; Giancarlo Mauri (Bull. EATCS, 1991)

Ranking and Formal Power Series. - Alberto Bertoni; Danilo Bruschi; Massimiliano Goldwurm (Theor. Comput. Sci., 1991)

The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. - Alberto Bertoni; Massimiliano Goldwurm; Nicoletta Sabadini (Theor. Comput. Sci., 1991)

Polynomial Iniform Convergence and Polynomial-Sample Learnability. - Alberto Bertoni; Paola Campadelli; Anna Morpurgo; Sandra Panizza (COLT, 1992)

Holonomic Generating Functions and Context Free Languages. - Alberto Bertoni; Paolo Massazza; Nicoletta Sabadini (Int. J. Found. Comput. Sci., 1992)

Implicit Parallelism in Genetic Algorithms. - Alberto Bertoni; Marco Dorigo (Artif. Intell., 1993)

On Ranking 1-Way Finitely Ambiguous NL Languages and #P1-Complete Census Functions. - Alberto Bertoni; Massimiliano Goldwurm (RAIRO Theor. Informatics Appl., 1993)

On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (MFCS, 1994)

A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series. - Alberto Bertoni; Paolo Massazza (Int. J. Algebra Comput., 1994)

An Optimal Lower Bound for Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1994)

Corrigendum: An Optimal Lower Bound for Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1994)

Counting Techniques for Inclusion, Equivalence and Membership Problems. - Alberto Bertoni; Massimiliano Goldwurm; Giancarlo Mauri; Nicoletta Sabadini (The Book of Traces, 1995)

Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (MFCS, 1995)

A neural circuit for the maximum 2-satisfiability problem. - Maria Alberta Alberti; Alberto Bertoni; Paola Campadelli; Giuliano Grossi; Roberto Posenato (PDP, 1995)

Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. - Alberto Bertoni; Nicolò Cesa-Bianchi; Guido Fiorino (Inf. Process. Lett., 1995)

A Genetic Model and the Hopfield Networks. - Alberto Bertoni; Paola Campadelli; Marco Carpentieri; Giuliano Grossi (ICANN, 1996)

A Boosting Algorithm for Regression. - Alberto Bertoni; Paola Campadelli; M. Parodi (ICANN, 1997)

Analysis of a Genetic Model. - Alberto Bertoni; Paola Campadelli; Marco Carpentieri; Giuliano Grossi (ICGA, 1997)

A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit Implementation. - Alberto Bertoni; Paola Campadelli; Giuliano Grossi (WAE, 1997)

An Upper Bound for the Maximum Cut Mean Value. - Alberto Bertoni; Paola Campadelli; Roberto Posenato (WG, 1997)

Approximability of the Ground State Problem for Certain Ising Spin Glasses. - Alberto Bertoni; Paola Campadelli; Cristina Gangai; Roberto Posenato (J. Complex., 1997)

A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation. - Maria Alberta Alberti; Alberto Bertoni; Paola Campadelli; Giuliano Grossi; Roberto Posenato (Neural Networks, 1997)

On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages. - Alberto Bertoni; Paolo Massazza (RAIRO Theor. Informatics Appl., 1998)

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. - Alberto Bertoni; Massimiliano Goldwurm; Massimo Santini 001 (STACS, 2000)

A Genetic Model: Analysis and Application to MAXSAT. - Alberto Bertoni; Paola Campadelli; Marco Carpentieri; Giuliano Grossi (Evol. Comput., 2000)

The Prospect for Answer Sets Computation by a Genetic Model. - Alberto Bertoni; Giuliano Grossi; Alessandro Provetti; Vladik Kreinovich; Luis Tari (Answer Set Programming, 2001)

Solving Min Vertex Cover with Iterated Hopfield Networks. - Alberto Bertoni; Paola Campadelli; Giuliano Grossi (WIRN, 2001)

An approximation algorithm for the maximum cut problem and its experimental analysis. - Alberto Bertoni; Paola Campadelli; Giuliano Grossi (Discret. Appl. Math., 2001)

Regular Languages Accepted by Quantum Automata. - Alberto Bertoni; Marco Carpentieri (Inf. Comput., 2001)

Random Generation for Finitely Ambiguous Context-free Languages. - Alberto Bertoni; Massimiliano Goldwurm; Massimo Santini 001 (RAIRO Theor. Informatics Appl., 2001)

Analogies and differences between quantum and stochastic automata. - Alberto Bertoni; Marco Carpentieri (Theor. Comput. Sci., 2001)

Numerical Simulation of Quantum Logic Gates Based on Quantum Wires. - Alberto Bertoni; Paolo Bordone; Rossella Brunetti; Carlo Jacoboni; Susanna Reggiani (VLSI Design, 2001)

Wigner Paths Method in Quantum Transport with Dissipation. - Paolo Bordone; Alberto Bertoni; Rossella Brunetti; Carlo Jacoboni (VLSI Design, 2001)

Dynamical Equation and Monte Carlo Simulation of the Two-time Wigner Function for Electron Quantum Transport. - Rossella Brunetti; Alberto Bertoni; Paolo Bordone; Carlo Jacoboni (VLSI Design, 2001)

Structural Complexity and Neural Networks. - Alberto Bertoni; Beatrice Palano (WIRN, 2002)

A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation. - Alberto Bertoni; Paola Campadelli; Giuliano Grossi (Algorithmica, 2002)

Quantum Computing: 1-Way Quantum Automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Developments in Language Theory, 2003)

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (ICTCS, 2003)

Golomb Rulers And Difference Sets For Succinct Quantum Automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Int. J. Found. Comput. Sci., 2003)

Monte Carlo simulation of quantum electron transport based on Wigner paths. - Paolo Bordone; Alberto Bertoni; Rossella Brunetti; Carlo Jacoboni (Math. Comput. Simul., 2003)

On the number of occurrences of a symbol in words of regular languages. - Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (Theor. Comput. Sci., 2003)

Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. - Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (STACS, 2004)

Feature Selection Combined with Random Subspace Ensemble for Gene Expression Based Diagnosis of Malignancies. - Alberto Bertoni; Raffaella Folgieri; Giorgio Valentini (WIRN, 2004)

Some formal methods for analyzing quantum automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (DCFS, 2005)

Analysis of a Genetic Model with Finite Populations. - Alberto Bertoni; Paola Campadelli; Roberto Posenato (ICNC (3), 2005)

Random projections for assessing gene expression cluster stability. - Alberto Bertoni; Giorgio Valentini (IJCNN, 2005)

Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms. - Alberto Bertoni; Giorgio Valentini (WIRN/NAIS, 2005)

Bio-molecular cancer prediction with random subspace ensembles of support vector machines. - Alberto Bertoni; Raffaella Folgieri; Giorgio Valentini (Neurocomputing, 2005)

Small size quantum automata recognizing some regular languages. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2005)

Context-Free Grammars and XML Languages. - Alberto Bertoni; Christian Choffrut; Beatrice Palano (Developments in Language Theory, 2006)

Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses. - Alberto Bertoni; Giorgio Valentini (Artif. Intell. Medicine, 2006)

Local Limit Properties for Pattern Statistics and Rational Models. - Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (Theory Comput. Syst., 2006)

Preface. - Alberto Bertoni; Zoltán Ésik; Juhani Karhumäki (Theor. Comput. Sci., 2006)

Some formal tools for analyzing quantum automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2006)

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids. - Alberto Bertoni; Roberto Radicioni (Developments in Language Theory, 2007)

Discovering Significant Structures in Clustered Bio-molecular Data Through the Bernstein Inequality. - Alberto Bertoni; Giorgio Valentini (KES (3), 2007)

On the Complexity of Unary Tiling-Recognizable Picture Languages. - Alberto Bertoni; Massimiliano Goldwurm; Violetta Lonati (STACS, 2007)

Model order selection for bio-molecular data clustering. - Alberto Bertoni; Giorgio Valentini (BMC Bioinform., 2007)

Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data. - Alberto Bertoni; Giorgio Valentini (CIBB, 2008)

Literal Shuffle of Compressed Words. - Alberto Bertoni; Christian Choffrut; Roberto Radicioni (IFIP TCS, 2008)

Random projections preserving the Hamming distance between words. - Stefano Arca; Alberto Bertoni; Giuseppe Lipori (WIRN, 2008)

Classification of DNA microarray data with Random Projection Ensembles of Polynomial SVMs. - Alberto Bertoni; Raffaella Folgieri; Giorgio Valentini (WIRN, 2008)

Discovering multi-level structures in bio-molecular data through the Bernstein inequality. - Alberto Bertoni; Giorgio Valentini (BMC Bioinform., 2008)

Approximating the Mean Speedup in Trace Monoids. - Alberto Bertoni; Roberto Radicioni (Int. J. Found. Comput. Sci., 2008)

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases. - Alberto Bertoni; Massimiliano Goldwurm; Violetta Lonati (Fundam. Informaticae, 2009)

Learning functional linkage networks with a cost-sensitive approach. - Alberto Bertoni; Marco Frasca 001; Giuliano Grossi; Giorgio Valentini (WIRN, 2010)

Grammatical compression: compressed equivalence and other problems. - Roberto Radicioni; Alberto Bertoni (Discret. Math. Theor. Comput. Sci., 2010)

Trace monoids with idempotent generators and measure-only quantum automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Nat. Comput., 2010)

COSNet: A Cost Sensitive Neural Network for Semi-supervised Learning in Graphs. - Alberto Bertoni; Marco Frasca 001; Giorgio Valentini (ECML/PKDD (1), 2011)

Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering. - Alberto Bertoni; Matteo Re; Francesco Saccà; Giorgio Valentini (WIRN, 2011)

The Inclusion Problem of Context-Free Languages: Some Tractable Cases. - Alberto Bertoni; Christian Choffrut; Roberto Radicioni (Int. J. Found. Comput. Sci., 2011)

A Mathematical Model for the Validation of Gene Selection Methods. - Marco Muselli; Alberto Bertoni; Marco Frasca 001; Alessandro Beghini; Francesca Ruffino; Giorgio Valentini (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

A Neural Procedure for Gene Function Prediction. - Marco Frasca 001; Alberto Bertoni; Andrea Sion (WIRN, 2012)

Size Constrained Distance Clustering: Separation Properties and Some Complexity Results. - Alberto Bertoni; Massimiliano Goldwurm; Jianyi Lin; Francesco Saccà (Fundam. Informaticae, 2012)

Regularity of languages defined by formal series with isolated cut point. - Alberto Bertoni; Maria Paola Bianchi; Flavio D'Alessandro (RAIRO Theor. Informatics Appl., 2012)

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. - Alberto Bertoni; Christian Choffrut; Flavio D'Alessandro (Developments in Language Theory, 2013)

A neural network algorithm for semi-supervised node label learning from unbalanced data. - Marco Frasca 001; Alberto Bertoni; Matteo Re; Giorgio Valentini (Neural Networks, 2013)

Size-constrained 2-clustering in the plane with Manhattan distance. - Alberto Bertoni; Massimiliano Goldwurm; Jianyi Lin; Linda Pini (ICTCS, 2014)

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. - Alberto Bertoni; Christian Choffrut; Flavio D'Alessandro (Int. J. Found. Comput. Sci., 2014)

Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane. - Alberto Bertoni; Massimiliano Goldwurm; Jianyi Lin (SOFSEM, 2015)

UNIPred: Unbalance-Aware Network Integration and Prediction of Protein Functions. - Marco Frasca 001; Alberto Bertoni; Giorgio Valentini (J. Comput. Biol., 2015)

Exact algorithms for size constrained 2-clustering in the plane. - Jianyi Lin; Alberto Bertoni; Massimiliano Goldwurm (Theor. Comput. Sci., 2016)