| 2008 |
| 74 | | Viliam Geffert,
Juhani Karhumäki,
Alberto Bertoni,
Bart Preneel,
Pavol Návrat,
Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum
Safarik University, Kosice, Slovakia 2008 |
| 73 | | Viliam Geffert,
Juhani Karhumäki,
Alberto Bertoni,
Bart Preneel,
Pavol Návrat,
Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings
Springer 2008 |
| 72 | EE | Alberto Bertoni,
Christian Choffrut,
Roberto Radicioni:
Literal Shuffle of Compressed Words.
IFIP TCS 2008: 87-100 |
| 71 | EE | Alberto Bertoni,
Roberto Radicioni:
Approximating the Mean Speedup in Trace Monoids.
Int. J. Found. Comput. Sci. 19(3): 497-511 (2008) |
| 2007 |
| 70 | EE | Alberto Bertoni,
Roberto Radicioni:
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.
Developments in Language Theory 2007: 72-83 |
| 69 | EE | Alberto Bertoni,
Giorgio Valentini:
Discovering Significant Structures in Clustered Bio-molecular Data Through the Bernstein Inequality.
KES (3) 2007: 886-891 |
| 68 | EE | Alberto Bertoni,
Massimiliano Goldwurm,
Violetta Lonati:
On the Complexity of Unary Tiling-Recognizable Picture Languages.
STACS 2007: 381-392 |
| 2006 |
| 67 | EE | Alberto Bertoni,
Christian Choffrut,
Beatrice Palano:
Context-Free Grammars and XML Languages.
Developments in Language Theory 2006: 108-119 |
| 66 | EE | Alberto Bertoni,
Giorgio Valentini:
Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses.
Artificial Intelligence in Medicine 37(2): 85-109 (2006) |
| 65 | EE | Alberto Bertoni,
Zoltán Ésik,
Juhani Karhumäki:
Preface.
Theor. Comput. Sci. 356(1-2): 1-5 (2006) |
| 64 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Some formal tools for analyzing quantum automata.
Theor. Comput. Sci. 356(1-2): 14-25 (2006) |
| 63 | EE | Alberto Bertoni,
Christian Choffrut,
Massimiliano Goldwurm,
Violetta Lonati:
Local Limit Properties for Pattern Statistics and Rational Models.
Theory Comput. Syst. 39(1): 209-235 (2006) |
| 2005 |
| 62 | EE | Alberto Bertoni,
Paola Campadelli,
Roberto Posenato:
Analysis of a Genetic Model with Finite Populations.
ICNC (3) 2005: 235-244 |
| 61 | EE | Alberto Bertoni,
Giorgio Valentini:
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms.
WIRN/NAIS 2005: 31-37 |
| 60 | EE | Alberto Bertoni,
Raffaella Folgieri,
Giorgio Valentini:
Bio-molecular cancer prediction with random subspace ensembles of support vector machines.
Neurocomputing 63: 535-539 (2005) |
| 59 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Small size quantum automata recognizing some regular languages.
Theor. Comput. Sci. 340(1): 394-407 (2005) |
| 2004 |
| 58 | EE | Alberto Bertoni,
Christian Choffrut,
Massimiliano Goldwurm,
Violetta Lonati:
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.
STACS 2004: 117-128 |
| 2003 |
| 57 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Quantum Computing: 1-Way Quantum Automata.
Developments in Language Theory 2003: 1-20 |
| 56 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.
ICTCS 2003: 86-96 |
| 55 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Golomb Rulers And Difference Sets For Succinct Quantum Automata.
Int. J. Found. Comput. Sci. 14(5): 871-888 (2003) |
| 54 | EE | P. Bordone,
Alberto Bertoni,
Rosella Brunetti,
Carlo Jacoboni:
Monte Carlo simulation of quantum electron transport based on Wigner paths.
Mathematics and Computers in Simulation 62(3-6): 307-314 (2003) |
| 53 | EE | Alberto Bertoni,
Christian Choffrut,
Massimiliano Goldwurm,
Violetta Lonati:
On the number of occurrences of a symbol in words of regular languages.
Theor. Comput. Sci. 302(1-3): 431-456 (2003) |
| 2002 |
| 52 | EE | Alberto Bertoni,
Beatrice Palano:
Structural Complexity and Neural Networks.
WIRN 2002: 190-215 |
| 51 | EE | Alberto Bertoni,
Paola Campadelli,
Giuliano Grossi:
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation.
Algorithmica 33(1): 71-88 (2002) |
| 2001 |
| 50 | EE | Alberto Bertoni,
Giuliano Grossi,
Alessandro Provetti,
Vladik Kreinovich,
Luis Tari:
The Prospect for Answer Sets Computation by a Genetic Model.
Answer Set Programming 2001 |
| 49 | | Alberto Bertoni,
Paola Campadelli,
Giuliano Grossi:
An approximation algorithm for the maximum cut problem and its experimental analysis.
Discrete Applied Mathematics 110(1): 3-12 (2001) |
| 48 | EE | Alberto Bertoni,
Massimiliano Goldwurm,
Massimo Santini:
Random Generation for Finitely Ambiguous Context-free Languages.
ITA 35(6): 499-512 (2001) |
| 47 | EE | Alberto Bertoni,
Marco Carpentieri:
Regular Languages Accepted by Quantum Automata.
Inf. Comput. 165(2): 174-182 (2001) |
| 46 | EE | Alberto Bertoni,
Marco Carpentieri:
Analogies and differences between quantum and stochastic automata.
Theor. Comput. Sci. 262(1): 69-81 (2001) |
| 2000 |
| 45 | EE | Alberto Bertoni,
Massimiliano Goldwurm,
Massimo Santini:
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
STACS 2000: 567-580 |
| 44 | | Alberto Bertoni,
Paola Campadelli,
Marco Carpentieri,
Giuliano Grossi:
A Genetic Model: Analysis and Application to MAXSAT.
Evolutionary Computation 8(3): 291-309 (2000) |
| 1998 |
| 43 | | Alberto Bertoni,
Paolo Massazza:
On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages.
ITA 32(1-3): 79-98 (1998) |
| 1997 |
| 42 | | Alberto Bertoni,
Paola Campadelli,
M. Parodi:
A Boosting Algorithm for Regression.
ICANN 1997: 343-348 |
| 41 | | Alberto Bertoni,
Paola Campadelli,
Marco Carpentieri,
Giuliano Grossi:
Analysis of a Genetic Model.
ICGA 1997: 121-126 |
| 40 | | Alberto Bertoni,
Paola Campadelli,
Roberto Posenato:
An Upper Bound for the Maximum Cut Mean Value.
WG 1997: 78-84 |
| 39 | EE | Alberto Bertoni,
Paola Campadelli,
Cristina Gangai,
Roberto Posenato:
Approximability of the Ground State Problem for Certain Ising Spin Glasses.
J. Complexity 13(3): 326-329 (1997) |
| 38 | EE | Maria Alberta Alberti,
Alberto Bertoni,
Paola Campadelli,
Giuliano Grossi,
Roberto Posenato:
A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation.
Neural Networks 10(3): 555-560 (1997) |
| 1996 |
| 37 | | Alberto Bertoni,
Paola Campadelli,
Marco Carpentieri,
Giuliano Grossi:
A Genetic Model and the Hopfield Networks.
ICANN 1996: 463-468 |
| 1995 |
| 36 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.
MFCS 1995: 309-318 |
| 35 | EE | Maria Alberta Alberti,
Alberto Bertoni,
Paola Campadelli,
Giuliano Grossi,
Roberto Posenato:
A neural circuit for the maximum 2-satisfiability problem.
PDP 1995: 319-323 |
| 34 | EE | Alberto Bertoni,
Nicolò Cesa-Bianchi,
Guido Fiorino:
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.
Inf. Process. Lett. 56(1): 15-17 (1995) |
| 1994 |
| 33 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem.
MFCS 1994: 245-255 |
| 32 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
An Optimal Lower Bound for Nonregular Languages.
Inf. Process. Lett. 50(6): 289-292 (1994) |
| 31 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
Corrigendum: An Optimal Lower Bound for Nonregular Languages.
Inf. Process. Lett. 52(6): 339 (1994) |
| 1993 |
| 30 | | Alberto Bertoni,
Marco Dorigo:
Implicit Parallelism in Genetic Algorithms.
Artif. Intell. 61(2): 307-314 (1993) |
| 29 | | Alberto Bertoni,
Massimiliano Goldwurm:
On Ranking 1-Way Finitely Ambiguous NL Languages and #P1-Complete Census Functions.
ITA 27(2): 135-148 (1993) |
| 1992 |
| 28 | EE | Alberto Bertoni,
Paola Campadelli,
Anna Morpurgo,
Sandra Panizza:
Polynomial Iniform Convergence and Polynomial-Sample Learnability.
COLT 1992: 265-271 |
| 27 | | Alberto Bertoni,
Paolo Massazza,
Nicoletta Sabadini:
Holonomic Generating Functions and Context Free Languages.
Int. J. Found. Comput. Sci. 3(2): 181-191 (1992) |
| 1991 |
| 26 | EE | Alberto Bertoni,
Paola Campadelli,
Anna Morpurgo,
Sandra Panizza:
Polynomial Uniform Convergence of Relative Frequencies to Probabilities.
NIPS 1991: 904-911 |
| 25 | | Alberto Bertoni,
Paola Campadelli,
Giancarlo Mauri:
Some Notes on Computational Learing Theory.
Bulletin of the EATCS 43: 140-158 (1991) |
| 24 | | Alberto Bertoni,
Danilo Bruschi,
Massimiliano Goldwurm:
Ranking and Formal Power Series.
Theor. Comput. Sci. 79(1): 25-35 (1991) |
| 23 | | Alberto Bertoni,
Massimiliano Goldwurm,
Nicoletta Sabadini:
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
Theor. Comput. Sci. 86(2): 325-342 (1991) |
| 1990 |
| 22 | | Alberto Bertoni,
Massimiliano Goldwurm,
Paolo Massazza:
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables.
Inf. Process. Lett. 34(3): 117-121 (1990) |
| 1989 |
| 21 | | Alberto Bertoni,
Danilo Bruschi,
Deborah Joseph,
Meera Sitharam,
Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
FCT 1989: 35-46 |
| 20 | | Alberto Bertoni,
Giancarlo Mauri,
Nicoletta Sabadini:
Membership Problems for Regular and Context-Free Trace Languages
Inf. Comput. 82(2): 135-150 (1989) |
| 1988 |
| 19 | | Alberto Bertoni,
Nicoletta Sabadini:
Generating functions of trace languages.
Bulletin of the EATCS 35: 106-112 (1988) |
| 1987 |
| 18 | | Alberto Bertoni,
Massimiliano Goldwurm:
On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages.
AAECC 1987: 35-59 |
| 17 | | Alberto Bertoni,
Massimiliano Goldwurm,
Nicoletta Sabadini:
Computing the Counting Function of Context-Free Languages.
STACS 1987: 169-179 |
| 1986 |
| 16 | | Alberto Bertoni,
Massimiliano Goldwurm,
Nicoletta Sabadini:
Analysis of a Class of Algorithms for Problems on Trace Languages.
AAECC 1986: 202-214 |
| 15 | | Alberto Bertoni,
Massimiliano Goldwurm,
Giancarlo Mauri,
Nicoletta Sabadini:
Parallel Algorithms and the Classification of Problems.
WOPPLOT 1986: 206-226 |
| 1984 |
| 14 | | Alberto Bertoni,
Giancarlo Mauri,
Pierangelo Miglioli,
Mario Ornaghi:
Abstract Data Types and Their Extensions within a Constructive Logic.
Semantics of Data Types 1984: 177-195 |
| 1982 |
| 13 | | Alberto Bertoni,
Giancarlo Mauri,
Nicoletta Sabadini:
Equivalence and Membership Problems for Regular Trace Languages.
ICALP 1982: 61-71 |
| 1981 |
| 12 | | Alberto Bertoni,
M. Brambilla,
Giancarlo Mauri,
Nicoletta Sabadini:
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages.
MFCS 1981: 205-215 |
| 11 | | Alberto Bertoni,
Giancarlo Mauri,
Nicoletta Sabadini:
A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines
STOC 1981: 168-176 |
| 10 | | Alberto Bertoni,
Giancarlo Mauri:
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.
Inf. Process. Lett. 12(3): 142-145 (1981) |
| 1980 |
| 9 | | Alberto Bertoni,
Giancarlo Mauri,
Pierangelo Miglioli:
Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools.
Symposium on Programming 1980: 44-58 |
| 1979 |
| 8 | | Alberto Bertoni,
Giancarlo Mauri,
Pierangelo Miglioli:
A Characterization of Abstract Data as Model-Theoretic Invariants.
ICALP 1979: 26-37 |
| 7 | | Alberto Bertoni,
Giancarlo Mauri,
Mauro Torelli:
Three Efficient Algorithms for Counting Problems.
Inf. Process. Lett. 8(1): 50-53 (1979) |
| 1977 |
| 6 | | Alberto Bertoni,
Giancarlo Mauri,
Mauro Torelli:
Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata.
ICALP 1977: 87-94 |
| 5 | | Alberto Bertoni,
Giancarlo Mauri,
Mauro Torelli:
An Algebraic Approach to Problem Solution and Problem Semantics.
MFCS 1977: 253-262 |
| 1974 |
| 4 | | Alberto Bertoni:
The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory.
GI Jahrestagung 1974: 107-112 |
| 3 | | Alberto Bertoni:
Mathematical Methods of the Theory of Stochastic Automata.
MFCS 1974: 9-22 |
| 1973 |
| 2 | | Alberto Bertoni:
Equations of Formal Power Series over Non Commutative Semiring.
MFCS 1973: 185-190 |
| 1972 |
| 1 | | Alberto Bertoni:
Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines.
ICALP 1972: 507-516 |