default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimiliano Goldwurm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Massimiliano Goldwurm, Marco Vignati:
Some Properties of the Rate Functions of Large Deviations for Symbol Statistics. ICTCS 2024: 326-339- 2023
- [j28]Massimiliano Goldwurm
, Jianyi Lin, Marco Vignati:
Local limit laws for symbol statistics in bicomponent rational models. Theor. Comput. Sci. 970: 114051 (2023) - [c21]Massimiliano Goldwurm, Marco Vignati:
Large Deviation Properties for Pattern Statistics in Primitive Rational Models. ICTCS 2023: 192-205 - [i2]Massimiliano Goldwurm, Marco Vignati:
Large deviation properties for pattern statistics in primitive rational models. CoRR abs/2306.07877 (2023) - 2021
- [i1]Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
Local limit laws for symbol statistics in bicomponent rational models. CoRR abs/2102.09478 (2021) - 2020
- [c20]Cyril Banderier, Massimiliano Goldwurm:
Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs. CiE 2020: 251-263
2010 – 2019
- 2019
- [c19]Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
Analysis of Symbol Statistics in Bicomponent Rational Models. DLT 2019: 306-318 - [c18]Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
Saddle Point Method in the analysis of pattern statistics for regular languages. ICTCS 2019: 78-90 - 2018
- [j27]Massimiliano Goldwurm, Jianyi Lin, Francesco Saccà:
On the complexity of clustering with relaxed size constraints in fixed dimension. Theor. Comput. Sci. 717: 37-46 (2018) - [c17]Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models. DCFS 2018: 114-125 - 2017
- [j26]Paola Campadelli, Giovanni Pighizzini, Massimiliano Goldwurm:
Preface. Theor. Comput. Sci. 664: 1 (2017) - [j25]Paola Campadelli, Massimiliano Goldwurm, Giovanni Pighizzini:
Alberto Bertoni: A scientist and a friend. Theor. Comput. Sci. 664: 2-11 (2017) - 2016
- [j24]Jianyi Lin, Alberto Bertoni, Massimiliano Goldwurm:
Exact algorithms for size constrained 2-clustering in the plane. Theor. Comput. Sci. 629: 80-95 (2016) - [c16]Massimiliano Goldwurm, Jianyi Lin, Francesco Saccà:
On the Complexity of Clustering with Relaxed Size Constraints. AAIM 2016: 26-38 - 2015
- [c15]Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin:
Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane. SOFSEM 2015: 128-139 - 2014
- [c14]Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin, Linda Pini:
Size-constrained 2-clustering in the plane with Manhattan distance. ICTCS 2014: 33-44 - 2012
- [j23]Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin, Francesco Saccà:
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results. Fundam. Informaticae 115(1): 125-139 (2012) - 2010
- [j22]Luca Breveglieri, Stefano Crespi-Reghizzi, Massimiliano Goldwurm:
Efficient recognition of trace languages defined by repeat-until loops. Inf. Comput. 208(8): 969-981 (2010)
2000 – 2009
- 2009
- [j21]Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati:
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases. Fundam. Informaticae 91(2): 231-249 (2009) - 2008
- [j20]Isabella Cattinelli, Massimiliano Goldwurm, N. Alberto Borghese:
Interacting with an artificial partner: modeling the role of emotional aspects. Biol. Cybern. 99(6): 473-489 (2008) - 2007
- [c13]Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati:
On the Complexity of Unary Tiling-Recognizable Picture Languages. STACS 2007: 381-392 - [c12]Massimiliano Goldwurm, Roberto Radicioni:
Average Value and Variance of Pattern Statistics in Rational Models. CIAA 2007: 62-72 - 2006
- [j19]Paola Campadelli, Christian Choffrut, Massimiliano Goldwurm, Mauro Torelli:
Preface. RAIRO Theor. Informatics Appl. 40(2) (2006) - [j18]Massimiliano Goldwurm, Roberto Radicioni:
Probabilistic models for pattern statistics. RAIRO Theor. Informatics Appl. 40(2): 207-225 (2006) - [j17]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
Local Limit Properties for Pattern Statistics and Rational Models. Theory Comput. Syst. 39(1): 209-235 (2006) - [j16]Massimiliano Goldwurm, Violetta Lonati:
Pattern statistics and Vandermonde matrices. Theor. Comput. Sci. 356(1-2): 153-169 (2006) - 2005
- [c11]Massimiliano Goldwurm, Violetta Lonati:
Pattern Occurrences in Multicomponent Models. STACS 2005: 680-692 - 2004
- [j15]Diego de Falco, Massimiliano Goldwurm, Violetta Lonati:
Frequency of symbol occurrences in bicomponent stochastic models. Theor. Comput. Sci. 327(3): 269-300 (2004) - [c10]Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
On the Maximum Coefficients of Rational Formal Series in Commuting Variables. Developments in Language Theory 2004: 114-126 - [c9]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. STACS 2004: 117-128 - 2003
- [j14]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
On the number of occurrences of a symbol in words of regular languages. Theor. Comput. Sci. 302(1-3): 431-456 (2003) - [c8]Diego de Falco, Massimiliano Goldwurm, Violetta Lonati:
Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models. Developments in Language Theory 2003: 242-253 - 2001
- [j13]Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation for Finitely Ambiguous Context-free Languages. RAIRO Theor. Informatics Appl. 35(6): 499-512 (2001) - [c7]Massimiliano Goldwurm, Beatrice Palano, Massimo Santini:
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. STACS 2001: 305-316 - 2000
- [j12]Massimiliano Goldwurm, Massimo Santini:
Clique polynomials have a unique root of smallest modulus. Inf. Process. Lett. 75(3): 127-132 (2000) - [j11]Christian Choffrut, Massimiliano Goldwurm:
Timed Automata with Periodic Clock Constraints. J. Autom. Lang. Comb. 5(4): 371-403 (2000) - [c6]Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. STACS 2000: 567-580
1990 – 1999
- 1999
- [j10]Christian Choffrut, Massimiliano Goldwurm:
Determinants and Möbius functions in trace monoids. Discret. Math. 194(1-3): 239-247 (1999) - 1998
- [j9]Alessandro Avellone, Massimiliano Goldwurm:
Analysis of algorithms for the recognition of rational and context-free trace languages. RAIRO Theor. Informatics Appl. 32(4-6): 141-152 (1998) - 1995
- [j8]Massimiliano Goldwurm:
Random Generation of Words in an Algebraic Language in Linear Binary Space. Inf. Process. Lett. 54(4): 229-233 (1995) - [j7]Christian Choffrut, Massimiliano Goldwurm:
Rational Transductions and Complexity of Counting Problems. Math. Syst. Theory 28(5): 437-450 (1995) - [p1]Alberto Bertoni, Massimiliano Goldwurm, Giancarlo Mauri, Nicoletta Sabadini:
Counting Techniques for Inclusion, Equivalence and Membership Problems. The Book of Traces 1995: 131-163 - 1993
- [j6]Alberto Bertoni, Massimiliano Goldwurm:
On Ranking 1-Way Finitely Ambiguous NL Languages and #P1-Complete Census Functions. RAIRO Theor. Informatics Appl. 27(2): 135-148 (1993) - 1992
- [j5]Massimiliano Goldwurm:
Probabilistic Estimation of the Number of Prefixes of a Trace. Theor. Comput. Sci. 92(2): 249-268 (1992) - [c5]Christian Choffrut, Massimiliano Goldwurm:
Rational Transductions and Complexity of Counting Problems. MFCS 1992: 181-190 - 1991
- [j4]Alberto Bertoni, Danilo Bruschi, Massimiliano Goldwurm:
Ranking and Formal Power Series. Theor. Comput. Sci. 79(1): 25-35 (1991) - [j3]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. Theor. Comput. Sci. 86(2): 325-342 (1991) - 1990
- [j2]Massimiliano Goldwurm:
Some Limit Distributions in Analysis of Algorithms for Problems on Trace Languages. Int. J. Found. Comput. Sci. 1(3): 265-276 (1990) - [j1]Alberto Bertoni, Massimiliano Goldwurm, Paolo Massazza:
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables. Inf. Process. Lett. 34(3): 117-121 (1990)
1980 – 1989
- 1987
- [c4]Alberto Bertoni, Massimiliano Goldwurm:
On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages. AAECC 1987: 35-59 - [c3]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Computing the Counting Function of Context-Free Languages. STACS 1987: 169-179 - 1986
- [c2]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Analysis of a Class of Algorithms for Problems on Trace Languages. AAECC 1986: 202-214 - [c1]Alberto Bertoni, Massimiliano Goldwurm, Giancarlo Mauri, Nicoletta Sabadini:
Parallel Algorithms and the Classification of Problems. WOPPLOT 1986: 206-226
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
