References
- Abrham , J. 1986 . Exponential Lower Bound for the Number of Skolem and External Langford Sequences . Ars. Combinat. , 22
- Anderson , I. 1990 . Combinatorial Design Construction Methods , Ellis Horwood .
- Dinitz , J. Starters, CRC Handbook on Combinatorial Designs Edited by: Colbourn and Dinitz .
- Dinitz , J. and Stinson , D.R. 1987 . A Hill-climbing Algorithm for the Construction of One-factorizations and Room Squares . SIAM J. Algebraic Discrete Math. , 8 : 430 – 438 .
- Eckler , A.R. 1960 . Construction of Missile Guidance Codes Resistant to Random Interference . Bell Sys, Tech. , : 973 – 994 .
- Gibbons , P. Computational Methods in Design,CRC Handbook on Combinatorial Designs Edited by: Colbourn and Dinitz .
- Gibbons , P. and Mathon , R. 1993 . The Use of Hill-climbing to Construct Orthogonal Steiner Triple Systems . Journal of Combinatorial Designs , 1 : 27 – 50 .
- Gorth , E.J. 1971 . Generation of Binary Sequences with Controllable Complexity . IEEE Trans. on Info. Theory IT-17 , 3 : 288 – 296 .
- Nowakowski , R.J. 1975 . “ Generalizations of the Langford-Skolem Problem ” . In M.Sc. Thesis , University of Calgary .
- Seah , E. and Stinson , D.R. 1988 . A Perfect One-factorizations for k 36 . Discrete Math. , 70 : 199 – 202 .
- Shalaby , N. 1991 . “ Skolem Sequences: Generalizations and Applications ” . In Ph.D. Thesis , McMaster University .
- Shalaby , N. 1996 . Skolem Sequences,CRC Handbook on Combinatorial Designs Edited by: Colbourn and Dinitz .
- 1957 . On Certain Distributions of Integers in Pairs with Given Differences . Math, Scand. , 5 : 57 – 68 .
- Skolem , T. 1958 . Some Remarks on the Triple Systems of Steiner . Math. Scand. , 6 : 273 – 280 .
- Stinson , D.R. 1985 . Hill-climbing Algorithms for the Construction of Combinatorial Designs . Ann. Disc. Math , 26 : 321 – 334 .
- Tovey , C.A. 1985 . Hill-climbing with Multiple Local Optima . SIAM J, Alg, Disc, Math. , 6 ( 3 ) : 384 – 393 .