default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Reith
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Tim Henkes, Steffen Reith, Marc Stöttinger, Norbert Herfurth, Goran Panic, Julian Wälde, Fabian Buschkowski, Pascal Sasdrich, Christoph Lüth, Milan Funck, Tuba Kiyan, Arnd Weber, Detlef Boeck, René Rathfelder, Torsten Grawunder:
Evaluating an Open-Source Hardware Approach from HDL to GDS for a Security Chip Design - a Review of the Final Stage of Project HEP. DATE 2024: 1-6- 2023
- [c15]Arnd Weber, Sylvain Guilley, René Rathfelder, Marc Stöttinger
, Christoph Lüth, Maja Malenko, Torsten Grawunder, Steffen Reith, Armand Puccetti, Jean-Pierre Seifert, Norbert Herfurth, Hagen Sankowski, Gernot Heiser:
Verified Value Chains, Innovation and Competition. CSR 2023: 470-476 - 2020
- [c14]Fabio Campos, Tim Kohlstadt, Steffen Reith, Marc Stöttinger:
LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4. AFRICACRYPT 2020: 258-277 - [i12]Fabio Campos, Tim Kohlstadt, Steffen Reith, Marc Stöttinger:
LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4. IACR Cryptol. ePrint Arch. 2020: 470 (2020)
2010 – 2019
- 2019
- [c13]Michael Meyer, Fabio Campos, Steffen Reith:
On Lions and Elligators: An Efficient Constant-Time Implementation of CSIDH. PQCrypto 2019: 307-325 - 2018
- [j8]Arnd Weber, Steffen Reith, Michael Kasper, Dirk Kuhlmann, Jean-Pierre Seifert, Christoph Krauß:
Souveränität und die IT-Wertschöpfungskette. Datenschutz und Datensicherheit 42(5): 291-293 (2018) - [c12]Michael Meyer, Steffen Reith:
A Faster Way to the CSIDH. INDOCRYPT 2018: 137-152 - [c11]Arnd Weber, Steffen Reith, Dirk Kuhlmann, Michael Kasper, Jean-Pierre Seifert, Christoph Krauß:
Open Source Value Chains for Addressing Security Issues Efficiently. QRS Companion 2018: 599-606 - [i11]Michael Meyer, Steffen Reith:
A faster way to the CSIDH. IACR Cryptol. ePrint Arch. 2018: 782 (2018) - [i10]Michael Meyer, Fabio Campos, Steffen Reith:
On Lions and Elligators: An efficient constant-time implementation of CSIDH. IACR Cryptol. ePrint Arch. 2018: 1198 (2018) - 2017
- [i9]Michael Meyer, Steffen Reith, Fabio Campos:
On hybrid SIDH schemes using Edwards and Montgomery curve arithmetic. IACR Cryptol. ePrint Arch. 2017: 1213 (2017) - 2013
- [c10]André Himmighofen, Bernhard Jungk, Steffen Reith:
On a FPGA-based method for authentication using Edwards curves. ReCoSoC 2013: 1-7 - 2012
- [c9]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 - 2010
- [j7]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. Log. Methods Comput. Sci. 8(3) (2010) - [j6]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) - [c8]Bernhard Jungk, Steffen Reith:
On FPGA-Based Implementations of the SHA-3 Candidate Grøstl. ReConFig 2010: 316-321 - [i8]Bernhard Jungk, Steffen Reith:
On FPGA-based implementations of Gröstl. IACR Cryptol. ePrint Arch. 2010: 260 (2010)
2000 – 2009
- 2009
- [i7]Bernhard Jungk, Steffen Reith, Jürgen Apfelbeck:
On Optimized FPGA Implementations of the SHA-3 Candidate Groestl. IACR Cryptol. ePrint Arch. 2009: 206 (2009) - 2007
- [i6]Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. TR07 (2007) - 2005
- [j5]Christian Glaßer, Steffen Reith, Heribert Vollmer:
The complexity of base station positioning in cellular networks. Discret. Appl. Math. 148(1): 1-12 (2005) - [j4]Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005) - [i5]Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c7]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 - 2003
- [j3]Steffen Reith, Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003) - [c6]Steffen Reith:
On the Complexity of Some Equivalence Problems for Propositional Calculi. MFCS 2003: 632-641 - [i4]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003) - 2002
- [c5]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426 - [i3]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002) - 2001
- [b1]Steffen Reith:
Generalized satisfiability problems. Julius Maximilians University Würzburg, Germany, 2001 - [j2]Steffen Reith, Klaus W. Wagner:
On boolean lowness and boolean highness. Theor. Comput. Sci. 261(2): 305-321 (2001) - [c4]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 - 2000
- [j1]Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000) - [c3]Christian Glaßer, Steffen Reith, Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178 - [c2]Steffen Reith, Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649
1990 – 1999
- 1998
- [c1]Steffen Reith, Klaus W. Wagner:
On Boolean Lowness and Boolean Highness. COCOON 1998: 147-156 - [i2]Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998) - [i1]Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electron. Colloquium Comput. Complex. TR98 (1998)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
