7 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.LO2012★ 7 cited
L-Recursion and a new Logic for Logarithmic Space
Martin Grohe, Berit Grußien, André Hernich +1
We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic…
cs.LO2009★ 1 cited
Capturing Polynomial Time on Interval Graphs
Bastian Laubner
We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown t…
math.DS2006★ 1 cited
A Combinatorial Classification of Postsingularly Finite Complex Exponential Maps
Bastian Laubner, Dierk Schleicher, Vlad Vicol
We give a combinatorial classification of postsingularly finite exponential maps in terms of external addresses starting with the entry 0. This is an extension of the classificatio…