Massimiliano Goldwurm

Theor. Comput. Sci., August, 2023

Large Deviation Properties for Pattern Statistics in Primitive Rational Models.

[BibT_eX]

[DOI]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2020

Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs.

[BibT_eX]

[DOI]

Cyril Banderier

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Saddle Point Method in the analysis of pattern statistics for regular languages.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Analysis of Symbol Statistics in Bicomponent Rational Models.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

On the complexity of clustering with relaxed size constraints in fixed dimension.

[BibT_eX]

[DOI]

Francesco Saccà

Theor. Comput. Sci., 2018

A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

Preface.

[BibT_eX]

[DOI]

Paola Campadelli

Giovanni Pighizzini

Theor. Comput. Sci., 2017

Alberto Bertoni: A scientist and a friend.

[BibT_eX]

[DOI]

Paola Campadelli

Giovanni Pighizzini

Theor. Comput. Sci., 2017

2016

Exact algorithms for size constrained 2-clustering in the plane.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the Complexity of Clustering with Relaxed Size Constraints.

[BibT_eX]

[DOI]

Francesco Saccà

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

Size-constrained 2-clustering in the plane with Manhattan distance.

[BibT_eX]

[DOI]

Linda Pini

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2012

Size Constrained Distance Clustering: Separation Properties and Some Complexity Results.

[BibT_eX]

[DOI]

Francesco Saccà

Fundam. Informaticae, 2012

2010

Efficient recognition of trace languages defined by repeat-until loops.

[BibT_eX]

[DOI]

Luca Breveglieri

Stefano Crespi-Reghizzi

Inf. Comput., 2010

2009

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

2008

Interacting with an artificial partner: modeling the role of emotional aspects.

[BibT_eX]

[DOI]

Isabella Cattinelli

N. Alberto Borghese

Biol. Cybern., 2008

2007

Average Value and Variance of Pattern Statistics in Rational Models.

[BibT_eX]

[DOI]

Roberto Radicioni

Proceedings of the Implementation and Application of Automata, 2007

On the Complexity of Unary Tiling-Recognizable Picture Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Pattern statistics and Vandermonde matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Local Limit Properties for Pattern Statistics and Rational Models.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Probabilistic models for pattern statistics.

[BibT_eX]

[DOI]

Roberto Radicioni

RAIRO Theor. Informatics Appl., 2006

Preface.

[BibT_eX]

[DOI]

Paola Campadelli

Mauro Torelli

RAIRO Theor. Informatics Appl., 2006

2005

Pattern Occurrences in Multicomponent Models.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

2004

Frequency of symbol occurrences in bicomponent stochastic models.

[BibT_eX]

[DOI]

Diego de Falco

Theor. Comput. Sci., 2004

Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

On the Maximum Coefficients of Rational Formal Series in Commuting Variables.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

On the number of occurrences of a symbol in words of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models.

[BibT_eX]

[DOI]

Diego de Falco

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2001

Random Generation for Finitely Ambiguous Context-free Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.

[BibT_eX]

[DOI]

Beatrice Palano

Proceedings of the STACS 2001, 2001

2000

Timed Automata with Periodic Clock Constraints.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

Clique polynomials have a unique root of smallest modulus.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

1999

Determinants and Möbius functions in trace monoids.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Analysis of algorithms for the recognition of rational and context-free trace languages.

[BibT_eX]

[DOI]

Alessandro Avellone

RAIRO Theor. Informatics Appl., 1998

1995

Rational Transductions and Complexity of Counting Problems.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

Random Generation of Words in an Algebraic Language in Linear Binary Space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Counting Techniques for Inclusion, Equivalence and Membership Problems.

[BibT_eX]

[DOI]

Giancarlo Mauri

Proceedings of the Book of Traces, 1995

1993

On Ranking 1-Way Finitely Ambiguous NL Languages and #P<sub>1</sub>-Complete Census Functions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

1992

Probabilistic Estimation of the Number of Prefixes of a Trace.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Ranking and Formal Power Series.

[BibT_eX]

[DOI]

Danilo Bruschi

Theor. Comput. Sci., 1991

1990

Counting Problems and Algebraic Formal Power Series in Noncommuting Variables.

[BibT_eX]

[DOI]

Paolo Massazza

Inf. Process. Lett., 1990

Some Limit Distributions in Analysis of Algorithms for Problems on Trace Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

1987

Computing the Counting Function of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 1987

On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1987

1986

Parallel Algorithms and the Classification of Problems.

[BibT_eX]

[DOI]

Giancarlo Mauri

Proceedings of the WOPPLOT 86, 1986

Analysis of a Class of Algorithms for Problems on Trace Languages.

[BibT_eX]

[DOI]