Papers by Zhenxiang ZHANG : Citations
[Zhang 2015] Estimating the counts of Carmichael and Williams numbers with small multiple seeds, Mathematics of Computation, 84:291 (2015), 309-337.
[Zhang 2011] Counting Carmichael numbers with small seeds, Mathematics of Computation, 80:273 (2011), 437-442.
[Zhang 2010] On the effectiveness of a generalization of Miller's primality theorem, Journal of Complexity, 26:2 (2010), 200-208.
[Zhang and Xie 2010] (with Ruirui Xie) Sylow
p-pseudoprimes to several bases for several primes p,
Bulletin of the Australian Mathematical Society, 81:1 (2010),
165--176.
[Zhang 2007] Two kinds of strong pseudoprimes
up to 1036, Mathematics
of Computation, 76:260 (2007), 2095-2107.
[Zhang,Zhou
and Liu 2006] (with Weiping
Zhou and Xianbei Liu) A generalised Lucasian primality test, Bulletin of the Australian Mathematical
Society, 74:3 (2006), 419-441.
[Zhang 2006] Notes on some new kinds of pseudoprimes, Mathematics of
Computation, 75:253 (2006), 451-460.
[Zhang 2005] Finding
C3 -strong
pseudoprimes, Mathematics of Computation, 74:250 (2005), 1009-1024.
[Zhang and Tang 2003] (with Min Tang) Finding strong pseudoprimes to several bases. II,
Mathematics of Computation, 72:244 (2003), 2085-2097.
[Zhang 2002] A
one-parameter quadratic-base version of the Baillie-PSW probable prime test, Mathematics of
Computation,71:240 (2002), 1699-1734.
[Zhang 2001b] Using Lucas
sequences to factor large integers near group orders, THE FIBONACCI QUARTERLY, 39:3
(2001), 228-237.
[Zhang 2001a] Finding strong pseudoprimes to several bases, Mathematics of Computation, 70:234 (2001), 863-872.
[Zhang 1999] The complexity of an improved
algorithm for matrix multiplication, (in Chinese) Journal of Mathematical
Research and Exposition, 19:4 (1999),
716-718.
[Zhang 1996c] Design and implementation of a multiple precision arithmetic package, (in Chinese) Computer Research and Development, 33:7 (1996), 513-516.
[Zhang 1996b] Implementation of the primality testing algorithm with Jacobi sums on PCs, (in Chinese) Computer Engineering & Science, 18:2 (1996), 23-28.
[Zhang 1996a] Comment: "Estimation of the
number of operations of optimal algorithms for matrix multiplication and
integer convolution"[Math. Numer. Sinica 15 (1993), no. 3, 342--345; 1391413] by L. Z. Cheng
and Y. H. Zeng, (in Chinese) Mathematica Numerica Sinica, 18:1 (1996),
8-11.
[Zhang and Zeng 1995] (with Kencheng Zeng) Factorization of an integer with 53 digits, (in Chinese) Computer Research and Development, 32:6 (1995), 1-4.
[Zhang 1994] Finding finite B2-sequences
with larger m-am1/2, Mathematics of Computation, 63:207
(1994), 403-414.
[Zhang and Pei 1994] (with Dingyi Pei) An analysis of the time complexity of multiple-precision arithmetic, (in Chinese) Mathematics in Practice and Theory, 24:3 (1994), 74-76.
[Erdös and Zhang 1993b] (with P.Erdös) Upper bound of Σ 1/(ai log
ai) for quasi-primitive sequences, Computers Math. Applic., 26:3
(1993), 1-5.
[Zhang 1993c] A B2-sequence with larger reciprocal sum, Mathematics of Computation, 60:202 (1993), 835-839.
[Zhang 1993b] On a problem of Erdös
concerning primitive sequences, Mathematics of Computation, 60:202
(1993), 827-834.
[Erdös and Zhang 1993a] (with P. Erdös) Upper
bound of Σ
1/(ai log ai)
for primitive sequences, Proc.
Amer. Math. Soc., 117:4 (1993), 891-895.
[Zhang 1993a] The time complexity of an algorithm for integer vector convolutions, (in Chinese) Mathematica Numerica Sinica, 15:1 (1993), 93-94.
[Zhang 1992] Time complexity of an algorithm for matrix multiplication, (in Chinese) Journal of Mathematical Research and Exposition, 12:3 (1992), 473-475.
[Zhang 1991b] On a conjecture of Erdös on the sum Σ p<n 1/(p log p), J. Number Theory, 39:1 (1991), 14-17.
[Zhang 1991a] Implementation of the quadratic sieve for factoring large integers on an IBM-PC, (in Chinese) Communications Security, No.2 (1991), 47-49.
[Zhang 1990] A note on the complexity of Euclidean algorithm, (in Chinese) Computer Research and Development, 27:12 (1990), 59. Russian Abstacts (Automation and Computational technology), No.11-12 (1992) : 11B7
2022-1-28