´

Dr. Katja Losemann

Contact data

Dr. Katja Losemann

Angewandte Informatik VII

Universität Bayreuth

95440 Bayreuth

 

 

Email: katja.losemann (at) uni-bayreuth.de

TEACHING

since October 2011 (University Bayreuth)

Tutor for students in the "Introduction for CS" and "Theoretical CS" lecture.

until September 2011 (TU Dortmund)

Tutor for students in the "Hardware"- and "Software"-laboratory, in the seminar "XML - Theory and Practice", and the "Foundations of CS" lecture.

 

PUPLICATIONS

2014

Katja Losemann, Wim Martens: MSO Queries on Trees: Enumerating Answers under Updates. CSL-LICS'14, Vienna

2013

Katja Losemann, Wim Martens: The Complexity of Regular Expressions and Property Paths in SPARQL. ACM Trans. Database Syst (TODS). 38(4): 24 (2013)

Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens: Deciding Definability by Deterministic Regular Expressions. FoSSaCS 2013: 289-304

2012

Katja Losemann, Wim Martens, Matthias Niewerth: Descriptional Complexity of Deterministic Regular Expressions. MFCS 2012: 643-654

Katja Losemann, Wim Martens: The Complexity of Evaluating Path Expressions in SPARQL. PODS 2012: 101-112

Katja Losemann: Foundations of Regular Expressions in XML Schema Languages and SPARQL. SIGMOD/PODS PhD Symposium 2012: 39-44

2010

Katja Losemann: Boolesche Operationen auf Deterministischen Regulären Ausdrücken. master thesis at TU Dortmund

2009

Hendrik Blom, Christiane Küch, Katja Losemann, Chris Schwiegelshohn: PEPPA: a project for evolutionary predator prey algorithms. GECCO (Companion) 2009: 1993-1998

 

GRANTS

2014 FLOC travel grant

2013 ETAPS Student Stipend

2012 ACM SIGMOD/PODS travel grant

 

 

Universität Bayreuth -