Ausgewählte Vorträge


  • Einige Grundlagen für kryptographische Algorithmen auf der Basis von Elliptischen Kurven zum Einsatz in tiefst eingebetteten Systemen, Universität Würzburg, Lehrstuhl für Mathematik IV (Prof. Jörn Steuding), 21. Juni 2007
  • Public-Key Kryptographie und Halbgruppen, Universität Hannover, Institut für Theoretische Informatik (Prof. Heribert Vollmer), 12. September 2007
  • Fibonacci- und Pseudoprimzahlen, IBM Deutschland Mainz, 4. März 2008
  • Moderne Multiprozessorarchitekturen für zahlentheoretische Anwendungen, Universität Würzburg, Lehrstuhl für Mathematik IV (Prof. Jörn Steuding), 4. Dezember 2008
  • Zahlentheoretische Anwendungen der Cell-Architektur, IBM Deutschland Böblingen, 27. März 2009
  • Anwendungen von zahlentheoretischen Grundlagen in modernen Automobilen, AAA7-Workshop, Wiesbaden, 21. Januar 2011

Proceedings


  • C. Glaßer and S. Reith and H. Vollmer, The complexity of base station positioning in cellular networks, Approximation and Randomized Algorithms in Communication Networks, ICALP Workshops 2000, Proceedings in Informatics 8:167-177, 2000
  • Steffen Reith and Heribert Vollmer, Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems, Proceedings 25th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science,Springer Verlag, 2000
  • M. Galota, C. Glaßer, S. Reith and H. Vollmer, A polynomial-time approximation scheme for base station positioning in UMTS networks, Proc. Discrete Algorithms and Methods for Mobile Computing and Communications, 2001
  • E. Böhler, E. Hemaspaandra, S. Reith, H. Vollmer, Equivalence problems for Boolean constraint satisfaction, Proceedings Computer Science Logic (CSL), Springer Lecture Notes in Computer Science Vol. 2471, 412-426, 2002
  • Steffen Reith, On the complexity of Some Equivalence Problems for Propositional Calculi, Proceedings, 28th Symposium, Mathematical Foundations of Computer Science (MFCS), Springer Lecture Notes in Computer Science 2747, 2003
  • E. Böhler, E. Hemaspaandra, S. Reith, H. Vollmer, The complexity of Boolean constraint isomorphism, Proc. 21st Symposium on Theoretical Aspects of Computer Science, Springer Lecture Notes in Computer Science Vol. 2996, 164-175, 2004
  • Steffen Reith and Klaus W. Wagner, The Complexity of Problems Defined by Subclasses of Boolean Functions, Proceedings Mathematical Foundation of Informatics (MFI99), World Science Publishing, 2005
  • B. Jungk and S. Reith, On FPGA-based implementations of the SHA-3 candidate Grøstl, Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2010
  • Bernhard Jungk, Marc Stoettinger, Jan Gampe, Steffen Reith, and Sorin A. Huss, Side-Channel Resistant AES Architecture Utilizing Randomized Composite Field Representations, IEEE International Conference on Field-Programmable Technology (FPT'12), to be published

Journals


  • Steffen Reith and Heribert Vollmer, Optimal satisfiability for propositional calculi and constraint satisfaction problems, Information and computation, 186:1-19, 2003
  • Ulrich Hertrampf and Steffen Reith and Heribert Vollmer, A note on closure properties of logspace MOD classes, Information Processing Letters, 75:91-93, 2000
  • Steffen Reith and Klaus W. Wagner, On Boolean lowness and Boolean highness, Computing and combinatorics (Taipei, 1998), 147-156, Lecture Notes in Computer Science, 1449, Springer, Berlin, 1998
  • Elmar Böhler, Steffen Reith, Henning Schnoor and Heribert Vollmer, Simple bases for Boolean co-Clones, Elsevier Information Processing Letters, 96:59-66, 2005
  • Christian Glaßer, Steffen Reith and Heribert Vollmer. The complexity of base station positioning in cellular networks; Discrete and Applied Mathematics, 48(1):1-12, 2005
  • Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor and Heribert Vollmer, The Complexity of Problems for Quantified Constraints, Theory Comput. Syst. 47(2): 454-490, 2010
  • Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor and Heribert Vollmer, Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems, Logical Methods in Computer Science 8(3), 2010

Misc



Theses



Technische Berichte:



Letzte Änderung: 27.10.17