Steffen Reith

Bernhard Jungk, Marc Stöttinger, Jan Gampe, Steffen Reith, Sorin A. Huss: Side-channel resistant AES architecture utilizing randomized composite field representations. FPT 2012: 125-128

Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer: Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems. Logical Methods in Computer Science 8(3) (2010)

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47(2): 454-490 (2010)

Bernhard Jungk, Steffen Reith: On FPGA-Based Implementations of the SHA-3 Candidate Grøstl. ReConFig 2010: 316-321

Bernhard Jungk, Steffen Reith: On FPGA-based implementations of Gröstl. IACR Cryptology ePrint Archive 2010: 260 (2010)

Bernhard Jungk, Steffen Reith, Jürgen Apfelbeck: On Optimized FPGA Implementations of the SHA-3 Candidate Groestl. IACR Cryptology ePrint Archive 2009: 206 (2009)

Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor: The Complexity of Problems for Quantified Constraints. Electronic Colloquium on Computational Complexity (ECCC) 14(023) (2007)

Christian Glaßer, Steffen Reith, Heribert Vollmer: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1): 1-12 (2005)

Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electronic Colloquium on Computational Complexity (ECCC)(024) (2005)

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175

Steffen Reith, Heribert Vollmer: Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003)

Steffen Reith: On the Complexity of Some Equivalence Problems for Propositional Calculi. MFCS 2003: 632-641

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003)

Steffen Reith: Generalized satisfiability problems. Julius Maximilian University of Würzburg 2002

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002)

Steffen Reith, Klaus W. Wagner: On boolean lowness and boolean highness. Theor. Comput. Sci. 261(2): 305-321 (2001)

Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer: A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M 2001: 52-59

Ulrich Hertrampf, Steffen Reith, Heribert Vollmer: A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000)

Christian Glaßer, Steffen Reith, Heribert Vollmer: The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178

Steffen Reith, Heribert Vollmer: Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649

Steffen Reith, Klaus W. Wagner: On Boolean Lowness and Boolean Highness. COCOON 1998: 147-156

Steffen Reith, Heribert Vollmer: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998)

Steffen Reith, Heribert Vollmer: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electronic Colloquium on Computational Complexity (ECCC) 5(22) (1998)