| Publication | Date of Publication | Type |
|---|
| On languages accepted with simultaneous complexity bounds and their ranking problem | 2022-08-18 | Paper |
| Exact algorithms for size constrained 2-clustering in the plane | 2016-05-27 | Paper |
| ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES | 2015-04-23 | Paper |
| Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane | 2015-02-20 | Paper |
| A neural network algorithm for semi-supervised node label learning from unbalanced data | 2014-08-04 | Paper |
| Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem | 2013-06-28 | Paper |
| Regularity of languages defined by formal series with isolated cut point | 2012-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2883188 | 2012-05-11 | Paper |
| Learning functional linkage networks with a cost-sensitive approach | 2011-04-12 | Paper |
| THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES | 2011-03-30 | Paper |
| Trace monoids with idempotent generators and measure-only quantum automata | 2010-09-16 | Paper |
| Strong optimal lower bounds for Turing machines that accept nonregular languages | 2010-06-17 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| The Inclusion Problem of Context-Free Languages: Some Tractable Cases | 2009-07-07 | Paper |
| The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases | 2009-06-23 | Paper |
| Context-Free Grammars and XML Languages | 2009-03-26 | Paper |
| APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS | 2008-11-24 | Paper |
| Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| On the Complexity of Unary Tiling-Recognizable Picture Languages | 2007-09-03 | Paper |
| Local limit properties for pattern statistics and rational models | 2006-10-25 | Paper |
| Some formal tools for analyzing quantum automata. | 2006-05-18 | Paper |
| GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA | 2005-10-19 | Paper |
| Small size quantum automata recognizing some regular languages | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453468 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452048 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440374 | 2003-12-16 | Paper |
| On the number of occurrences of a symbol in words of regular languages. | 2003-08-17 | Paper |
| Regular languages accepted by quantum automata | 2003-01-14 | Paper |
| Random Generation for Finitely Ambiguous Context-free Languages | 2002-09-18 | Paper |
| A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation | 2002-06-17 | Paper |
| Analogies and differences between quantum and stochastic automata | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501563 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502528 | 2001-05-06 | Paper |
| Approximability of the ground state problem for certain Ising spin glasses | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373671 | 1998-06-11 | Paper |
| Efficient learning with equivalence queries of conjunctions of modulo functions | 1997-02-27 | Paper |
| On the approximability of the energy function of Ising spin glasses | 1996-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4844621 | 1996-05-05 | Paper |
| Corrigendum to ``An optimal lower bound for nonregular languages | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311851 | 1995-12-18 | Paper |
| A PARALLEL ALGORITHM FOR THE HADAMARD PRODUCT OF HOLONOMIC FORMAL SERIES | 1995-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4351322 | 1995-01-01 | Paper |
| An optimal lower bound for nonregular languages | 1994-07-21 | Paper |
| On 2PFA's and the Hadamard quotient of formal power series | 1994-06-15 | Paper |
| Implicit parallelism in genetic algorithms | 1993-10-17 | Paper |
| On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions | 1993-06-29 | Paper |
| HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES | 1993-01-16 | Paper |
| Asymmetric Boltzmann machines | 1992-06-27 | Paper |
| The complexity of computing the number of strings of given length in context-free languages | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971255 | 1992-06-25 | Paper |
| Ranking and formal power series | 1991-01-01 | Paper |
| Counting problems and algebraic formal power series in noncommuting variables | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3350802 | 1990-01-01 | Paper |
| Membership problems for regular and context-free trace languages | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729377 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793747 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730801 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3766850 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773366 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782783 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3763601 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683539 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750122 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3681938 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707378 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3311647 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340179 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657452 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947146 | 1982-01-01 | Paper |
| On efficient computation of the coefficients of some polynomials with applications to some enumeration problems | 1981-01-01 | Paper |
| An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969852 | 1981-01-01 | Paper |
| Sulla complessita di alcuni problemi di conteggio | 1980-01-01 | Paper |
| Three efficient algorithms for counting problems | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198051 | 1979-01-01 | Paper |
| ANALYSIS AND COMPACTING OF MUSICAL TEXTS | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140390 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4143209 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4175565 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4093371 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4093372 | 1975-01-01 | Paper |
| Grammatiche context-free su spazi metrici compatti | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4769997 | 1973-01-01 | Paper |
