Alberto Bertoni
According to our database1,
Alberto Bertoni
authored at least 106 papers
between 1972 and 2016.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2016
Theor. Comput. Sci., 2016
2015
J. Comput. Biol., 2015
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
2014
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages.
Int. J. Found. Comput. Sci., 2014
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014
2013
A neural network algorithm for semi-supervised node label learning from unbalanced data.
Neural Networks, 2013
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
2012
RAIRO Theor. Informatics Appl., 2012
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results.
Fundam. Informaticae, 2012
Proceedings of the Neural Nets and Surroundings - 22nd Italian Workshop on Neural Nets, 2012
2011
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
Int. J. Found. Comput. Sci., 2011
Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering.
Proceedings of the Neural Nets WIRN11, 2011
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011
2010
Nat. Comput., 2010
Discret. Math. Theor. Comput. Sci., 2010
Proceedings of the Neural Nets WIRN10, 2010
2009
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases.
Fundam. Informaticae, 2009
2008
Discovering multi-level structures in bio-molecular data through the Bernstein inequality.
BMC Bioinform., 2008
Classification of DNA microarray data with Random Projection Ensembles of Polynomial SVMs.
Proceedings of the New Directions in Neural Networks, 2008
Proceedings of the New Directions in Neural Networks, 2008
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
2007
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
2006
Theory Comput. Syst., 2006
Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses.
Artif. Intell. Medicine, 2006
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
2005
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
Proceedings of the IEEE International Joint Conference on Neural Networks, 2005
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
2004
Feature Selection Combined with Random Subspace Ensemble for Gene Expression Based Diagnosis of Malignancies.
Proceedings of the Biological and Artificial Intelligence Environments, 2004
Proceedings of the STACS 2004, 2004
2003
Theor. Comput. Sci., 2003
Math. Comput. Simul., 2003
Int. J. Found. Comput. Sci., 2003
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003
Proceedings of the Developments in Language Theory, 7th International Conference, 2003
2002
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation.
Algorithmica, 2002
Proceedings of the Neural Nets, 13th Italian Workshop on Neural Nets, 2002
2001
Dynamical Equation and Monte Carlo Simulation of the Two-time Wigner Function for Electron Quantum Transport.
VLSI Design, 2001
VLSI Design, 2001
Theor. Comput. Sci., 2001
RAIRO Theor. Informatics Appl., 2001
An approximation algorithm for the maximum cut problem and its experimental analysis.
Discret. Appl. Math., 2001
Proceedings of the 12th Italian Workshop on Neural Nets, 2001
Proceedings of the Answer Set Programming, 2001
2000
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
Proceedings of the STACS 2000, 2000
1998
RAIRO Theor. Informatics Appl., 1998
1997
Neural Networks, 1997
J. Complex., 1997
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997
A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit Implementation.
Proceedings of the Workshop on Algorithm Engineering, 1997
Analysis of a Genetic Model.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997
Proceedings of the Artificial Neural Networks, 1997
1996
Proceedings of the Artificial Neural Networks, 1996
1995
Inf. Process. Lett., 1995
Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), 1995
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995
Proceedings of the Book of Traces, 1995
1994
Inf. Process. Lett., 1994
Int. J. Algebra Comput., 1994
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
1993
On Ranking 1-Way Finitely Ambiguous NL Languages and #P<sub>1</sub>-Complete Census Functions.
RAIRO Theor. Informatics Appl., 1993
1992
Int. J. Found. Comput. Sci., 1992
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992
1991
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
Theor. Comput. Sci., 1991
Some Notes on Computational Learing Theory.
Bull. EATCS, 1991
Proceedings of the Advances in Neural Information Processing Systems 4, 1991
1990
Inf. Process. Lett., 1990
1989
Inf. Comput., August, 1989
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989
1988
Generating functions of trace languages.
Bull. EATCS, 1988
1987
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
1986
Proceedings of the WOPPLOT 86, 1986
Proceedings of the Applied Algebra, 1986
1984
Proceedings of the Semantics of Data Types, International Symposium, 1984
1982
Proceedings of the Automata, 1982
1981
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
1980
Proceedings of the International Symposium on Programming, 1980
1979
Proceedings of the Automata, 1979
1977
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
1974
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
1973
Equations of Formal Power Series over Non Commutative Semiring.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973
1972
Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines.
Proceedings of the Automata, 1972