EDBT 2026 Demo / reviewers in the wild / expert
Daniel Kirsten
dblp:59/1742
· DBLP profile ↗
18ranked-venue papers
18as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 18 · 18 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
4 papers |
Logic in computer science · 91% Automata and formal languages · 9% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › concurrency theory › trace monoids
star problem |
0.1 | 4 | 2002 | The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4 · Inf. Comput. 2002 The Star Problem in Trace Monoids: Reductions Beyond C4 · ICALP 2001 Two Techniques in the Area of the Star Problem · ICALP 1999 |
Logic in computer science › concurrency theory
trace monoids |
0.1 | 4 | 2002 | The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4 · Inf. Comput. 2002 The Star Problem in Trace Monoids: Reductions Beyond C4 · ICALP 2001 Two Techniques in the Area of the Star Problem · ICALP 1999 |
Automata and formal languages › regular languages
finite power property |
0.0 | 1 | 1999 | A Connection between the Star Problem and the Finite Power Property in Trace Monoids · ICALP 1999 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | An algebraic characterization of semirings for which the support of every recognizable series is recognizable
Daniel Kirsten |
Theor. Comput. Sci. | 1 |
| 2012 | Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Daniel Kirsten |
Theor. Comput. Sci. | 1 |
| 2011 | Some Variants of the Star Height Problem
Daniel Kirsten |
MFCS | 1 |
| 2011 | Recognizability of the support of recognizable series over the semiring of the integers is undecidable
Daniel Kirsten, Karin Quaas |
Inf. Process. Lett. | 1 |
| 2009 | The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
Daniel Kirsten |
Developments in Language Theory | 1 |
| 2009 | An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
Daniel Kirsten |
MFCS | 1 |
| 2009 | Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus AutomataabstractThis paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characterization involving so-called metatransitions and an application of results from the structure theory of finite semigroups. It is noteworthy that the equivalence problem is known to be undecidable for polynomially ambiguous automata. Daniel Kirsten, Sylvain Lombardy |
STACS | 1 |
| 2006 | A Burnside Approach to the Finite Substitution Problem
Daniel Kirsten |
Theory Comput. Syst. | 1 |
| 2004 | Distance Desert Automata and the Star Height One Problem
Daniel Kirsten |
FoSSaCS | 1 |
| 2004 | Desert Automata and the Finite Substitution Problem
Daniel Kirsten |
STACS | 1 |
| 2003 | Two techniques in the area of the star problem in trace monoids
Daniel Kirsten, Jerzy Marcinkowski |
Theor. Comput. Sci. | 1 |
| 2002 | The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4
Daniel Kirsten |
Inf. Comput. | 1 |
| 2002 | The finite power problem revisited
Daniel Kirsten |
Inf. Process. Lett. | 1 |
| 2001 | The Star Problem in Trace Monoids: Reductions Beyond C4
Daniel Kirsten |
ICALP | 1 |
| 2001 | Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids
Daniel Kirsten, Gwénaël Richomme |
Theory Comput. Syst. | 1 |
| 1999 | A Connection between the Star Problem and the Finite Power Property in Trace Monoids
Daniel Kirsten |
ICALP | 1 |
| 1999 | Two Techniques in the Area of the Star Problem
Daniel Kirsten, Jerzy Marcinkowski |
ICALP | 1 |
| 1999 | Some Undecidability Results Related to the Star Problem in Trace Monoids
Daniel Kirsten |
STACS | 1 |