| Publication | Date of Publication | Type |
|---|
| Reducing the space used by the sieve of Eratosthenes when factoring | 2025-01-14 | Paper |
| Computation of the least primitive root | 2025-01-06 | Paper |
| An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\) | 2024-12-16 | Paper |
| Algorithms and bounds on the sums of powers of consecutive primes | 2024-05-23 | Paper |
| Preface | 2023-08-02 | Paper |
| An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice | 2022-08-02 | Paper |
| Computation of the least primitive root | 2022-06-28 | Paper |
| An algorithm and estimates for the Erdős–Selfridge function | 2021-03-11 | Paper |
| An Algorithm to Generate Random Factored Smooth Integers | 2020-06-12 | Paper |
| Two algorithms to find primes in patterns | 2020-04-08 | Paper |
| Approximately counting semismooth integers | 2017-02-10 | Paper |
| Strong pseudoprimes to twelve prime bases | 2017-01-04 | Paper |
| Near-optimal online multiselection in internal and external memory | 2016-02-18 | Paper |
| Two compact incremental prime sieves | 2015-11-05 | Paper |
| Dynamic Online Multiselection in Internal and External Memory | 2015-02-27 | Paper |
| Theory and Implementation of Online Multiselection Algorithms | 2013-09-17 | Paper |
| Computing prime harmonic sums | 2010-11-07 | Paper |
| Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures | 2010-09-29 | Paper |
| A randomized sublinear time parallel GCD algorithm for the EREW PRAM | 2010-09-07 | Paper |
| Algorithmic Number Theory | 2007-05-02 | Paper |
| Algorithmic Number Theory | 2007-05-02 | Paper |
| Modular exponentiation via the explicit Chinese remainder theorem | 2007-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664856 | 2005-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2739472 | 2001-09-09 | Paper |
| Efficient algorithms for computing the Jacobi symbol | 1999-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840160 | 1999-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227305 | 1999-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375616 | 1998-07-20 | Paper |
| Approximating the number of integers free of large prime factors | 1997-12-16 | Paper |
| A space-efficient fast prime number sieve | 1997-02-27 | Paper |
| Explicit bounds for primes in residue classes | 1996-12-03 | Paper |
| Counting the Integers Factorable via Cyclotomic Methods | 1996-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847927 | 1996-06-19 | Paper |
| Two Fast GCD Algorithms | 1995-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325958 | 1995-04-03 | Paper |
| Analysis of a left-shift binary GCD algorithm | 1995-01-22 | Paper |
| Two fast parallel prime number sieves | 1994-10-12 | Paper |
| Polylog depth circuits for integer factoring and discrete logarithms | 1994-09-04 | Paper |
| Sieve algorithms for perfect power testing | 1993-06-29 | Paper |
| An Algorithm to Find Sums of Powers of Consecutive Primes | N/A | Paper |
| An algorithm and computation to verify Legendre's Conjecture up to $3.33\cdot10^{13}$ | N/A | Paper |
