 | 1982 |
|---|
| 4 |       | J. H. Halton,
Routo Terada:
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One.
SIAM J. Comput. 11(1): 28-46 (1982) |
| 1964 |
|---|
| 3 |  | J. H. Halton:
Algorithm 247: Radical-inverse quasi-random point sequence.
Commun. ACM 7(12): 701-702 (1964) |
| 1957 |
|---|
| 2 | | J. H. Halton,
D. C. Handscomb:
A Method for Increasing the Efficiency of Monte Carlo Integration.
J. ACM 4(3): 329-340 (1957) |
| 1 | | J. H. Halton,
D. C. Handscomb:
Erratum: ``A Method for Increasing the Efficiency of Monte Carlo Integration''.
J. ACM 4(4): 540 (1957) |
