( en | de | ru )

 

Disambiguation of "Bertoni, Alberto"

Author of the publication

copydeleteadd this publication to your clipboard
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.

, and . Inf. Process. Lett., 12 (3): 142-145 (1981)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vanessa Bertoni

Juan Márquez Bertoni

Alberto Fierro

Alberto Moreira

Alberto Coda

 

Other publications of authors with the same name

Equations of Formal Power Series over Non Commutative Semiring.. MFCS, page 185-190. Mathematical Institute of the Slovak Academy of Sciences, (1973)Corrigendum: An Optimal Lower Bound for Nonregular Languages., , and . Inf. Process. Lett., 52 (6): 339 (1994)see: Inf. Process. Lett. 50(6): 289-292(1994).Counting Problems and Algebraic Formal Power Series in Noncommuting Variables., , and . Inf. Process. Lett., 34 (3): 117-121 (1990)Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering., , , and . WIRN, volume 234 of Frontiers in Artificial Intelligence and Applications, page 162-169. IOS Press, (2011)Regularity of Languages Defined by Formal Series with Isolated Cut Point., , and . NCMA, volume 282 of books@ocg.at, page 73-87. Austrian Computer Society, (2011)Learning functional linkage networks with a cost-sensitive approach., , , and . WIRN, volume 226 of Frontiers in Artificial Intelligence and Applications, page 52-61. IOS Press, (2010)Quantum Computing: 1-Way Quantum Automata., , and . Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 1-20. Springer, (2003)Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines.. ICALP, page 507-516. North-Holland, Amsterdam, (1972)Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem., , and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 82-93. Springer, (2013)Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures., , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 567-580. Springer, (2000)