S. Reith

发表

Guest Column: Playing with Boolean Blocks, Part I: Post's Lattice with Applications to Complexity Theory 1

Lane A. Hemaspaandra, L. A. Hemaspaandra, H. Vollmer, 2003 .

On High and Low Sets for the Boolean Hierarchy

K. Wagner, S. Reith, Highpk Highpk, 2007 .

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems

Heribert Vollmer, Henning Schnoor, Nadia Creignou, 2010, Log. Methods Comput. Sci..

A note on closure properties of logspace MOD classes

Heribert Vollmer, Steffen Reith, Ulrich Hertrampf, 2000, Information Processing Letters.

A faster way to the CSIDH

Steffen Reith, Michael Meyer, S. Reith, 2018, IACR Cryptol. ePrint Arch..

The complexity of base station positioning in cellular networks

Heribert Vollmer, Christian Glaßer, Steffen Reith, 2005, Discret. Appl. Math..

2013 8th International Workshop on Reconfigurable and Communication-Centric Systems-on-Chip (ReCoSoC), Darmstadt, Germany, July 10-12, 2013

Leandro Soares Indrusiak, Kartikeya Bhardwaj, Pravin S. Mane, 2013, Reconfigurable Communication-centric Systems-on-Chip.

LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4

Steffen Reith, Marc Stöttinger, Fabio Campos, 2020, IACR Cryptol. ePrint Arch..

The Complexity of Boolean Constraint Isomorphism

Heribert Vollmer, Edith Hemaspaandra, Steffen Reith, 2003, STACS.

Equivalence and Isomorphism for Boolean Constraint Satisfaction

Heribert Vollmer, Edith Hemaspaandra, Steffen Reith, 2002, CSL.

Bases for Boolean co-clones

Heribert Vollmer, Henning Schnoor, Steffen Reith, 2005, Inf. Process. Lett..

A polynomial-time approximation scheme for base station positioning in UMTS networks

Heribert Vollmer, Christian Glaßer, Steffen Reith, 2001, DIALM '01.

On Lions and Elligators: An efficient constant-time implementation of CSIDH

Steffen Reith, Michael Meyer, Fabio Campos, 2019, IACR Cryptol. ePrint Arch..

The Complexity of Problems for Quantified Constraints

Heribert Vollmer, Henning Schnoor, Nadia Creignou, 2010, Theory of Computing Systems.

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation

Heribert Vollmer, Henning Schnoor, Nadia Creignou, 2005, Electron. Colloquium Comput. Complex..

Playing with Boolean Blocks , Part II : Constraint Satisfaction Problems 1

Heribert Vollmer, Nadia Creignou, Steffen Reith, 2004 .

On a FPGA-based method for authentication using Edwards curves

Steffen Reith, Bernhard Jungk, André Himmighofen, 2013, 2013 8th International Workshop on Reconfigurable and Communication-Centric Systems-on-Chip (ReCoSoC).