| Publication | Date of Publication | Type |
|---|
Reducing the space used by the sieve of Eratosthenes when factoring
Information Processing Letters | 2025-01-14 | Paper |
Computation of the least primitive root
Mathematics of Computation | 2025-01-06 | Paper |
An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\)
Research in Number Theory | 2024-12-16 | Paper |
Algorithms and bounds on the sums of powers of consecutive primes
Integers | 2024-05-23 | Paper |
Preface
Open Book Series | 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
Open Book Series | 2021-03-11 | Paper |
An Algorithm to Generate Random Factored Smooth Integers
| 2020-06-12 | Paper |
Two algorithms to find primes in patterns
Mathematics of Computation | 2020-04-08 | Paper |
Approximately counting semismooth integers
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Strong pseudoprimes to twelve prime bases
Mathematics of Computation | 2017-01-04 | Paper |
Near-optimal online multiselection in internal and external memory
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Two compact incremental prime sieves
LMS Journal of Computation and Mathematics | 2015-11-05 | Paper |
Dynamic online multiselection in internal and external memory
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Theory and implementation of online multiselection algorithms
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Computing prime harmonic sums
Mathematics of Computation | 2010-11-07 | Paper |
Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures
Lecture Notes in Computer Science | 2010-09-29 | Paper |
A randomized sublinear time parallel GCD algorithm for the EREW PRAM
Information Processing Letters | 2010-09-07 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Modular exponentiation via the explicit Chinese remainder theorem
Mathematics of Computation | 2007-02-02 | Paper |
scientific article; zbMATH DE number 2154292 (Why is no real title available?)
| 2005-04-08 | Paper |
scientific article; zbMATH DE number 1643952 (Why is no real title available?)
| 2001-09-09 | Paper |
Efficient algorithms for computing the Jacobi symbol
Journal of Symbolic Computation | 1999-08-23 | Paper |
scientific article; zbMATH DE number 1186941 (Why is no real title available?)
| 1999-05-17 | Paper |
scientific article; zbMATH DE number 1254258 (Why is no real title available?)
| 1999-02-23 | Paper |
scientific article; zbMATH DE number 1113842 (Why is no real title available?)
| 1998-07-20 | Paper |
Approximating the number of integers free of large prime factors
Mathematics of Computation | 1997-12-16 | Paper |
A space-efficient fast prime number sieve
Information Processing Letters | 1997-02-27 | Paper |
Explicit bounds for primes in residue classes
Mathematics of Computation | 1996-12-03 | Paper |
Counting the Integers Factorable via Cyclotomic Methods
Journal of Algorithms | 1996-09-11 | Paper |
scientific article; zbMATH DE number 799776 (Why is no real title available?)
| 1996-06-19 | Paper |
Two Fast GCD Algorithms
Journal of Algorithms | 1995-07-09 | Paper |
scientific article; zbMATH DE number 733563 (Why is no real title available?)
| 1995-04-03 | Paper |
Analysis of a left-shift binary GCD algorithm
Journal of Symbolic Computation | 1995-01-22 | Paper |
Two fast parallel prime number sieves
Information and Computation | 1994-10-12 | Paper |
Polylog depth circuits for integer factoring and discrete logarithms
Information and Computation | 1994-09-04 | Paper |
Sieve algorithms for perfect power testing
Algorithmica | 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 |
