Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] (ISNI Number (ISN:)) 0000000122143588 | 1 hits
Person
ISNI: 
0000 0001 2214 3588
Name: 
Riele, H. J. J. te
Riele, Herman J.J. te
Riele, Herman te
Riele, Hermanus Johannes Joseph
Riele, Hermanus Johannes Joseph te
Te Riele, H. J. J.
Te Riele, Herman
Te Riele, Hermanus Johannes Joseph
Dates: 
1947-
Creation class: 
article
cre
Language material
Text
Creation role: 
author
contributor
redactor
Related names: 
Brent, R.P.
Brent, Richard Peirce
Cohen, G.L.
Cohen, Graeme L.
Colloquium Numerical Treatment of Integral Equations (Amsterdam) (1978-1979)
Houwen, P.J. van der (1939-)
Houwen, Pieter Jacobus (1939-)
Lioen, W.M.
Lioen, Walter M.
Lune, J. van de (1937-)
Lune, Jan (1937-)
Montgomery, P.L.
Montgomery, Peter L.
Moree, P. (1965-)
Moree, Pieter (1965-)
Vorst, H. A. van der (1944-)
Wiegerinck, Jan (1956-..)
Wiegerinck, Johannes Joseph Oscar Odilia
Williams, H.C.
Winter, D.T. (1945-2009)
Winter, Dik T. (1945-2009)
Titles: 
Algorithms and applications on vector and parallel computers, 1987:
Amicable pairs, a survey
Checking the Goldbach conjecture on a vector computer
Collocation methods for weakly singular second kind Volterra integral equations with non-smooth solution
Colloquium numerical treatment of integral equations
Computation of all the amicable pairs below 1010
Computational sieving applied to some classical number-theoretic problems
Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100 000 000 000
Disproof of the Mertens conjecture
Divisibility properties of integers x and k satisfying 1k.
European Congress of Mathematics : Amsterdam, 14-18 July, 2008
European Congress of Mathematics, c2010:
Factoring integers with large prime variations of the quadratic sieve
Factoring with the quadratic sieve on large vector computers
Factorizations of a n ± 1, 13≤ a< 100
Factorizations of an ± 1, 13≤ a< 100 : update 2
Factorizations of Cunningham numbers with bases 13 to 99
Further results on unitary aliquot sequences
hexagonal versus the square lattice, The
Improved techniques for lower bounds for odd perfect numbers
Iterating the sum-of-divisors function
Linear multistep methods for volterra integral and integro-differential equations
Linear multistep methods for Volterra integral equations of the second kind
New computations concerning the Cohen-Lenstra heuristics
New experimental results concerning the Goldbach conjecture
new lower bound for the de Bruijn-Newman constant, A
new method for finding amicable pairs, A
Numerical solution of a first kind Fredholm integral equation arising in electron-atom scattering
On generating new amicable pairs from given amicable pairs
On ø-amicable pairs : (with appendix)
On solving the Diophantine equation x3+y3+z3=k on a vector computer
On some conjectural inequalities and their consequences
On the history of the function M(x)/√x since Stieltjes
On the probabilistic complexity of numerically checking the binary Goldbach conjecture in certain intervals
On the sign of the difference π(x)- li(x)
On the size of solutions of the inequality f (ax+b) <f (ax)
On the zeros of the error term for the mean square of [z(1/2.
On the zeros of the Riemann zeta function in the critical strip, III
On the zeros of the Riemann zeta function in the critical strip, IV
Optimization of the MPQS-factoring algorithm on the Cyber 205
Optimization of the real level 2 BLAS on the CYBER 205
Parallel processing in number-theoretical problems
program for solving first kind Fredholm integral equations by means of regularization, A
Rules for constructing hyperperfect numbers
Some experiences of solving 1-D semiconductor device equations on a Matrix coprocessor by a domain decomposition method
Some historical and other notes about the Mertens conjecture and its recent disproof
Special issue on massively parallel computing and applications
theoretical and computational study of generalized aliquot sequences, A
Unitary aliquot sequences
Update 1 to: Factorizations of a n ± 1, 13≤ a< 100
Update 1 to: factorizations of an ± 1, 13≤ a< 100
Volterra-type integral equations of the second kind with non-smooth solutins : high order methods based on collocation techniques
Notes: 
Sources: 
VIAF BNF LC NTA NUKAT SUDOC WKP
DAI
TEL