Pubblicazioni  di Alberto Bertoni (1978-2004)

 

. [BeFoVa04b] A. Bertoni, R.Folgieri, G.Valentini,  Random Subspaces Ensembles for the biomolecular diagnosis of tumors, NETTAB 2004.

 

[BeFoVa04a] A.Bertoni, R.Folgieri, G.Valentini, Feature selection combined with random subspace ensemble for gene expression based diagnosis of malignancies, WIRN 2004

 

[BeFoVa04] A. Bertoni, R.Folgieri, G.Valentini, Biomolecular cancer prediction with random subspaces ensembles of Support Vector Machines, accettato per pubblicazione  su Neurocomputing, 2004.

 

[BeChGoLo04]  A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati, Local limit distributions in pattern statistics: beyond the Markovian models,Proceedings STACS 2004, 21th Symposium on Theoretical Aspects of Computer Science, Montpellier (France), March 2004, V. Diekert and M.Habib Editors, Lecture Notes in Computer Science n. 2996, Springer-Verlag (2004), 117-128

 

[BeMaRa03] A. Bertoni, P. Massazza, R. Radicioni, Random generation of words with fixed occurences in regular languages. Proceedings of WORDS ’03, 4th International Conference on Combinatorics on Words. Turku, Finland, september 2003. pages 332-343.

 

[BeChGoLo03]  A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati, On the number of occurrences of a symbol in words of regular languages, Theoretical Computer Science, vol. 302 (2003), 431-456.

 

[BeMePa03c] A. Bertoni, C. Mereghetti e B. Palano.   Quantum Computing: 1-way quantum automata. In Developments in Language Theory, 7th International Conference, LNCS 2710, pp. 1--20, Springer, 2003.

 

[BeMePa03b] A. Bertoni,  C. Mereghetti e  B. Palano. Approximating  stochastic events by quantum automata. In Proceedings of ERATO Conference on Quantum Information Science, Kyoto, Japan,  2003

 

[BeMePa03a] A. Bertoni,  C. Mereghetti e  B. Palano. Lower bounds on the size of quantum automata accepting unary languages.  In Proceedings of the 8th  Italian Conference on Theoretical ComputerScience, LNCS2841,pp.86-95, Springer, 2003.

 

[BeMePa03] A. Bertoni,  C. Mereghetti e B. Palano. Golomb Rulers and Difference Sets for Succinct Quantum Automata. International Journal of Foundations of Computer Science, Vol.14, pp. 871-888, 2003.

 

[BeCaGr02] A. Bertoni, P. Campadelli,  G. Grossi, A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments and Circuit Implementation,  Algoritmica 33 (1), pp.71-88, 2002.

 

[BePa02] A. Bertoni e  B. Palano. Structural Complexity and Neural Networks, Proc. 13th WIRN,  LNCS 2486, pp.190-216, Springer, 2002.

 

[BCGL02] A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati, The symbol-periodicity of irreducible finite automata, RI n.277-02, DSI, 2002, submitted for publication.

 

[BeCaGr01] A. Bertoni, P. Campadelli,G. Grossi.  An Approximation Algorithm for the Maximum Cut Problem and its Experimental Analysis, Discrete Applied Mathematics 110 ,  pp.3-12, 2001.

 

[BeCa01a] A. Bertoni and M. Carpentieri, Analogies and Differences between Quantum and Stochastic Automata, Theoretical Computer Science, vol. 262, pp. 69-81, 2001

 

[BeCa01b] A. Bertoni and M. Carpentieri,  Regular Languages Accepted by Quantum Automata, Information and Computation. vol. 165, pp. 174-182, 2001

 

[BGS01].  A. Bertoni, M. Goldwurm, M. Santini, Random generation for finitely ambiguous context-free languages, Theoretical Informatics and applications, Vol. 35, pp.499-512, 2001.

 

[BGPKT01] A. Bertoni, G.Grossi, A.Provetti, V.Kreinovich, L.Tari, The Prospect for Answer Sets Computation by a Genetic Model, AAAI Spring Symp., pp.1-5, AAAI Press, 2001.

 

[BCGL01] A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati,  Asymptotic evaluation of the number of words of given length in a regular language with a given number of occurrences of a symbol,  Words 2001, Palermo, 2001.

 

 [BGS00].  A. Bertoni, M. Goldwurm, M. Santini, Random Uniform Generation and Approximate Counting of Ambiguously Described Combinatorial Structures, STACS ‘00, LNCS 1770, pp.567-580, Springer Verlag, 2000

 

[BeMa00] A. Bertoni. P. Massazza, "On the Square Root of Languages", Proceedings of 12th International Conference FPSAC '00, D. Krob A.A. Mikhalev A.V. Mikhalev Editors, Springer pp. 125-134, 2000.

 

[BCCG00]. A. Bertoni, P. Campadelli, M. Carpentieri and G. Grossi, A Genetic Model: Analysis and Application to MAXSAT, Evolutionary Computation, 8 (3), pp. 291-309, 2000.

 

[BeGoPa00] A.Bertoni, M.Goldwurm, B.Palano, A fast Parallel algorithm for the Speed up problem of traces, Proc. Work. On Trace Theory and Code Par., Giugno 2000, Milano, pp. 29-36

 

[BCG98]. A. Bertoni, P. Campadelli,  G. Grossi., An Approximation Algorithm for the Maximum Cut Problem and its Experimental Analysis (ALEX'98), 1998.

 

 [BM98] A. Bertoni, M. Massazza, On the inclusion problem for finitely amboguous rational trace languages, Theo. Info. and Appl., vol. 32, pp.79-98, 1998.

 

[BeCaGaPo97]A. Bertoni, P. Campadelli, G. Gangai, R. Posenato, Approximability of the Ground State Problem for Ising Spin Glasses, Journal of Complexity, 13, pp. 326-339, 1997.

 

[BCO97] A. Bertoni, G. Cattaneo, D. Oggioni, On the Approximability of the Ground State Problem for Ising Spin Glasses by Quantum Devices, J. of Physics A: Mathematical and General, pp.6821-6830, 1997.

 

[ABCGP97] M.A. Alberti, A. Bertoni, P. Campadelli, G. Grossi, R. Posenato, A Neural Algorithm for MAX-2SAT: Performance, Analysis and Circuit Implementation, Neural Networks, 10, pp. 555-560, 1997.

 

[BCCG97] A. Bertoni, P. Campadelli,  M. Carpentieri, G. Grossi., Analysis of a Genetic Model., Proccedings of the  7th International Conference on Genetic Algorithms, (ICGA97), 121--126, Morgan Kaufmann 1997.

 

[BCP97] A. Bertoni, P. Campadelli, R. Posenato., Un Upper Bound for the Maximum Cut Mean Value,   Proc. of the 23rd International Workshop on Graph-TheoreticConcepts in Computer Science (WG97), Lecture Notes in Computer Science, 78--84, Springer 1997.

 

[BCG97] A. Bertoni, P. Campadelli,  G. Grossi., A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit Implementation,  Proceedings of Workshop on algorithm Engineering (WAE'97)},  84--91, 1997.

 

[BCP97] A. Bertoni, P. Campadelli, M. Parodi., A Boosting Algorithm for regression., Proceedings ICANN97,  Lecture Notes in Computer,  343--348 , Springer 1997.

 

[BeCaPoSa96] A. Bertoni, P. Campadelli, R. Posenato, M. Santini, Approximability of ground state problem on tridimensional Ising spin glasses, Proc. 5th IC of Th.Comp.Sci., World Scientific, pp.492-497, 1996.

 

[BeCaCS96]A. Bertoni,P.Campadelli, N.Cesa-Bianchi. Multilayer perceptrons and

Learning, Proc. 5th IC of Th.Comp.Sci., World Scientific, pp.43-76, 1996

 

[BeCaCaGr96]A. Bertoni, P. Campadelli,  M. Carpentieri, G. Grossi, A genetic model and the Hopfield's networks, Proceedings of ICANN96, von der Malsburg, von Seelen, Vorbuggen, Sendhoff (Eds),pp.463-468 Springer, 1996.

 

 

[ABCGP95] M.A. Alberti, A. Bertoni, P. Campadelli, G. Grossi, R. Posenato, A Neural Algorithm for  the Maximum 2-Satisfiability problem, Euromicro Workshop on Parallel and Distribuited Processing, IEEE Comp. Soc. Press., 1995.

 

[BeGoMaSa95]A.Bertoni, M.Goldwurm, G:Mauri, N.Sabadini, Counting techniques for inclusion, equivalence, membership problems, in “The Book of Traces”  (V.Diekert, G.Rozemberg ed.s), World Scientific, pp.131-163, 1995.

 

[BeCaPo95] A. Bertoni, P. Campadelli, R. Posenato, Polynomial Time Approximation of Min Energy in Hpfield Networks, 7th WIRN, World Scientific, 1995.

 

[BeMePi95] A. Bertoni, C. Mereghetti, G. Pighizzini, Strong optimal lower bounds for Turing machines that accept nonregular languages,  MFCS 95, LNCS  969, pp.309-318, 1995.

 

[BeCBFi95] A. Bertoni, N. Cesa Bianchi, G. Fiorino, Efficient learning with equivalence queries of conjunction of modulo functions, Info. Pro. Lett., 56, pp.15-17, 1995.

 

[AnBe94] M. Anselmo, A. Bertoni, On 2pfa’s and the Hadamard quotient of formal power series, Bull. Bel. Math. Soc. 1, pp.165-173, 1994.

 

[BeCaMo94] A. Bertoni, P. Campadelli, G. Molteni, On the approximability of energy function in Ising spin glasses, Journal of Physics A:Math. Gen., 27, pp.6719-6729, 1994.

 

[BeCa94] A. Bertoni, P. Campadelli,  On the approximability of energy function, Proc. ICANN, pp.1157-1160, 1994.

 

[BeMePi94] A. Bertoni, C. Mereghetti, G. Pighizzini, An optimal lower bound for nonregular languages, Info.Pro.Lett., 50, pp.289-292, 1994

 

[BeMePi94] A. Bertoni, C. Mereghetti, G. Pighizzini, On languages accepted with simultaneous complexity bounds and their ranking problem, MFCS 94, LNCS 841, pp.245-255, 1994.

 

[BeMa94] A. Bertoni, P. Massazza, A parallel algorithm for the Hadamard product of holonomic formal series, Int. Journ.of Alg. And Comp., Vol.4, N.4, pp.561-573, 1994.

 

[BeCu94] A.Bertoni, M.Cugiani, Sulla natura dell’insieme di una copertura dei punti razionali, Istituto Lombardo Radice (Rend. Sci.) A 127, pp. 227-232, 1994.

 

[BeCaMa93] A. Bertoni, P. Campadelli, A.Manfredi, Robust learning by single neuron,  5th WIRN, World Scientific, pp.192-198, 1993.

 

[AnBe93] M. Anselmo, A. Bertoni, On 2pfa’s and the Hadamard quotient of rational power series: an application, 5th Conf. Formal Power Series and Alg. Comb., Sez. Poster, pp.1-6, 1993.

 

[BeGo93]A.Bertoni, M.Goldwurm, On ranking 1-way finitely ambiguous NL languages and #P1-complete census functions, RAIRO Theo.Info. and Applications,Vol.27, n.2, pp.135-148, 1993.

 

[BeDo93]A.Bertoni, M.Dorigo, Implicit parallelism in genetic algorithms, Artificial Intelligence: an int. Jour., Vol.61, 2, pp.307-313, 1993.

 

[BeMaPiSa93]A.Bertoni, G:Mauri, G.Pighizzini, N.Sabadini, Algebraic and informational aspects of Zielonka’s theorem, Proc. Int. Conf. On Semigroups, World Scientific, pp.17-26, 1993.

 

[BeCaMa92]A.Bertoni, P.Campadelli, G:Mauri, PAC learning and neural networks, inv.lect., Proc. Conf. On Struct. from Physics to General Systems, World Scientific, pp.281-284, 1992.

 

[BeCaPaMo92]A.Bertoni, P.Campadelli, A.Morpurgo, S.Panizza, Polynomial uniform convergence of relative frequencies to probabilities, 4th NIPS, Morgan Kaufmann, pp.904-911, 1992.

 

[BeCaPaMo92]A.Bertoni, P.Campadelli, A.Morpurgo, S.Panizza, Polynomial uniform convergence and polynomial sample learnability, 5th ACM COLT, pp.265-271, 1992.

 

[BeCaPa92]A.Bertoni, P.Campadelli, S.Panizza, Learnability with fixed distribution, 4th It. Conf. Th. Comp. Sci., World Scientific, pp.66-79, 1992.

 

[ABCM92]B.Apolloni, A.Bertoni, P.Campadelli, G.Mauri, Formal models of learning by examples, 5th WIRN, Inv.Lect., World Scientific, pp.47-76, 1992.

 

[BeMaSa92] A. Bertoni, P. Massazza, N.Sabadini, Holonomic generating functions and context-free languages,  Int.Jour. of Found, Comp. Sci., vol.3, n.2, pp.181-191, 1992.

 

[BeBrCa91]A.Bertoni, R.Brivio, P.Campadelli, Stabilization and size of attraction basins in symmetric networks, 4th WIRN, World Scientific, pp.281-284, 1991.

 

[BeCaMoPo91]A.Bertoni, P.Campadelli, A.Morpurgo, R. Posenato, An algorithm for learning from positive examples classes of linearly separable boolean functions, 4th WIRN, World Scientific, pp.11-19, 1991.

 

[BeGoSa91]A.Bertoni, M.Goldwurm, N. Sabadini, The complexity of computing the number of strings of given lenght in context free languages, Theo.Comp.Sci., 1991.

 

[ApBeCaDF91]B.Apolloni, A.Bertoni, P.Campadelli, D. De Falco, Asymmetric Boltzmann Machines, Biological Cybernetics, 66, pp.61-70, 1991.

 

[BeCaMa91] A.Bertoni, P.Campadelli, G.Mauri, Some notes on Computational Learning, EATCS Bull., 43, pp.140-158, 1991.

 

[BeBrGo91]A.Bertoni, D.Bruschi, M.Goldwurm, Ranking and formal power series, Theo.Comp.Sci., 79, pp.25-35, 1991.

 

[BeCa91] A.Bertoni, P.Campadelli, Analysis of parallel and sequential Boltzmann machines, Proc. INNC, Paris, 1991.

 

[BeGoMa90]A.Bertoni, M.Goldwurm, P.Massazza, Counting functions and formal series in noncommuting variables, Info.Proc.Letters, 34, pp.117-121, 1990.

 

[BBJSY89]A.Bertoni, D.Bruschi, D.Joseph, M.Sitharan, P.Young, Generalized Boolean Hierarchies and the Boolean Hierarchy over RP, FCT89, Springer Verlag, pp.35-46, 1989.

 

[ApBeCaDF89]B.Apolloni, A.Bertoni, P.Campadelli, D. De Falco, Lyapunov functions and neural networks, 2th WIRN, World Scientific, pp.53-67, 1989.

 

[BeMaSa89]A.Bertoni, G:Mauri, N.Sabadini, Membership problems for regular and context-free languages, Information and Computation, 82, n.2, pp.135-150, 1989.

 

[ApBeCaDF89]B.Apolloni, A.Bertoni, P.Campadelli, D. De Falco, Neural Networks: deterministic and stochastic dynamics, Proc. Workshop  on Dyn. and sthoc. Processes, Lect.Notes in Physics, 335, pp.27-41, 1989.

 

[BeCaGr89]A.Bertoni, P.Campadelli, Grassani, Full Parallelism in Boltzmann machines, Proc. Neuronimes89: Int.Work.NN and their Appl., pp.361-370, 1989.

 

[BeGo89]A.Bertoni, M.Goldwurm, On the prefixes of a random trace and the membership problem for context-free trace languages, Proc. 5th AAECC Conf., LNCS 356, pp.35-60, 1989.

 

[BeCa89] A.Bertoni, P.Campadelli, Stabilization and reachability in antisymmetric networks, 1th WIRN, World Scientific, pp.18-27, 1989.

 

[BeCa89] A.Bertoni, P.Campadelli, Neural networks and non uniform circuits, 1th WIRN, World Scientific, pp.183-197, 1989.

 

[BeCaMo89]A.Bertoni, P.Campadelli, A. Morpurgo, Total stabilization in symmetric networks, Proc. Neuronimes88: Int.Work.NN and their Appl., pp.193-197, 1988.

 

[BeBrCaSa89]A.Bertoni, D.Bruschi, P.Campadelli, N.Sabadini, Massive parallelism in neural networks, Proc. Work. Compositionality and Concurrency, Rheifelden, 1988.

 

[ABMST88] M.A. Alberti, A. Bertoni, G.Mauri, N.Sabadini, M.Torelli, GALOIS: an instructional system for a first cours of university algebra, Proc. Ed. Comp. in Math., 87, Elsevier Sci. Pub., North Holland, pp.127-133, 1988.

 

[ABMST88] M.A. Alberti, A. Bertoni, G.Mauri, N.Sabadini, M.Torelli, Motivazioni didattiche e descrizione del sistema GALOIS per l’insegnamento dell’algebra, Proc.DIDAMATICA88, AICA, pp.291-302, 1988.

 

[BeMa88]A.Bertoni, G:Mauri, Informatica, logica e didattica, Atti XII Incontro di logica matematica, inv. lect., pp.155-164, 1988.

 

[BeGoMaSa88]A.Bertoni, M.Goldwurm,G.Mauri, N. Sabadini, Analysis of a class of algorithms for problems on trace languages, Proc. 4th AAECC Conf., LNCS 307, pp.202-214, 1988..

 

[BeGoSa87]A.Bertoni, M.Goldwurm, N. Sabadini, Computing the counting functions of context-free languages, STACS 87, LNCS 253, pp.206-226, 1987.

 

[BeMaSa88]A.Bertoni, G.Mauri, N. Sabadini, On the class NL with oracle, Journal of Computer and Artificial Intelligence, 6, n.5, pp.411-420, 1987.

 

[BeGoMaSa87]A.Bertoni, M.Goldwurm,G.Mauri, N.Sabadini, Parallel algorithms and the classification of problems, Proc. Wopplot, LNCS 253, pp.206-226, 1987.

 

[BeMaSa87]A.Bertoni, G.Mauri, N.Sabadini, Unambiguous regular trace languages, Proc.Coll.on Alg.Comb. in Comp.Sci., Soc. J.Bolyai, vol.42, North Holland, pp.113-123, 1987.

 

[BeBoMaSa87]A.Bertoni, M.C.Bollina, G.Mauri, N.Sabadini, On characterizing classes of efficienly parallelizable problems, Proc. Conf. VLSI Algorithms and Architectures, North Holland, pp.13-26, 1987.

 

[BeMaSa85]A.Bertoni, G.Mauri, N.Sabadini, Simulation among classes of Random Access Machines and equivalence among number succinctly represented, Ann.Discrete Mathematics, 25, pp.65-90, 1985.

 

[BeMaSa84]A.Bertoni, G.Mauri, N.Sabadini, Non deterministic machines and their generalizations, Parallel Processing: logic, organization and technology, Lect.Not.Phisics 196, pp.86-97, 1984.

 

[BeMaMiOr84]A.Bertoni, G.Mauri, P.A.Miglioli, M.Ornaghi, Abstract data types and their extension within a constructive logic, LNCS 173, pp.177-195, 1984.

 

[BeMaMi83]A.Bertoni, G.Mauri, P.A.Miglioli, On the power of model theory in specifying abstract data types and in capturing their recursiveness, Fundamenta Informaticae, Vol.2, pp.129-170, 1983.

 

[BeMaSa83]A.Bertoni, G.Mauri, N.Sabadini, Una classe di problemi vantaggiosamente parallelizzabili, Atti Conf. AICA 83, Vol.1, pp.375-386, 1983.

 

[BeMaSa82]A.Bertoni, G.Mauri, N.Sabadini, Context-free trace languages, 7th CAAP, Springer Verlag, pp.32-42, 1982.

 

[BeMaSa82]A.Bertoni, G.Mauri, N.Sabadini, Metodologie di disegno di programmi guidate dalle strutture ingresso-uscita: analisi formale e proposta di estensioni, Atti Conf. AICA 82, Vol.1, pp.259-262, 1982.

 

[BeMaSa82]A.Bertoni, G.Mauri, N.Sabadini, Equivalence and membership problems for regular trace languages, 9th  ICALP, LNCS 140, pp.26-37, 1982.

 

[BeMaSa82]A.Bertoni, G.Mauri, N.Sabadini, A hierarchy of regular trace languages and some combinatorial applications, Proc. 2nd   World Conf. On Math. At the Service of Man, Las Palmas, 146-153, 1982.

 

[BeBrMaSa81]A.Bertoni, M.Brambilla,  G.Mauri, N.Sabadini, An application of the theory of free partially commutative monoids: asymptotic density of trace languages, 10th MFCS, LNCS 118, pp.205-215, 1981.

 

[BeMaSa81]A.Bertoni, G.Mauri, N.Sabadini, Disegno di programmi guidato dalle strutture ingresso-uscita: un inquadramento teorica, Atti Conf. AICA 81, Vol.II, pp.663-669, 1981.

 

[BeMaSa81]A.Bertoni, G.Mauri, N.Sabadini, A characterization of the class of functions computable in polynamial time on Randon Access Machines, 13th ACM Symp. On Theoy of Computation, pp.168-178, 1981.

 

[BeMa81]A.Bertoni,  G.Mauri, On efficient computation of the coefficients of some polynamials with application to some enumeration problems, Information Processing Letters, Vol.12, pp.142-145, 1981.

 

[BeMaTo80]A.Bertoni,  G.Mauri, M.Torelli, Sulla complessità di alcuni problemi di conteggio, Calcolo, Vol. XVII, Fac. II, pp.163-174, 1980.

 

[BeMaMi8o]A.Bertoni,  G.Mauri, PA. Miglioli, Towards a theory of abstract data types: a discussion on problems and tools, Proc. 4th Conf. Sur la Progr., LNCS 83, pp.44-58, 1980.

 

[BeMaMiWi79]A.Bertoni,  G.Mauri, PA. Miglioli, M.Wirsing, On different approaches to abstract data types and the existence of recursive models, EATCS Bull., 9, pp.45-57, 1979.

 

[BeMaMi79]A.Bertoni,  G.Mauri, PA. Miglioli, A characterization of abstract data as model theoretic invariants, Proc. 6th ICALP, LNCS 71, pp.26-37, Springer, Berlin, 1979.

 

[BeMaMi79a]A.Bertoni,  G.Mauri, PA. Miglioli, Model theoretic aspects of abstract data specification, Coll. Math. Soc. Janos Bolya 26, pp. 181-193, North Holland, Amsterdam, 1979.

 

[BeMaTo79]A.Bertoni,  G.Mauri, M.Torelli, Three efficient algorithms for counting problems, Information Processing Letter, Vol.8, pp.50-53, 1979.

 

[BeHaMaTo78]A.Bertoni, G.Haus,  G.Mauri, M.Torelli, Analysis and Compacting of musical texts, Journal of Cybernetics, vol.8, pp.257-272, 1978.

 

[BeHaMaTo78a]A.Bertoni, G.Haus,  G.Mauri, M.Torelli, A mathematical model for analysing and structuring musical texts, Interface, Vol.7, pp.31-43, 1978.