BibTeX records: Frank Schädlich

• > Home > Persons > Frank Schädlich

@phdthesis{DBLP:phd/de/Schadlich2004,
  author       = {Frank Sch{\"{a}}dlich},
  title        = {Effizientes Verifizieren co-NP-vollst{\"{a}}ndiger Probleme am
                  Beispiel zuf{\"{a}}lliger 4-SAT-Formeln und uniformer Hypergraphen},
  school       = {Chemnitz University of Technology, Germany},
  year         = {2004},
  url          = {http://archiv.tu-chemnitz.de/pub/2004/0095},
  urn          = {urn:nbn:de:swb:ch1-200400959},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/de/Schadlich2004.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Coja-OghlanGLS04,
  author       = {Amin Coja{-}Oghlan and
                  Andreas Goerdt and
                  Andr{\'{e}} Lanka and
                  Frank Sch{\"{a}}dlich},
  title        = {Techniques from combinatorial approximation algorithms yield efficient
                  algorithms for random 2k-SAT},
  journal      = {Theor. Comput. Sci.},
  volume       = {329},
  number       = {1-3},
  pages        = {1--45},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.07.017},
  doi          = {10.1016/J.TCS.2004.07.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Coja-OghlanGLS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fct/Coja-OghlanGLS03,
  author       = {Amin Coja{-}Oghlan and
                  Andreas Goerdt and
                  Andr{\'{e}} Lanka and
                  Frank Sch{\"{a}}dlich},
  editor       = {Andrzej Lingas and
                  Bengt J. Nilsson},
  title        = {Certifying Unsatisfiability of Random 2\emph{k}-SAT Formulas Using
                  Approximation Techniques},
  booktitle    = {Fundamentals of Computation Theory, 14th International Symposium,
                  {FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2751},
  pages        = {15--26},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-45077-1\_3},
  doi          = {10.1007/978-3-540-45077-1\_3},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/Coja-OghlanGLS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR03-030,
  author       = {Amin Coja{-}Oghlan and
                  Andreas Goerdt and
                  Andr{\'{e}} Lanka and
                  Frank Sch{\"{a}}dlich},
  title        = {Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation
                  Techniques},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR03-030}},
  year         = {2003},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-030/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR03-030},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR03-030.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}