| 2008 |
| 13 | | Alfred J. van der Poorten,
Andreas Stein:
Algorithmic Number Theory, 8th International Symposium, ANTS-VIII, Banff, Canada, May 17-22, 2008, Proceedings
Springer 2008 |
| 2006 |
| 12 | EE | Alfred J. van der Poorten:
Determined Sequences, Continued Fractions, and Hyperelliptic Curves.
ANTS 2006: 393-405 |
| 2003 |
| 11 | | Alfred J. van der Poorten,
Herman J. J. te Riele,
Hugh C. Williams:
Corrigenda and addition to "Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100 000 000 000".
Math. Comput. 72(241): 521-523 (2003) |
| 10 | | Alfred J. van der Poorten:
A Note on NUCOMP.
Math. Comput. 72(244): 1935-1946 (2003) |
| 2002 |
| 9 | EE | Michael J. Jacobson Jr.,
Alfred J. van der Poorten:
Computational Aspects of NUCOMP.
ANTS 2002: 120-133 |
| 8 | EE | Alfred J. van der Poorten,
Xuan Chuong Tran:
Periodic Continued Fractions in Elliptic Function Fields.
ANTS 2002: 390-404 |
| 7 | EE | Alfred J. van der Poorten:
Peer Refereeing ... Will It Be Missed?
Electronic Information and Communication in Mathematics 2002: 132-143 |
| 2001 |
| 6 | | Alfred J. van der Poorten,
Herman J. J. te Riele,
Hugh C. Williams:
Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000.
Math. Comput. 70(235): 1311-1328 (2001) |
| 2000 |
| 5 | EE | Marek Karpinski,
Alfred J. van der Poorten,
Igor Shparlinski:
Zero testing of p-adic and modular polynomials.
Theor. Comput. Sci. 233(1-2): 309-317 (2000) |
| 1998 |
| 4 | EE | Alfred J. van der Poorten:
Formal Power Series and Their Continued Fraction Expansion.
ANTS 1998: 358-371 |
| 1996 |
| 3 | | Richard P. Brent,
Alfred J. van der Poorten,
Herman J. J. te Riele:
A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers.
ANTS 1996: 35-47 |
| 1994 |
| 2 | | Alfred J. van der Poorten:
Explicit formulas for units in certain quadratic number fields.
ANTS 1994: 194-208 |
| 1989 |
| 1 | | M. Mendes France,
Alfred J. van der Poorten:
From Geometry to Euler Identities.
Theor. Comput. Sci. 65(2): 213-220 (1989) |