Katja Losemann

According to our database, Katja Losemann authored at least 9 papers between 2009 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

Deciding definability by deterministic regular expressions.

Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens

J. Comput. Syst. Sci., 2017

2016

Closure properties and descriptional complexity of deterministic regular expressions.

Katja Losemann, Wim Martens, Matthias Niewerth

Theor. Comput. Sci., 2016

2015

Foundations of Regular Languages for Processing RDF and XML.

Katja Losemann

PhD thesis, 2015

2014

MSO queries on trees: enumerating answers under updates.

Katja Losemann, Wim Martens

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

The complexity of regular expressions and property paths in SPARQL.

Katja Losemann, Wim Martens

ACM Trans. Database Syst., 2013

2012

Foundations of regular expressions in XML schema languages and SPARQL.

Katja Losemann

Proceedings of the ACM SIGMOD/PODS PhD Symposium 2012, Scottsdale, AZ, USA, May 20, 2012, 2012

The complexity of evaluating path expressions in SPARQL.

Katja Losemann, Wim Martens

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Descriptional Complexity of Deterministic Regular Expressions.

Katja Losemann, Wim Martens, Matthias Niewerth

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2009

PEPPA: a project for evolutionary predator prey algorithms.

Hendrik Blom, Christiane Küch, Katja Losemann, Chris Schwiegelshohn

Proceedings of the Genetic and Evolutionary Computation Conference, 2009