L. J. Spring

According to our database, L. J. Spring authored at least 2 papers in 1992.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

1992

An Efficient Algorithm for Crosswood Puzzle Solutions.

G. H. Harris, L. J. Spring, John J. H. Forster

Comput. J., 1992

A proposed benchmark for testing implementations of crossword puzzle algorithms.

L. J. Spring, G. H. Harris, John J. H. Forster, Hal Berghel

Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992