Veröffentlichungen

@preamble{{\newcommand{\Ju}{Ju}}}

@preamble{{\newcommand{\Ph}{Ph}}}

@preamble{{\newcommand{\Th}{Th}}}

@preamble{{\newcommand{\Ch}{Ch}}}

@preamble{{\newcommand{\Yu}{Yu}}}

@preamble{{\newcommand{\Zh}{Zh}}}

@misc{lauser08stud,
  author = {Alexander Lauser},
  title = {{Vergleich von Adaptionsstrategien f{\"u}r elliptische partielle Differentialgleichungen}},
  pages = {69},
  type = {{Studienarbeit Nr.~2156}},
  school = {Universit{\"a}t Stuttgart; Fakult{\"a}t Informatik,
		 Elektrotechnik und Informationstechnik. Institut
		 f{\"u}r Parallele und Verteilte Systeme, Abteilung
		 Simulation gro{\ss}er Systeme},
  publisher = {Universit{\"a}t Stuttgart; Fakult{\"a}t Informatik,
		 Elektrotechnik und Informationstechnik. Institut
		 f{\"u}r Parallele und Verteilte Systeme, Abteilung
		 Simulation gro{\ss}er Systeme},
  number = {2156},
  month = {Januar},
  year = {2008},
  language = {Deutsch},
  cr-category = {G.1.0 Numerical Analysis General,
                   G.1.2 Numerical Analysis Approximation,
                   G.1.8 Partial Differential Equations},
  ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/medoc.ustuttgart_fi/STUD-2156/STUD-2156.pdf},
  howpublished = {Studienarbeit: Universit{\"a}t Stuttgart, Institut f{\"u}r Parallele und Verteilte Systeme, Simulation gro{\ss}er Systeme},
  abstract = {Bei der Modellierung physikalischer Vorg{\"a}nge treten h{\"a}ufig partielle
      Differentialgleichungen auf, die meist nicht analytisch l{\"o}sbar sind. Deshalb
      ist eine numerische Behandlung der Gleichungen unumg{\"a}nglich, um zumindest
      n{\"a}herungsweise eine L{\"o}sung zu erhalten und dadurch R{\"u}ckschl{\"u}sse auf das
      Verhalten des durch die Gleichungen beschriebenen Systems zuzulassen. Das
      verwendete numerische Verfahren muss dabei zuverl{\"a}ssig und effizient sein, das
      hei{\ss}t es muss verl{\"a}sslich eine numerische L{\"o}sung von bestimmter Qualit{\"a}t
      liefern -- und das mit m{\"o}glichst wenig Zeit- und Speicheraufwand.
      
      In dieser Arbeit wurde ein numerisches Verfahren implementiert, das versucht,
      diese Ziele zu erreichen, indem die numerische L{\"o}sung schrittweise adaptiv an
      die Merkmale des Problems angepasst wird. Dieses adaptive Verfahren gibt dabei
      einen Rahmen vor, der durch Vorgabe konkreter Teilbausteine eine
      Adaptionsstrategie zur L{\"o}sung des Problems festlegt.
      
      Im Rahmen dieser Arbeit wurden Kombinationen unterschiedlicher
      Implementierungen dieser Bausteine anhand von vier Modellproblemen
      verschiedener Regularit{\"a}t miteinander verglichen und bewertet. Die dadurch
      gewonnenen Ergebnisse k{\"o}nnen eventuell bei der Wahl einer Adaptionsstrategie
      f{\"u}r ein gegebenes Problem behilflich sein und dem Entwickler des Verfahrens
      eine grobe Orientierung bei der Wahl der Module und Parameter geben.},
}

@mastersthesis{lauser09dipl,
  author = {Alexander Lauser},
  title = {{Fragmente einer Intervall-Logik}},
  school = {Universit{\"a}t Stuttgart; Fakult{\"a}t Informatik,
		 Elektrotechnik und Informationstechnik. Institut
		 f{\"u}r Formale Methoden der Informatik, Abteilung
		 Theoretische Informatik},
  address = {Stuttgart, Germany},
  publisher = {Universit{\"a}t Stuttgart; Fakult{\"a}t Informatik,
		 Elektrotechnik und Informationstechnik. Institut
		 f{\"u}r Formale Methoden der Informatik, Abteilung
		 Theoretische Informatik},
  pages = {77},
  type = {{Diplomarbeit Nr.~2823}},
  month = {M{\"a}rz},
  year = {2009},
  language = {Deutsch},
  cr-category = {F.4.1 Mathematical Logic, F.4.3 Formal Languages},
  ee = {ftp://ftp.informatik.uni-stuttgart.de/pub/library/medoc.ustuttgart_fi/DIP-2823/DIP-2823.pdf},
  howpublished = {Diplomarbeit: Universit{\"a}t Stuttgart, Institut f{\"u}r Formale Methoden der Informatik, Theoretische Informatik},
  abstract = {In dieser Arbeit wird eine Hierarchien von Variet{\"a}ten unterhalb der Variet{\"a}t DA
      untersucht. Es werden verschiedene Charakterisierungen f{\"u}r die Zugeh{\"o}rigkeit zu
      einer Ebene in diesen Hierarchien bewiesen. Unter anderem werden neben
      bekannten Charakterisierungen {\"u}ber Kongruenzen und sogenannte Mal'cev-Produkte
      zwei neue Beschreibungen durch Gleichungen gezeigt.
      
      Dar{\"u}ber hinaus werden die Intervalllogik UITL und verschiedene Fragmente davon
      eingef{\"u}hrt und gezeigt, dass die Ebenen in der Hierarchie zu je einem Fragment
      von UITL korrespondieren, in der Art, dass eine Sprache genau dann durch eine
      Formel in diesem Fragment definierbar ist, wenn das syntaktische Monoid der
      Sprache zu der korrespondierenden Ebene in den Hierarchie geh{\"o}rt.
      
      Der Schwerpunkt dieser Arbeit liegt jedoch auf algebraischen Untersuchungen.},
}

@techreport{dkl10tr,
  author = {Luc Dartois and Manfred Kufleitner and Alexander Lauser},
  type = {Technical report},
  title = {Rankers over Infinite Words},
  institution = {{Formale} {Methoden} der {Informatik},
    {Universit\"at} {Stuttgart}},
  number = {{Nr.~2010/01}},
  pages = {23},
  month = {May},
  year = {2010},
  address = {Germany},
}

@inproceedings{dkl10dlt,
  author = {Luc Dartois and Manfred Kufleitner and Alexander Lauser},
  title = {Rankers over Infinite Words ({Extended} Abstract)},
  booktitle = {DLT 2010, Proceedings},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {6224},
  pages = {148--159},
  year = {2010},
}

@techreport{kl10tr,
  author = {Manfred Kufleitner and Alexander Lauser},
  type = {Technical report},
  title = {Partially Ordered Two-way {B\"uchi} Automata},
  institution = {{Formale} {Methoden} der {Informatik},
    {Universit\"at} {Stuttgart}},
  number = {{Nr.~2010/03}},
  pages = {12},
  month = {June},
  year = {2010},
  address = {Germany},
}

@inproceedings{kl11ciaa,
  author = {Manfred Kufleitner and Alexander Lauser},
  title = {Partially Ordered Two-Way {B\"uchi} Automata},
  booktitle = {CIAA 2010, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {6482},
  publisher = {Springer},
  pages = {181--190},
  year = {2011},
}

@techreport{kkl10tr,
  author = {Jakub Kallas and Manfred Kufleitner and Alexander Lauser},
  type = {Technical report},
  title = {First-Order Fragments with Successor over Infinite Words},
  institution = {{Formale} {Methoden} der {Informatik},
    {Universit\"at} {Stuttgart}},
  number = {{Nr.~2010/08}},
  pages = {23},
  month = {December},
  year = {2010},
  address = {Germany},
}

@inproceedings{kkl11stacs,
  author = {Jakub Kallas and Manfred Kufleitner and Alexander Lauser},
  title = {First-order Fragments with Successor over Infinite Words},
  booktitle = {STACS 2011, Proceedings},
  pages = {356--367},
  series = {LIPIcs},
  year = {2011},
  volume = {9},
  publisher = {Dagstuhl Publishing},
}

@inproceedings{kl11lics,
  title = {Languages of Dot-Depth One over Infinite Words},
  author = {Manfred Kufleitner and Alexander Lauser},
  publisher = {IEEE Computer Society},
  year = {2011},
  booktitle = {LICS 2011, Proceedings},
  pages = {23--32},
}

@techreport{kk11tr:arounddd1,
  author = {Manfred Kufleitner and Alexander Lauser},
  type = {Technical report},
  title = {Around Dot-depth One},
  institution = {{Formale} {Methoden} der {Informatik},
    {Universit\"at} {Stuttgart}},
  number = {{Nr.~2011/03}},
  pages = {15},
  month = {March},
  year = {2011},
  address = {Germany},
}

@inproceedings{kl11afl,
  title = {Around Dot-Depth One ({Extended} Abstract)},
  author = {Manfred Kufleitner and Alexander Lauser},
  booktitle = {AFL 2011, Proceedings},
  year = {2011},
  pages = {255--269},
}

@article{kl11ijfcs,
  author = {Manfred Kufleitner and Alexander Lauser},
  title = {Partially Ordered Two-Way {B\"uchi} Automata},
  fjournal = {International Journal of Foundations of Computer Science},
  journal = {Int.\ J.\ Found.\ Comput.\ Sci.},
  volume = {22},
  number = {8},
  publisher = {World Scientific},
  pages = {1861--1876},
  year = {2011},
  note = {Special issue CIAA 2010},
}

@techreport{kl12tr,
  author = {Manfred Kufleitner and Alexander Lauser},
  type = {Technical report},
  title = {Lattices of Logical Fragments over Words},
  institution = {{Formale} {Methoden} der {Informatik},
    {Universit\"at} {Stuttgart}},
  number = {{Nr.~2012/03}},
  pages = 32,
  month = {March},
  year = 2012,
  address = {Germany},
}

@inproceedings{kl12icalp,
  author = {Manfred Kufleitner and Alexander Lauser},
  title = {Lattices of Logical Fragments over Words ({E}xtended Abstract)},
  booktitle = {ICALP 2012, Proceedings Part~II},
  series = {Lecture Notes in Computer Science},
  volume = {7392},
  publisher = {Springer},
  pages = {275--286},
  year = {2012},
}

@inproceedings{jkl12ciaa,
  author = {Franz Jahn and Manfred Kufleitner and Alexander Lauser},
  title = {Regular Ideal Languages and Their {B}oolean Combinations},
  booktitle = {CIAA 2012, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {7381},
  publisher = {Springer},
  pages = {205--216},
  year = {2012},
}

@article{KufleitnerLauser12dmtcs,
  author = {Manfred Kufleitner and
               Alexander Lauser},
  title = {The Join of the Varieties of {R}-trivial and {L}-trivial
                  Monoids via Combinatorics on Words},
  journal = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume = {14},
  number = {1},
  year = {2012},
  pages = {141--146},
}

@inproceedings{kl12mfcs,
  author = {Manfred Kufleitner and Alexander Lauser},
  title = {The Join Levels of the {T}rotter-{W}eil Hierarchy are Decidable},
  booktitle = {MFCS 2012, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {7464},
  publisher = {Springer},
  pages = {603--614},
  year = {2012},
}

@article{kl12ijfcs,
  author = {Kufleitner, Manfred and Lauser, Alexander},
  title = {Around Dot-Depth One},
  fjournal = {International Journal of Foundations of Computer Science},
  journal = {Int.\ J.\ Found.\ Comput.\ Sci.},
  volume = {23},
  number = {6},
  publisher = {World Scientific},
  pages = {1323--1339},
  year = {2012},
  note = {Special issue AFL 2011},
}

@inproceedings{kl13stacs,
  author = {Manfred Kufleitner and Alexander Lauser},
  title = {Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable},
  booktitle = {STACS 2013, Proceedings},
  pages = {305--316},
  series = {LIPIcs},
  year = {2013},
  volume = {20},
  publisher = {Dagstuhl Publishing},
  doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2013.305},
}

@techreport{kl13tr,
  author = {Manfred Kufleitner and Alexander Lauser},
  type = {Technical report},
  title = {Nesting Negations in ${FO}^2$ over Finite Words},
  institution = {{Formale} {Methoden} der {Informatik},
    {Universit\"at} {Stuttgart}},
  number = {{Nr.~2013/07}},
  pages = 19,
  month = {September},
  year = 2013,
  address = {Germany},
}

This file was generated by bibtex2html 1.96.