The following pages link to Massimiliano Goldwurm (Q288797):
Displaying 46 items.
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- Obituary: Alberto Bertoni: a scientist and a friend (Q517027) (← links)
- Random generation of words in an algebraic language in linear binary space (Q673672) (← links)
- Frequency of symbol occurrences in bicomponent stochastic models (Q703573) (← links)
- A local limit property for pattern statistics in bicomponent stochastic models (Q777993) (← links)
- (Q910244) (redirect page) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- Efficient recognition of trace languages defined by repeat-until loops (Q989291) (← links)
- Interacting with an artificial partner: modeling the role of emotional aspects (Q999435) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- Determinants and Möbius functions in trace monoids (Q1297486) (← links)
- On the number of occurrences of a symbol in words of regular languages. (Q1401339) (← links)
- On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
- Number of prefixes in trace monoids: clique polynomials and dependency graphs (Q2106610) (← links)
- Analysis of symbol statistics in bicomponent rational models (Q2327566) (← links)
- Local limit properties for pattern statistics and rational models (Q2432535) (← links)
- Pattern statistics and Vandermonde matrices. (Q2490816) (← links)
- Ranking and formal power series (Q2641104) (← links)
- (Q2762513) (← links)
- On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
- (Q2883188) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES (Q3357551) (← links)
- Probabilistic models for pattern statistics (Q3431436) (← links)
- Average Value and Variance of Pattern Statistics in Rational Models (Q3503895) (← links)
- On the Complexity of Unary Tiling-Recognizable Picture Languages (Q3590949) (← links)
- The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases (Q3633999) (← links)
- (Q3766850) (← links)
- (Q3773366) (← links)
- (Q3793747) (← links)
- (Q4452066) (← links)
- (Q4453469) (← links)
- (Q4501563) (← links)
- (Q4514735) (← links)
- (Q4729377) (← links)
- Rational transductions and complexity of counting problems (Q4850332) (← links)
- Rational transductions and complexity of counting problems (Q5096829) (← links)
- Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane (Q5175099) (← links)
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions (Q5286060) (← links)
- STACS 2004 (Q5309693) (← links)
- STACS 2005 (Q5710718) (← links)
- Developments in Language Theory (Q5711947) (← links)
- Preface (Q5898759) (← links)
- Local limit laws for symbol statistics in bicomponent rational models (Q6168079) (← links)
