BibTeX records: Michael Bauland

download as .bib file

@article{DBLP:journals/tocl/BaulandM0SSV11,
  author       = {Michael Bauland and
                  Martin Mundhenk and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  title        = {The tractability of model checking for {LTL:} The good, the bad, and
                  the ugly fragments},
  journal      = {{ACM} Trans. Comput. Log.},
  volume       = {12},
  number       = {2},
  pages        = {13:1--13:28},
  year         = {2011},
  url          = {https://doi.org/10.1145/1877714.1877719},
  doi          = {10.1145/1877714.1877719},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tocl/BaulandM0SSV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/BaulandBCRSV10,
  author       = {Michael Bauland and
                  Elmar B{\"{o}}hler and
                  Nadia Creignou and
                  Steffen Reith and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {The Complexity of Problems for Quantified Constraints},
  journal      = {Theory Comput. Syst.},
  volume       = {47},
  number       = {2},
  pages        = {454--490},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00224-009-9194-6},
  doi          = {10.1007/S00224-009-9194-6},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BaulandBCRSV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0812-4848,
  author       = {Michael Bauland and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  title        = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {5},
  number       = {1},
  year         = {2009},
  url          = {http://arxiv.org/abs/0812.4848},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0812-4848.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/AllenderBISV09,
  author       = {Eric Allender and
                  Michael Bauland and
                  Neil Immerman and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {The complexity of satisfiability problems: Refining Schaefer's theorem},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {75},
  number       = {4},
  pages        = {245--254},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jcss.2008.11.001},
  doi          = {10.1016/J.JCSS.2008.11.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/AllenderBISV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/BaulandH09,
  author       = {Michael Bauland and
                  Edith Hemaspaandra},
  title        = {Isomorphic Implication},
  journal      = {Theory Comput. Syst.},
  volume       = {44},
  number       = {1},
  pages        = {117--139},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00224-007-9038-1},
  doi          = {10.1007/S00224-007-9038-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BaulandH09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0805-0498,
  author       = {Michael Bauland and
                  Martin Mundhenk and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  title        = {The Tractability of Model-Checking for {LTL:} The Good, the Bad, and
                  the Ugly Fragments},
  journal      = {CoRR},
  volume       = {abs/0805.0498},
  year         = {2008},
  url          = {http://arxiv.org/abs/0805.0498},
  eprinttype    = {arXiv},
  eprint       = {0805.0498},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0805-0498.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/BaulandMSSSV08,
  author       = {Michael Bauland and
                  Martin Mundhenk and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  title        = {The Tractability of Model-Checking for {LTL:} The Good, the Bad, and
                  the Ugly Fragments},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR08-028}},
  year         = {2008},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-028/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR08-028},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BaulandMSSSV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/de/Bauland2007,
  author       = {Michael Bauland},
  title        = {Complexity results for boolean constraint satisfaction problems},
  school       = {University of Hanover},
  year         = {2007},
  url          = {https://d-nb.info/983242666},
  isbn         = {978-3-86727-151-6},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/de/Bauland2007.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fossacs/BaulandSSSV07,
  author       = {Michael Bauland and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  editor       = {Helmut Seidl},
  title        = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  booktitle    = {Foundations of Software Science and Computational Structures, 10th
                  International Conference, {FOSSACS} 2007, Held as Part of the Joint
                  European Conferences on Theory and Practice of Software, {ETAPS} 2007,
                  Braga, Portugal, March 24-April 1, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4423},
  pages        = {48--62},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-71389-0\_5},
  doi          = {10.1007/978-3-540-71389-0\_5},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/fossacs/BaulandSSSV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/entcs/BaulandMSSSV09,
  author       = {Michael Bauland and
                  Martin Mundhenk and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  editor       = {Carlos Areces and
                  St{\'{e}}phane Demri},
  title        = {The Tractability of Model-checking for {LTL:} The Good, the Bad, and
                  the Ugly Fragments},
  booktitle    = {Proceedings of the 5th Workshop on Methods for Modalities, {M4M} 2007,
                  Cachan, France, November 29-30, 2007},
  series       = {Electronic Notes in Theoretical Computer Science},
  volume       = {231},
  pages        = {277--292},
  publisher    = {Elsevier},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.entcs.2009.02.041},
  doi          = {10.1016/J.ENTCS.2009.02.041},
  timestamp    = {Mon, 27 Feb 2023 09:39:46 +0100},
  biburl       = {https://dblp.org/rec/journals/entcs/BaulandMSSSV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/VollmerBBCRS07,
  author       = {Heribert Vollmer and
                  Michael Bauland and
                  Elmar B{\"{o}}hler and
                  Nadia Creignou and
                  Steffen Reith and
                  Henning Schnoor},
  title        = {The Complexity of Problems for Quantified Constraints},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR07-023}},
  year         = {2007},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-023/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR07-023},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/VollmerBBCRS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BaulandHSS06,
  author       = {Michael Bauland and
                  Edith Hemaspaandra and
                  Henning Schnoor and
                  Ilka Schnoor},
  editor       = {Bruno Durand and
                  Wolfgang Thomas},
  title        = {Generalized Modal Satisfiability},
  booktitle    = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
                  Science, Marseille, France, February 23-25, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3884},
  pages        = {500--511},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11672142\_41},
  doi          = {10.1007/11672142\_41},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BaulandHSS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/BaulandSSSV06,
  author       = {Michael Bauland and
                  Thomas Schneider and
                  Henning Schnoor and
                  Ilka Schnoor and
                  Heribert Vollmer},
  title        = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR06-153}},
  year         = {2006},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-153/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR06-153},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BaulandSSSV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/AllenderBISV05,
  author       = {Eric Allender and
                  Michael Bauland and
                  Neil Immerman and
                  Henning Schnoor and
                  Heribert Vollmer},
  editor       = {Joanna Jedrzejowicz and
                  Andrzej Szepietowski},
  title        = {The Complexity of Satisfiability Problems: Refining Schaefer's Theorem},
  booktitle    = {Mathematical Foundations of Computer Science 2005, 30th International
                  Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3618},
  pages        = {71--82},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11549345\_8},
  doi          = {10.1007/11549345\_8},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/AllenderBISV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/BaulandH05,
  author       = {Michael Bauland and
                  Edith Hemaspaandra},
  editor       = {Joanna Jedrzejowicz and
                  Andrzej Szepietowski},
  title        = {Isomorphic Implication},
  booktitle    = {Mathematical Foundations of Computer Science 2005, 30th International
                  Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3618},
  pages        = {119--130},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11549345\_12},
  doi          = {10.1007/11549345\_12},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/BaulandH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR05-024,
  author       = {Michael Bauland and
                  Elmar B{\"{o}}hler and
                  Nadia Creignou and
                  Steffen Reith and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {Quantified Constraints: The Complexity of Decision and Counting for
                  Bounded Alternation},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-024}},
  year         = {2005},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-024/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR05-024},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR05-024.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/BaulandCCHV04,
  author       = {Michael Bauland and
                  Philippe Chapdelaine and
                  Nadia Creignou and
                  Miki Hermann and
                  Heribert Vollmer},
  title        = {An Algebraic Approach to the Complexity of Generalized Conjunctive
                  Queries},
  booktitle    = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
                  of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
                  Online Proceedings},
  year         = {2004},
  url          = {http://www.satisfiability.org/SAT04/programme/73.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/BaulandCCHV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/BaulandCCHV04a,
  author       = {Michael Bauland and
                  Philippe Chapdelaine and
                  Nadia Creignou and
                  Miki Hermann and
                  Heribert Vollmer},
  editor       = {Holger H. Hoos and
                  David G. Mitchell},
  title        = {An Algebraic Approach to the Complexity of Generalized Conjunctive
                  Queries},
  booktitle    = {Theory and Applications of Satisfiability Testing, 7th International
                  Conference, {SAT} 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {3542},
  pages        = {30--45},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/11527695\_3},
  doi          = {10.1007/11527695\_3},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/BaulandCCHV04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-cs-0412062,
  author       = {Michael Bauland and
                  Edith Hemaspaandra},
  title        = {Isomorphic Implication},
  journal      = {CoRR},
  volume       = {abs/cs/0412062},
  year         = {2004},
  url          = {http://arxiv.org/abs/cs/0412062},
  eprinttype    = {arXiv},
  eprint       = {cs/0412062},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0412062.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR04-100,
  author       = {Eric Allender and
                  Michael Bauland and
                  Neil Immerman and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {The Complexity of Satisfiability Problems: Refining Schaefer's Theorem},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-100}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-100/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-100},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-100.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.