BibTeX records: Katja Zeume

download as .bib file

@article{DBLP:journals/jcss/CzerwinskiDLM17,
  author       = {Wojciech Czerwinski and
                  Claire David and
                  Katja Losemann and
                  Wim Martens},
  title        = {Deciding definability by deterministic regular expressions},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {88},
  pages        = {75--89},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2017.03.011},
  doi          = {10.1016/J.JCSS.2017.03.011},
  timestamp    = {Mon, 03 Mar 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/CzerwinskiDLM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LosemannMN16,
  author       = {Katja Losemann and
                  Wim Martens and
                  Matthias Niewerth},
  title        = {Closure properties and descriptional complexity of deterministic regular
                  expressions},
  journal      = {Theor. Comput. Sci.},
  volume       = {627},
  pages        = {54--70},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.027},
  doi          = {10.1016/J.TCS.2016.02.027},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LosemannMN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/dnb/Losemann15,
  author       = {Katja Losemann},
  title        = {Foundations of Regular Languages for Processing {RDF} and {XML}},
  school       = {University of Bayreuth},
  year         = {2015},
  url          = {https://epub.uni-bayreuth.de/2536/},
  urn          = {urn:nbn:de:bvb:703-epub-2536-8},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Losemann15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csl/LosemannM14,
  author       = {Katja Losemann and
                  Wim Martens},
  editor       = {Thomas A. Henzinger and
                  Dale Miller},
  title        = {{MSO} queries on trees: enumerating answers under updates},
  booktitle    = {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), {CSL-LICS} 2014, Vienna, Austria,
                  July 14 - 18, 2014},
  pages        = {67:1--67:10},
  publisher    = {{ACM}},
  year         = {2014},
  url          = {https://doi.org/10.1145/2603088.2603137},
  doi          = {10.1145/2603088.2603137},
  timestamp    = {Fri, 21 Nov 2025 14:06:54 +0100},
  biburl       = {https://dblp.org/rec/conf/csl/LosemannM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tods/LosemannM13,
  author       = {Katja Losemann and
                  Wim Martens},
  title        = {The complexity of regular expressions and property paths in {SPARQL}},
  journal      = {{ACM} Trans. Database Syst.},
  volume       = {38},
  number       = {4},
  pages        = {24},
  year         = {2013},
  url          = {https://doi.org/10.1145/2494529},
  doi          = {10.1145/2494529},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tods/LosemannM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fossacs/CzerwinskiDLM13,
  author       = {Wojciech Czerwinski and
                  Claire David and
                  Katja Losemann and
                  Wim Martens},
  editor       = {Frank Pfenning},
  title        = {Deciding Definability by Deterministic Regular Expressions},
  booktitle    = {Foundations of Software Science and Computation Structures - 16th
                  International Conference, {FOSSACS} 2013, Held as Part of the European
                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2013,
                  Rome, Italy, March 16-24, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {289--304},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-37075-5\_19},
  doi          = {10.1007/978-3-642-37075-5\_19},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/fossacs/CzerwinskiDLM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/LosemannMN12,
  author       = {Katja Losemann and
                  Wim Martens and
                  Matthias Niewerth},
  editor       = {Branislav Rovan and
                  Vladimiro Sassone and
                  Peter Widmayer},
  title        = {Descriptional Complexity of Deterministic Regular Expressions},
  booktitle    = {Mathematical Foundations of Computer Science 2012 - 37th International
                  Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {643--654},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-32589-2\_56},
  doi          = {10.1007/978-3-642-32589-2\_56},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/LosemannMN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pods/LosemannM12,
  author       = {Katja Losemann and
                  Wim Martens},
  editor       = {Michael Benedikt and
                  Markus Kr{\"{o}}tzsch and
                  Maurizio Lenzerini},
  title        = {The complexity of evaluating path expressions in {SPARQL}},
  booktitle    = {Proceedings of the 31st {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
                  Principles of Database Systems, {PODS} 2012, Scottsdale, AZ, USA,
                  May 20-24, 2012},
  pages        = {101--112},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2213556.2213573},
  doi          = {10.1145/2213556.2213573},
  timestamp    = {Thu, 19 Feb 2026 16:18:02 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/LosemannM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigmod/Losemann12,
  author       = {Katja Losemann},
  editor       = {Xin Luna Dong and
                  M. Tamer {\"{O}}zsu},
  title        = {Foundations of regular expressions in {XML} schema languages and {SPARQL}},
  booktitle    = {Proceedings of the {ACM} {SIGMOD/PODS} PhD Symposium 2012, Scottsdale,
                  AZ, USA, May 20, 2012},
  pages        = {39--44},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2213598.2213609},
  doi          = {10.1145/2213598.2213609},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sigmod/Losemann12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/gecco/BlomKLS09,
  author       = {Hendrik Blom and
                  Christiane K{\"{u}}ch and
                  Katja Losemann and
                  Chris Schwiegelshohn},
  editor       = {Franz Rothlauf},
  title        = {{PEPPA:} a project for evolutionary predator prey algorithms},
  booktitle    = {Genetic and Evolutionary Computation Conference, {GECCO} 2009, Proceedings,
                  Montreal, Qu{\'{e}}bec, Canada, July 8-12, 2009, Companion Material},
  pages        = {1993--1998},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1570256.1570265},
  doi          = {10.1145/1570256.1570265},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/gecco/BlomKLS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.