default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Steffen Reith

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Steffen Reith

download as .bib file

@inproceedings{DBLP:conf/date/HenkesRSHPWBSLF24,
  author       = {Tim Henkes and
                  Steffen Reith and
                  Marc St{\"{o}}ttinger and
                  Norbert Herfurth and
                  Goran Panic and
                  Julian W{\"{a}}lde and
                  Fabian Buschkowski and
                  Pascal Sasdrich and
                  Christoph L{\"{u}}th and
                  Milan Funck and
                  Tuba Kiyan and
                  Arnd Weber and
                  Detlef Boeck and
                  Ren{\'{e}} Rathfelder and
                  Torsten Grawunder},
  title        = {Evaluating an Open-Source Hardware Approach from {HDL} to {GDS} for
                  a Security Chip Design - a Review of the Final Stage of Project {HEP}},
  booktitle    = {Design, Automation {\&} Test in Europe Conference {\&} Exhibition,
                  {DATE} 2024, Valencia, Spain, March 25-27, 2024},
  pages        = {1--6},
  publisher    = {{IEEE}},
  year         = {2024},
  url          = {https://doi.org/10.23919/DATE58400.2024.10546500},
  doi          = {10.23919/DATE58400.2024.10546500},
  timestamp    = {Wed, 25 Feb 2026 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/date/HenkesRSHPWBSLF24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csr2/WeberGRSLMGRPSHSH23,
  author       = {Arnd Weber and
                  Sylvain Guilley and
                  Ren{\'{e}} Rathfelder and
                  Marc St{\"{o}}ttinger and
                  Christoph L{\"{u}}th and
                  Maja Malenko and
                  Torsten Grawunder and
                  Steffen Reith and
                  Armand Puccetti and
                  Jean{-}Pierre Seifert and
                  Norbert Herfurth and
                  Hagen Sankowski and
                  Gernot Heiser},
  title        = {Verified Value Chains, Innovation and Competition},
  booktitle    = {{IEEE} International Conference on Cyber Security and Resilience,
                  {CSR} 2023, Venice, Italy, July 31 - Aug. 2, 2023},
  pages        = {470--476},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/CSR57506.2023.10224911},
  doi          = {10.1109/CSR57506.2023.10224911},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/csr2/WeberGRSLMGRPSHSH23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/africacrypt/CamposKRS20,
  author       = {Fabio Campos and
                  Tim Kohlstadt and
                  Steffen Reith and
                  Marc St{\"{o}}ttinger},
  editor       = {Abderrahmane Nitaj and
                  Amr M. Youssef},
  title        = {{LMS} vs {XMSS:} Comparison of Stateful Hash-Based Signature Schemes
                  on {ARM} Cortex-M4},
  booktitle    = {Progress in Cryptology - {AFRICACRYPT} 2020 - 12th International Conference
                  on Cryptology in Africa, Cairo, Egypt, July 20-22, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {258--277},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-51938-4\_13},
  doi          = {10.1007/978-3-030-51938-4\_13},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/africacrypt/CamposKRS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/CamposKRS20,
  author       = {Fabio Campos and
                  Tim Kohlstadt and
                  Steffen Reith and
                  Marc St{\"{o}}ttinger},
  title        = {{LMS} vs {XMSS:} Comparison of Stateful Hash-Based Signature Schemes
                  on {ARM} Cortex-M4},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  volume       = {2020},
  pages        = {470},
  year         = {2020},
  url          = {https://eprint.iacr.org/2020/470},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/CamposKRS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pqcrypto/MeyerCR19,
  author       = {Michael Meyer and
                  Fabio Campos and
                  Steffen Reith},
  editor       = {Jintai Ding and
                  Rainer Steinwandt},
  title        = {On Lions and Elligators: An Efficient Constant-Time Implementation
                  of {CSIDH}},
  booktitle    = {Post-Quantum Cryptography - 10th International Conference, PQCrypto
                  2019, Chongqing, China, May 8-10, 2019 Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  pages        = {307--325},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25510-7\_17},
  doi          = {10.1007/978-3-030-25510-7\_17},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/pqcrypto/MeyerCR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dud/WeberRKKSK18,
  author       = {Arnd Weber and
                  Steffen Reith and
                  Michael Kasper and
                  Dirk Kuhlmann and
                  Jean{-}Pierre Seifert and
                  Christoph Krau{\ss}},
  title        = {Souver{\"{a}}nit{\"{a}}t und die IT-Wertsch{\"{o}}pfungskette},
  journal      = {Datenschutz und Datensicherheit},
  volume       = {42},
  number       = {5},
  pages        = {291--293},
  year         = {2018},
  url          = {https://doi.org/10.1007/s11623-018-0943-z},
  doi          = {10.1007/S11623-018-0943-Z},
  timestamp    = {Fri, 25 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dud/WeberRKKSK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/indocrypt/MeyerR18,
  author       = {Michael Meyer and
                  Steffen Reith},
  editor       = {Debrup Chakraborty and
                  Tetsu Iwata},
  title        = {A Faster Way to the {CSIDH}},
  booktitle    = {Progress in Cryptology - {INDOCRYPT} 2018 - 19th International Conference
                  on Cryptology in India, New Delhi, India, December 9-12, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {137--152},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-05378-9\_8},
  doi          = {10.1007/978-3-030-05378-9\_8},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/indocrypt/MeyerR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/qrs/WeberRKKSK18,
  author       = {Arnd Weber and
                  Steffen Reith and
                  Dirk Kuhlmann and
                  Michael Kasper and
                  Jean{-}Pierre Seifert and
                  Christoph Krau{\ss}},
  title        = {Open Source Value Chains for Addressing Security Issues Efficiently},
  booktitle    = {2018 {IEEE} International Conference on Software Quality, Reliability
                  and Security Companion, {QRS} Companion 2018, Lisbon, Portugal, July
                  16-20, 2018},
  pages        = {599--606},
  publisher    = {{IEEE}},
  year         = {2018},
  url          = {https://doi.org/10.1109/QRS-C.2018.00105},
  doi          = {10.1109/QRS-C.2018.00105},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/qrs/WeberRKKSK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/MeyerR18,
  author       = {Michael Meyer and
                  Steffen Reith},
  title        = {A faster way to the {CSIDH}},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  volume       = {2018},
  pages        = {782},
  year         = {2018},
  url          = {https://eprint.iacr.org/2018/782},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/MeyerR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/MeyerCR18,
  author       = {Michael Meyer and
                  Fabio Campos and
                  Steffen Reith},
  title        = {On Lions and Elligators: An efficient constant-time implementation
                  of {CSIDH}},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  volume       = {2018},
  pages        = {1198},
  year         = {2018},
  url          = {https://eprint.iacr.org/2018/1198},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/MeyerCR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/MeyerRC17,
  author       = {Michael Meyer and
                  Steffen Reith and
                  Fabio Campos},
  title        = {On hybrid {SIDH} schemes using Edwards and Montgomery curve arithmetic},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  volume       = {2017},
  pages        = {1213},
  year         = {2017},
  url          = {http://eprint.iacr.org/2017/1213},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/MeyerRC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/recosoc/HimmighofenJR13,
  author       = {Andr{\'{e}} Himmighofen and
                  Bernhard Jungk and
                  Steffen Reith},
  title        = {On a FPGA-based method for authentication using Edwards curves},
  booktitle    = {2013 8th International Workshop on Reconfigurable and Communication-Centric
                  Systems-on-Chip (ReCoSoC), Darmstadt, Germany, July 10-12, 2013},
  pages        = {1--7},
  publisher    = {{IEEE}},
  year         = {2013},
  url          = {https://doi.org/10.1109/ReCoSoC.2013.6581530},
  doi          = {10.1109/RECOSOC.2013.6581530},
  timestamp    = {Wed, 16 Oct 2019 14:14:56 +0200},
  biburl       = {https://dblp.org/rec/conf/recosoc/HimmighofenJR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fpt/JungkSGRH12,
  author       = {Bernhard Jungk and
                  Marc St{\"{o}}ttinger and
                  Jan Gampe and
                  Steffen Reith and
                  Sorin A. Huss},
  title        = {Side-channel resistant {AES} architecture utilizing randomized composite
                  field representations},
  booktitle    = {2012 International Conference on Field-Programmable Technology, {FPT}
                  2012, Seoul, Korea (South), December 10-12, 2012},
  pages        = {125--128},
  publisher    = {{IEEE}},
  year         = {2012},
  url          = {https://doi.org/10.1109/FPT.2012.6412123},
  doi          = {10.1109/FPT.2012.6412123},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fpt/JungkSGRH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1009-1208,
  author       = {Elmar B{\"{o}}hler and
                  Nadia Creignou and
                  Matthias Galota and
                  Steffen Reith and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {Boolean Circuits as a Data Structure for Boolean Functions: Efficient
                  Algorithms and Hard Problems},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {8},
  number       = {3},
  year         = {2010},
  url          = {https://doi.org/10.2168/LMCS-8(3:31)2012},
  doi          = {10.2168/LMCS-8(3:31)2012},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1009-1208.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}
}

@inproceedings{DBLP:conf/reconfig/JungkR10,
  author       = {Bernhard Jungk and
                  Steffen Reith},
  editor       = {Viktor K. Prasanna and
                  J{\"{u}}rgen Becker and
                  Ren{\'{e}} Cumplido},
  title        = {On FPGA-Based Implementations of the {SHA-3} Candidate Gr{\o}stl},
  booktitle    = {ReConFig'10: 2010 International Conference on Reconfigurable Computing
                  and FPGAs, Cancun, Quintana Roo, Mexico, 13-15 December 2010, Proceedings},
  pages        = {316--321},
  publisher    = {{IEEE} Computer Society},
  year         = {2010},
  url          = {https://doi.org/10.1109/ReConFig.2010.21},
  doi          = {10.1109/RECONFIG.2010.21},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/reconfig/JungkR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/JungkR10,
  author       = {Bernhard Jungk and
                  Steffen Reith},
  title        = {On FPGA-based implementations of Gr{\"{o}}stl},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  volume       = {2010},
  pages        = {260},
  year         = {2010},
  url          = {http://eprint.iacr.org/2010/260},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/JungkR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/JungkRA09,
  author       = {Bernhard Jungk and
                  Steffen Reith and
                  J{\"{u}}rgen Apfelbeck},
  title        = {On Optimized {FPGA} Implementations of the {SHA-3} Candidate Groestl},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  volume       = {2009},
  pages        = {206},
  year         = {2009},
  url          = {http://eprint.iacr.org/2009/206},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/JungkRA09.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}},
  eid          = {{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}
}

@article{DBLP:journals/dam/GlasserRV05,
  author       = {Christian Gla{\ss}er and
                  Steffen Reith and
                  Heribert Vollmer},
  title        = {The complexity of base station positioning in cellular networks},
  journal      = {Discret. Appl. Math.},
  volume       = {148},
  number       = {1},
  pages        = {1--12},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.07.005},
  doi          = {10.1016/J.DAM.2004.07.005},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GlasserRV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BohlerRSV05,
  author       = {Elmar B{\"{o}}hler and
                  Steffen Reith and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {Bases for Boolean co-clones},
  journal      = {Inf. Process. Lett.},
  volume       = {96},
  number       = {2},
  pages        = {59--66},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2005.06.003},
  doi          = {10.1016/J.IPL.2005.06.003},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BohlerRSV05.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}},
  eid          = {{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/stacs/BohlerHRV04,
  author       = {Elmar B{\"{o}}hler and
                  Edith Hemaspaandra and
                  Steffen Reith and
                  Heribert Vollmer},
  editor       = {Volker Diekert and
                  Michel Habib},
  title        = {The Complexity of Boolean Constraint Isomorphism},
  booktitle    = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
                  Science, Montpellier, France, March 25-27, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {164--175},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-24749-4\_15},
  doi          = {10.1007/978-3-540-24749-4\_15},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BohlerHRV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/ReithV03,
  author       = {Steffen Reith and
                  Heribert Vollmer},
  title        = {Optimal satisfiability for propositional calculi and constraint satisfaction
                  problems},
  journal      = {Inf. Comput.},
  volume       = {186},
  number       = {1},
  pages        = {1--19},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0890-5401(03)00092-0},
  doi          = {10.1016/S0890-5401(03)00092-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/ReithV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/Reith03,
  author       = {Steffen Reith},
  editor       = {Branislav Rovan and
                  Peter Vojt{\'{a}}s},
  title        = {On the Complexity of Some Equivalence Problems for Propositional Calculi},
  booktitle    = {Mathematical Foundations of Computer Science 2003, 28th International
                  Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {632--641},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-45138-9\_57},
  doi          = {10.1007/978-3-540-45138-9\_57},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/Reith03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/cs-CC-0306134,
  author       = {Elmar B{\"{o}}hler and
                  Edith Hemaspaandra and
                  Steffen Reith and
                  Heribert Vollmer},
  title        = {The Complexity of Boolean Constraint Isomorphism},
  journal      = {CoRR},
  volume       = {cs.CC/0306134},
  year         = {2003},
  url          = {http://arxiv.org/abs/cs/0306134},
  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-CC-0306134.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csl/BohlerHRV02,
  author       = {Elmar B{\"{o}}hler and
                  Edith Hemaspaandra and
                  Steffen Reith and
                  Heribert Vollmer},
  editor       = {Julian C. Bradfield},
  title        = {Equivalence and Isomorphism for Boolean Constraint Satisfaction},
  booktitle    = {Computer Science Logic, 16th International Workshop, {CSL} 2002, 11th
                  Annual Conference of the EACSL, Edinburgh, Scotland, UK, September
                  22-25, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {412--426},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45793-3\_28},
  doi          = {10.1007/3-540-45793-3\_28},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/csl/BohlerHRV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/cs-CC-0202036,
  author       = {Elmar B{\"{o}}hler and
                  Edith Hemaspaandra and
                  Steffen Reith and
                  Heribert Vollmer},
  title        = {Equivalence and Isomorphism for Boolean Constraint Satisfaction},
  journal      = {CoRR},
  volume       = {cs.CC/0202036},
  year         = {2002},
  url          = {https://arxiv.org/abs/cs/0202036},
  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-CC-0202036.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/de/Reith2002,
  author       = {Steffen Reith},
  title        = {Generalized satisfiability problems},
  school       = {Julius Maximilians University W{\"{u}}rzburg, Germany},
  year         = {2001},
  url          = {http://opus.bibliothek.uni-wuerzburg.de/opus/volltexte/2002/7/index.html},
  urn          = {urn:nbn:de:bvb:20-opus-74},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/de/Reith2002.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ReithW01,
  author       = {Steffen Reith and
                  Klaus W. Wagner},
  title        = {On boolean lowness and boolean highness},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {305--321},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00146-8},
  doi          = {10.1016/S0304-3975(00)00146-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ReithW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dialm/GalotaGRV01,
  author       = {Matthias Galota and
                  Christian Gla{\ss}er and
                  Steffen Reith and
                  Heribert Vollmer},
  title        = {A polynomial-time approximation scheme for base station positioning
                  in {UMTS} networks},
  booktitle    = {Proceedings of the 5th International Workshop on Discrete Algorithms
                  and Methods for Mobile Computing and Communications {(DIAL-M} 2001),
                  Rome, Italy, July 21, 2001},
  pages        = {52--59},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/381448.381455},
  doi          = {10.1145/381448.381455},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/dialm/GalotaGRV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HertrampfRV00,
  author       = {Ulrich Hertrampf and
                  Steffen Reith and
                  Heribert Vollmer},
  title        = {A note on closure properties of logspace {MOD} classes},
  journal      = {Inf. Process. Lett.},
  volume       = {75},
  number       = {3},
  pages        = {91--93},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00091-0},
  doi          = {10.1016/S0020-0190(00)00091-0},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/HertrampfRV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/GlasslerRV00,
  author       = {Christian Gla{\ss}er and
                  Steffen Reith and
                  Heribert Vollmer},
  editor       = {Jos{\'{e}} D. P. Rolim and
                  Andrei Z. Broder and
                  Andrea Corradini and
                  Roberto Gorrieri and
                  Reiko Heckel and
                  Juraj Hromkovic and
                  Ugo Vaccaro and
                  J. B. Wells},
  title        = {The Complexity of Base Station Positioning in Cellular Networks},
  booktitle    = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the
                  27th International Colloquium on Automata, Languages and Programming,
                  Geneva, Switzerland, July 9-15, 2000},
  pages        = {167--178},
  publisher    = {Carleton Scientific, Waterloo, Ontario, Canada},
  year         = {2000},
  timestamp    = {Sat, 04 Apr 2020 17:15:23 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/GlasslerRV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/ReithV00,
  author       = {Steffen Reith and
                  Heribert Vollmer},
  editor       = {Mogens Nielsen and
                  Branislav Rovan},
  title        = {Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction
                  Problems},
  booktitle    = {Mathematical Foundations of Computer Science 2000, 25th International
                  Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
                  1, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {640--649},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44612-5\_59},
  doi          = {10.1007/3-540-44612-5\_59},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/ReithV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoon/ReithW98,
  author       = {Steffen Reith and
                  Klaus W. Wagner},
  editor       = {Wen{-}Lian Hsu and
                  Ming{-}Yang Kao},
  title        = {On Boolean Lowness and Boolean Highness},
  booktitle    = {Computing and Combinatorics, 4th Annual International Conference,
                  {COCOON} '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  pages        = {147--156},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/3-540-68535-9\_18},
  doi          = {10.1007/3-540-68535-9\_18},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/ReithW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/cs-CC-9809116,
  author       = {Steffen Reith and
                  Heribert Vollmer},
  title        = {The Complexity of Computing Optimal Assignments of Generalized Propositional
                  Formulae},
  journal      = {CoRR},
  volume       = {cs.CC/9809116},
  year         = {1998},
  url          = {https://arxiv.org/abs/cs/9809116},
  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-CC-9809116.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR98-022,
  author       = {Steffen Reith and
                  Heribert Vollmer},
  title        = {The Complexity of Computing Optimal Assignments of Generalized Propositional
                  Formulae},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR98}},
  eid          = {{TR98-022}},
  year         = {1998},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-022/index.html},
  eprinttype   = {ECCC},
  eprint       = {TR98-022},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR98-022.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.