Alberto Bertoni

According to our database1, Alberto Bertoni authored at least 102 papers between 1972 and 2016.

Collaborative distances:



In proceedings 
PhD thesis 




Exact algorithms for size constrained 2-clustering in the plane.
Theor. Comput. Sci., 2016

UNIPred: Unbalance-Aware Network Integration and Prediction of Protein Functions.
Journal of Computational Biology, 2015

Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages.
Int. J. Found. Comput. Sci., 2014

Size-constrained 2-clustering in the plane with Manhattan distance.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

A neural network algorithm for semi-supervised node label learning from unbalanced data.
Neural Networks, 2013

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Size Constrained Distance Clustering: Separation Properties and Some Complexity Results.
Fundam. Inform., 2012

A Neural Procedure for Gene Function Prediction.
Proceedings of the Neural Nets and Surroundings - 22nd Italian Workshop on Neural Nets, 2012

A Mathematical Model for the Validation of Gene Selection Methods.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering.
Proceedings of the Neural Nets WIRN11, 2011

COSNet: A Cost Sensitive Neural Network for Semi-supervised Learning in Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

Regularity of Languages Defined by Formal Series with Isolated Cut Point.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

Trace monoids with idempotent generators and measure-only quantum automata.
Natural Computing, 2010

Grammatical compression: compressed equivalence and other problems.
Discrete Mathematics & Theoretical Computer Science, 2010

Learning functional linkage networks with a cost-sensitive approach.
Proceedings of the Neural Nets WIRN10, 2010

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases.
Fundam. Inform., 2009

The Inclusion Problem of Context-Free Languages: Some Tractable Cases.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Approximating the Mean Speedup in Trace Monoids.
Int. J. Found. Comput. Sci., 2008

Discovering multi-level structures in bio-molecular data through the Bernstein inequality.
BMC Bioinformatics, 2008

Classification of DNA microarray data with Random Projection Ensembles of Polynomial SVMs.
Proceedings of the New Directions in Neural Networks, 2008

Random projections preserving the Hamming distance between words.
Proceedings of the New Directions in Neural Networks, 2008

Literal Shuffle of Compressed Words.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2008

Model order selection for bio-molecular data clustering.
BMC Bioinformatics, 2007

On the Complexity of Unary Tiling-Recognizable Picture Languages.
Proceedings of the STACS 2007, 2007

Discovering Significant Structures in Clustered Bio-molecular Data Through the Bernstein Inequality.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2007

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Some formal tools for analyzing quantum automata.
Theor. Comput. Sci., 2006

Theor. Comput. Sci., 2006

Local Limit Properties for Pattern Statistics and Rational Models.
Theory Comput. Syst., 2006

Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses.
Artificial Intelligence in Medicine, 2006

Context-Free Grammars and XML Languages.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

Small size quantum automata recognizing some regular languages.
Theor. Comput. Sci., 2005

Bio-molecular cancer prediction with random subspace ensembles of support vector machines.
Neurocomputing, 2005

Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms.
Proceedings of the Neural Nets, 16th Italian Workshop on Neural Nets, 2005

Analysis of a Genetic Model with Finite Populations.
Proceedings of the Advances in Natural Computation, First International Conference, 2005

Some formal methods for analyzing quantum automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

Feature Selection Combined with Random Subspace Ensemble for Gene Expression Based Diagnosis of Malignancies.
Proceedings of the Biological and Artificial Intelligence Environments, 2004

Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.
Proceedings of the STACS 2004, 2004

On the number of occurrences of a symbol in words of regular languages.
Theor. Comput. Sci., 2003

Monte Carlo simulation of quantum electron transport based on Wigner paths.
Mathematics and Computers in Simulation, 2003

Golomb Rulers And Difference Sets For Succinct Quantum Automata.
Int. J. Found. Comput. Sci., 2003

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Quantum Computing: 1-Way Quantum Automata.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation.
Algorithmica, 2002

Structural Complexity and Neural Networks.
Proceedings of the Neural Nets, 13th Italian Workshop on Neural Nets, 2002

Dynamical Equation and Monte Carlo Simulation of the Two-time Wigner Function for Electron Quantum Transport.
VLSI Design, 2001

Wigner Paths Method in Quantum Transport with Dissipation.
VLSI Design, 2001

Numerical Simulation of Quantum Logic Gates Based on Quantum Wires.
VLSI Design, 2001

Analogies and differences between quantum and stochastic automata.
Theor. Comput. Sci., 2001

Random Generation for Finitely Ambiguous Context-free Languages.
ITA, 2001

Regular Languages Accepted by Quantum Automata.
Inf. Comput., 2001

An approximation algorithm for the maximum cut problem and its experimental analysis.
Discrete Applied Mathematics, 2001

The Prospect for Answer Sets Computation by a Genetic Model.
Proceedings of the Answer Set Programming, 2001

A Genetic Model: Analysis and Application to MAXSAT.
Evolutionary Computation, 2000

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
Proceedings of the STACS 2000, 2000

On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages.
ITA, 1998

A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation.
Neural Networks, 1997

Approximability of the Ground State Problem for Certain Ising Spin Glasses.
J. Complexity, 1997

An Upper Bound for the Maximum Cut Mean Value.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Analysis of a Genetic Model.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

A Boosting Algorithm for Regression.
Proceedings of the Artificial Neural Networks, 1997

A Genetic Model and the Hopfield Networks.
Proceedings of the Artificial Neural Networks, 1996

Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.
Inf. Process. Lett., 1995

A neural circuit for the maximum 2-satisfiability problem.
Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), 1995

Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Corrigendum: An Optimal Lower Bound for Nonregular Languages.
Inf. Process. Lett., 1994

An Optimal Lower Bound for Nonregular Languages.
Inf. Process. Lett., 1994

A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series.
IJAC, 1994

On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

On Ranking 1-Way Finitely Ambiguous NL Languages and #P1-Complete Census Functions.
ITA, 1993

Implicit Parallelism in Genetic Algorithms.
Artif. Intell., 1993

Holonomic Generating Functions and Context Free Languages.
Int. J. Found. Comput. Sci., 1992

Polynomial Iniform Convergence and Polynomial-Sample Learnability.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
Theor. Comput. Sci., 1991

Ranking and Formal Power Series.
Theor. Comput. Sci., 1991

Some Notes on Computational Learing Theory.
Bulletin of the EATCS, 1991

Asymmetric Boltzmann machines.
Biological Cybernetics, 1991

Polynomial Uniform Convergence of Relative Frequencies to Probabilities.
Proceedings of the Advances in Neural Information Processing Systems 4, 1991

Counting Problems and Algebraic Formal Power Series in Noncommuting Variables.
Inf. Process. Lett., 1990

Membership Problems for Regular and Context-Free Trace Languages
Inf. Comput., August, 1989

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989

Generating functions of trace languages.
Bulletin of the EATCS, 1988

Computing the Counting Function of Context-Free Languages.
Proceedings of the STACS 87, 1987

On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages.
Proceedings of the Applied Algebra, 1987

Parallel Algorithms and the Classification of Problems.
Proceedings of the WOPPLOT 86, 1986

Analysis of a Class of Algorithms for Problems on Trace Languages.
Proceedings of the Applied Algebra, 1986

Abstract Data Types and Their Extensions within a Constructive Logic.
Proceedings of the Semantics of Data Types, International Symposium, 1984

Equivalence and Membership Problems for Regular Trace Languages.
Proceedings of the Automata, 1982

On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.
Inf. Process. Lett., 1981

A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools.
Proceedings of the International Symposium on Programming, 1980

Three Efficient Algorithms for Counting Problems.
Inf. Process. Lett., 1979

A Characterization of Abstract Data as Model-Theoretic Invariants.
Proceedings of the Automata, 1979

An Algebraic Approach to Problem Solution and Problem Semantics.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata.
Proceedings of the Automata, 1977

Mathematical Methods of the Theory of Stochastic Automata.
Proceedings of the Mathematical Foundations of Computer Science, 1974

The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory.
Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974

Equations of Formal Power Series over Non Commutative Semiring.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines.
ICALP, 1972