Christian Mathissen

dblp:92/3064 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 4 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
3 papers
Automata and formal languages · 61% Graph algorithms and graph theory · 17% Computational complexity · 13%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › tree languages
regular trees
0.322013
Isomorphism of regular trees and words · Inf. Comput. 2013
Isomorphism of Regular Trees and Words · ICALP (2) 2011
Graph algorithms and graph theory › graph algorithms
tree algorithms
0.212013
Isomorphism of regular trees and words · Inf. Comput. 2013
Computational complexity › decision problems
isomorphism problems
0.112011
Isomorphism of Regular Trees and Words · ICALP (2) 2011
Automata and formal languages
tree automata
0.112011
Isomorphism of Regular Trees and Words · ICALP (2) 2011
Automata and formal languages
formal power series
0.112008
Weighted Logics for Nested Words and Algebraic Formal Power Series · ICALP (2) 2008
Automata and formal languages › pushdown automata
nested words
0.112008
Weighted Logics for Nested Words and Algebraic Formal Power Series · ICALP (2) 2008
Logic in computer science
weighted logics
0.112008
Weighted Logics for Nested Words and Algebraic Formal Power Series · ICALP (2) 2008
YearPublicationVenuePosition
2013 Isomorphism of regular trees and words
Markus Lohrey, Christian Mathissen
Inf. Comput.2
2011 Isomorphism of Regular Trees and Words
Markus Lohrey, Christian Mathissen
ICALP (2)2
2010 Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Niko Haubold, Markus Lohrey, Christian Mathissen
Developments in Language Theory3
2010 Definable transductions and weighted logics for texts
Christian Mathissen
Theor. Comput. Sci.1
2009 Existential MSO over two successors is strictly weaker than over linear orders
Christian Mathissen
Theor. Comput. Sci.1
2008 Weighted Logics for Nested Words and Algebraic Formal Power Series
Christian Mathissen
ICALP (2)1
2007 Definable Transductions and Weighted Logics for Texts
Christian Mathissen
Developments in Language Theory1