Steffen Reith

Available identifiers

zbMath Open reith.steffenMaRDI QIDQ1044707

List of research outcomes

Publication	Date of Publication	Type
LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4	2022-11-09	Paper
Complexity classifications for different equivalence and audit problems for Boolean circuits	2012-10-22	Paper
The complexity of problems for quantified constraints	2010-10-06	Paper
Bases for Boolean co-clones	2009-12-18	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
STACS 2004	2007-10-01	Paper
The complexity of base station positioning in cellular networks	2005-05-04	Paper
Optimal satisfiability for propositional calculi and constraint satisfaction problems.	2004-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4411838	2003-07-10	Paper
https://portal.mardi4nfdi.de/entity/Q4536400	2002-06-25	Paper
On boolean lowness and boolean highness	2001-08-20	Paper
A note on closure properties of logspace MOD classes	2000-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q4218416	1999-05-18	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Steffen Reith