A linear sieve algorithm for finding prime numbers
Communications of the ACM
Some new upper bounds on the generation of prime numbers
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An Exercise in Program Explanation
An Exercise in Program Explanation
A practical sieve algorithm finding prime numbers
Communications of the ACM
Communications of the ACM
Randomised algorithms for isomorphisms of simple types
Mathematical Structures in Computer Science
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Algorithms and theory of computation handbook
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
| Hi-index | 48.29 |