Katja Losemann
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| MSO queries on trees: enumerating answers under updates 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) | 2018-04-23 | Paper |
| Deciding definability by deterministic regular expressions Journal of Computer and System Sciences | 2017-06-30 | Paper |
| Closure properties and descriptional complexity of deterministic regular expressions Theoretical Computer Science | 2016-04-01 | Paper |
| The complexity of regular expressions and property paths in SPARQL ACM Transactions on Database Systems | 2015-09-03 | Paper |
| Deciding definability by deterministic regular expressions Lecture Notes in Computer Science | 2013-03-18 | Paper |
| Descriptional complexity of deterministic regular expressions Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Research outcomes over time
This page was built for person: Katja Losemann
