| A polynomial-time approximation scheme for base station positioning in UMTS networks M Galota, C Glaßer, S Reith, H Vollmer Proceedings of the 5th international workshop on Discrete algorithms and …, 2001 | 103 | 2001 |
| A faster way to the CSIDH M Meyer, S Reith Progress in Cryptology–INDOCRYPT 2018: 19th International Conference on …, 2018 | 97 | 2018 |
| The complexity of base station positioning in cellular networks C Glaßer, S Reith, H Vollmer Discrete Applied Mathematics 148 (1), 1-12, 2005 | 93 | 2005 |
| Playing with Boolean blocks, part II: Constraint satisfaction problems E Böhler, N Creignou, S Reith, H Vollmer ACM SIGACT-Newsletter 35 (1), 22-35, 2004 | 82 | 2004 |
| On lions and elligators: An efficient constant-time implementation of CSIDH M Meyer, F Campos, S Reith Post-Quantum Cryptography: 10th International Conference, PQCrypto 2019 …, 2019 | 68 | 2019 |
| Bases for Boolean co-clones E Böhler, S Reith, H Schnoor, H Vollmer Information Processing Letters 96 (2), 59-66, 2005 | 62 | 2005 |
| Equivalence and isomorphism for Boolean constraint satisfaction E Böhler, E Hemaspaandra, S Reith, H Vollmer International Workshop on Computer Science Logic, 412-426, 2002 | 42 | 2002 |
| The complexity of problems defined by Boolean circuits S Reith, KW Wagner The Mathematical Foundation of Informatics, 141-156, 2005 | 35 | 2005 |
| A note on closure properties of logspace MOD classes U Hertrampf, S Reith, H Vollmer Information Processing Letters 75 (3), 91-93, 2000 | 34 | 2000 |
| Lms vs xmss: comparison of stateful hash-based signature schemes on arm cortex-m4 F Campos, T Kohlstadt, S Reith, M Stöttinger International Conference on Cryptology in Africa, 258-277, 2020 | 31 | 2020 |
| Generalized satisfiability problems S Reith Universität Würzburg, 2001 | 28 | 2001 |
| On hybrid SIDH schemes using Edwards and Montgomery curve arithmetic M Meyer, S Reith, F Campos Cryptology ePrint Archive, 2017 | 26 | 2017 |
| Optimal satisfiability for propositional calculi and constraint satisfaction problems S Reith, H Vollmer International Symposium on Mathematical Foundations of Computer Science, 640-649, 2000 | 25 | 2000 |
| On the complexity of some equivalence problems for propositional calculi S Reith Mathematical Foundations of Computer Science 2003: 28th International …, 2003 | 24 | 2003 |
| The complexity of Boolean constraint isomorphism E Böhler, E Hemaspaandra, S Reith, H Vollmer Annual Symposium on Theoretical Aspects of Computer Science, 164-175, 2004 | 23 | 2004 |
| On FPGA-based implementations of Gr\{o} stl B Jungk, S Reith Cryptology ePrint Archive, 2010 | 20 | 2010 |
| On optimized FPGA implementations of the SHA-3 Candidate Grøstl B Jungk, S Reith, J Apfelbeck Cryptology EPrint Archive, 2009 | 20 | 2009 |
| Optimal satisfiability for propositional calculi and constraint satisfaction problems S Reith, H Vollmer Information and Computation 186 (1), 1-19, 2003 | 17 | 2003 |
| Side-channel resistant AES architecture utilizing randomized composite field representations B Jungk, M Stöttinger, J Gampe, S Reith, SA Huss 2012 International Conference on Field-Programmable Technology, 125-128, 2012 | 16 | 2012 |
| The complexity of problems for quantified constraints M Bauland, E Böhler, N Creignou, S Reith, H Schnoor, H Vollmer Theory of Computing Systems 47 (2), 454-490, 2010 | 14 | 2010 |
