| Timed automata with periodic clock constraints C Choffrut, M Goldwurm Journal of Automata, Languages and Combinatorics 5 (4), 371-404, 2000 | 69 | 2000 |
| Clique polynomials have a unique root of smallest modulus M Goldwurm, M Santini Information Processing Letters 75 (3), 127-132, 2000 | 57 | 2000 |
| The complexity of computing the number of strings of given length in context-free languages A Bertoni, M Goldwurm, N Sabadini Theoretical Computer Science 86 (2), 325-342, 1991 | 34 | 1991 |
| On the number of occurrences of a symbol in words of regular languages A Bertoni, C Choffrut, M Goldwurm, V Lonati Theoretical Computer Science 302 (1-3), 431-456, 2003 | 32 | 2003 |
| Random generation of words in an algebraic language in linear binary space M Goldwurm Information Processing Letters 54 (4), 229-233, 1995 | 30 | 1995 |
| Size constrained distance clustering: separation properties and some complexity results A Bertoni, M Goldwurm, J Lin, F Saccà Fundamenta Informaticae 115 (1), 125-139, 2012 | 23 | 2012 |
| Random generation and approximate counting of ambiguously described combinatorial structures A Bertoni, M Goldwurm, M Santini STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science …, 2000 | 21 | 2000 |
| Counting techniques for inclusion, equivalence and membership problems A Bertoni, M Goldwurm, G Mauri, N Sabadini The book of traces, 131-163, 1995 | 21 | 1995 |
| Analysis of algorithms for the recognition of rational and context-free trace languages A Avellone, M Goldwurm RAIRO-Theoretical Informatics and Applications 32 (4-6), 141-152, 1998 | 19 | 1998 |
| Interacting with an artificial partner: modeling the role of emotional aspects I Cattinelli, M Goldwurm, NA Borghese Biological cybernetics 99 (6), 473-489, 2008 | 16 | 2008 |
| Rational transductions and complexity of counting problems C Choffrut, M Goldwurm Mathematical systems theory 28 (5), 437-450, 1995 | 15 | 1995 |
| Computing the counting function of context-free languages A Bertoni, M Goldwurm, N Sabadini STACS 87: 4th Annual Symposium on Theoretical Aspects of Computer Science …, 1987 | 13 | 1987 |
| On the complexity of unary tiling-recognizable picture languages A Bertoni, M Goldwurm, V Lonati STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007 | 12 | 2007 |
| Random generation for finitely ambiguous context-free languages A Bertoni, M Goldwurm, M Santini RAIRO-Theoretical Informatics and Applications 35 (6), 499-512, 2001 | 12 | 2001 |
| Ranking and formal power series A Bertoni, D Bruschi, M Goldwurm Theoretical computer science 79 (1), 25-35, 1991 | 12 | 1991 |
| Counting problems and algebraic formal power series in noncommuting variables A Bertoni, M Goldwurm, P Massazza Information processing letters 34 (3), 117-121, 1990 | 12 | 1990 |
| Analysis of a class of algorithms for problems on trace languages A Bertoni, M Goldwurm, N Sabadini Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer …, 1988 | 12 | 1988 |
| The complexity of unary tiling recognizable picture languages: Nondeterministic and unambiguous cases A Bertoni, M Goldwurm, V Lonati Fundamenta Informaticae 91 (2), 231-249, 2009 | 11 | 2009 |
| Frequency of symbol occurrences in bicomponent stochastic models D de Falco, M Goldwurm, V Lonati Theoretical computer science 327 (3), 269-300, 2004 | 10 | 2004 |
| Determinants and Möbius functions in trace monoids C Choffrut, M Goldwurm Discrete mathematics 194 (1-3), 239-247, 1999 | 10 | 1999 |
Violetta LonatiRicercatrice, Dipartimento di Informatica, Università degli Studi di MilanoE-mail confirmado em di.unimi.it
