Massimiliano Goldwurm

Introduction

Massimiliano Goldwurm received a degree in Mathematics in 1982 and a PhD in Computer Science in 1988. He was researcher and associate professor at the Department Scienze dell'Informazione of the State University of Milan.
Since 2015 he has been full professor at the Department of Mathematics of the same university. His research interests lie within the areas of formal languages, computational complexity and analysis of algorithms. In particular he has considered generating functions and probabilistic methods as investigation tools. Specific subjects of his recent research concern the analysis of pattern statistics, the complexity of clustering problems, the design of algorithms for problems on trace languages and the classification of bidimensional languages.
 

Attività didattica

• Fondamenti dell'Informatica 1
(dall'a.a. 2015/16, corso complementare, laurea magistrale in Matematica, 6 crediti).

• Algoritmi
(dall'a.a. 2015/16, corso complementare, laurea triennale in Matematica, 9 crediti).

• Metodi probabilistici per l'Informatica
(dall'a.a. 2014/15, corso complementare, laurea magistrale in Informatica, 6 crediti)

• Algoritmi e strutture dati
(dall'a.a. 1995/96 al 2015/16, corso fondamentale, laurea triennale in Informatica, 12 crediti fino al 2011, poi 9 crediti).

• Complementi di algoritmi e strutture dati
(a.a. 2014/15, corso complementare, laurea triennale in Informatica, 6 crediti).

Publications (from 2003)

• Massimiliano Goldwurm, Jianyi Lin, Marco Vignati,
  A local limit property for pattern statistics in bicomponent stochastic models ,
  Proceedings 20th DFCS, International Conference on Descriptional Complexity of Formal Systems,
  Lecture Notes in Computer Science n.10952, Springer, pp. 114-125, 2018 (file pdf) .
  

  ---

• M. Goldwurm, J. Lin, F. Saccà
  On the complexity of clustering with relaxed size constraints in fixed dimension,
  Theoretical Computer Science, vol. 717, pp. 37-46, 2018, (file pdf) .
  

  ---

• M. Goldwurm, J. Lin, F. Saccà
  On the complexity of clustering with relaxed size constraints ,
  Proceedings AAIM 2016, 11th International Conference, Algorithmic Aspects in Information and Management,
  Lecture Notes in Computer Science n.9778, pp. 26-38, 2016.
  

  ---

• J. Lin, A. Bertoni, M. Goldwurm,
  Exact Algorithms for Size Constrained 2-Clustering in the Plane,
  Theoretical Computer Science, vol. 629, pp. 80-95, 2016 (file pdf) .
  

  ---

• A. Bertoni, M. Goldwurm, J. Lin,
  Exact algorithms for 2-clustering with size-constraints in the Euclidean plane,
  Proceedings SOFSEM 2015, 41st International Conference on Current Trends in Theory and Practice of Computer Science,
  Lecture Notes in Computer Science n.8939, pp. 128-139, Gennaio 2015.
  

  ---

• A. Bertoni, M. Goldwurm, J. Lin, L. Pini,
  Size-constrained 2-clustering in the plane with Manhattan distance,
  Proceedings 15th ICTCS, Italian Conference on Theoretical Computer Science, Perugia, September 2014,
  http://ceur-ws.org/Vol-1231/, pp. 33-44, 2014.
  

  ---

• A. Bertoni, M. Goldwurm, J. Lin, F. Saccà
  Size constrainted distance clustering: separation properties and some complexity results,
  Fundamenta Informaticae, vol. 115 (1), pp. 125-139, 2012 (file pdf) .
  

  ---

• L. Breveglieri, S. Crespi Reghizzi, M. Goldwurm,
  Efficient recognition of trace languages defined by repeat-until loops,
  Information and Computation, vol. 208 (8), pp. 969-981, 2010 (file pdf).
  Also presented at WORDS 2009, International Conference, Salerno, September 2009.



---

• L. Breveglieri, S. Crespi Reghizzi, M. Goldwurm,
  Integer compositions and syntactic trees of repeat-until programs (file pdf),
  Workshop DNTTT'08, Devolopments and New Tracks in Trace Theory, Cremona, 9-11 Ottobre 2008.
  Rapporto interno n. 323-08, Dip. Scienze dell'Informazione, Università degli Studi di Milano.



---

• A. Bertoni, M. Goldwurm, V. Lonati,
  The complexity of unary tiling recognizable picture languages: nondeterministic and unambiguous cases.
  Fundamenta Informaticae, vol. 91 (2), pp. 231-249, 2009 (file pdf).



---

• I. Cattinelli, M. Goldwurm, N.A. Borghese,
  Interacting with an artificial partner: the role of emotional aspects.
  Biological Cybernetics, vol. 99, pp. 473-489, 2008.



---

• A. Bertoni, M. Goldwurm, V. Lonati,
  On the complexity of unary tiling-recognizable picture languages.
  Proceedings of STACS 2007, 24th International Symposium on Theoretical Aspects of Computer Science,
  Lecture Notes in Computer Science n. 4393 (Springer-Verlag), pp. 381-392, 2007.



---

• M. Goldwurm, R. Radicioni,
  Average value and variance of pattern statistics and rational models.
  Proceedings of CIAA 2007, 24th International Conference on Implementation and Application of Automata,
  Lecture Notes in Computer Science n. 4783 (Springer-Verlag), pp. 62-72, 2007 (file pdf).



---

• M. Goldwurm, R. Radicioni,
  Probabilistic models for pattern statistics.
  R.A.I.R.O. Theoretical Informatics and Applications, volume 40, pages 207-225, July 2006.



---

• M. Goldwurm, V. Lonati,
  Pattern statistics and Vandermonde matrices.
  Theoretical Computer Science, volume 356 (N.1-2), pages 153-169, May 2006 (file pdf).



---

• M. Goldwurm, V. Lonati,
  Pattern statistics in multicomponent models.
  Proceedings of STACS 2005, 22nd International Symposium on Theoretical Aspects of Computer Science,
  V. Diekert and B. Durand Editors, Lecture Notes in Computer Science n. 3404 (Springer-Verlag), pp. 680-692, 2005 (file ps).



---

• M. Goldwurm, Jean-Guy Penaud, Nasser Saheb-Djahromi,
  Frequency of pattern occurrences in Motzkin words.
  Rapport interne du LaBRI n.1368-05, Laboratoire Bordelais de Recherche en Informatique, Universite' Bordeaux I, June 2005 (file pdf).

---

• A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati,
  Local limit properties for pattern statistics and rational models.
  Theory of Computing Systems, vol. 39 (1), pp. 209-235, 2006 (file pdf).

---

• C. Choffrut, M. Goldwurm, V. Lonati,
  On the maximum coefficients of rational formal series in commuting variables.
  Proceedings of DLT'04 , 8th Int. Conf. on Developments in Language Theory.
  Lecture Notes in Computer Science n. 3340 (Springer-Verlag), pp. 114-126, 2004 (original publication available at link).

---

• D. de Falco, M. Goldwurm, V. Lonati,
  Frequency of symbol occurrences in bicomponent stochastic models.
  Theoretical Computer Science, vol. 327, pp. 269-300, 2004 (file pdf).

---

• A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati,
  Local limit distributions in pattern statistics: beyond the Markovian models
  Proceedings STACS 2004, 21st International Symposium on Theoretical Aspects of Computer Science,
  Lecture Notes in Computer Science n.2996, pp. 117-128, March 2004.

---

• 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, pp. 431-456, 2003 (file pdf) .

---

• M. Goldwurm, M. Santini,
  Clique polynomials have a unique root of smallest modulus
  Information Processing Letters, vol. 75, pp. 127-132, 2000.

---

• C. Choffrut, M. Goldwurm,
  Timed automata with periodic clock constraints
  Journal of Automata, Languages and Combinatorics, vol. 5, pp. 371-403, 2000.