D. J. Abel

According to our database, D. J. Abel authored at least 8 papers between 1981 and 1985.

Collaborative distances:

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

1985

A Re-Examination of Four Classificatory Fusion Strategies.

D. J. Abel, W. T. Williams

Comput. J., 1985

1984

A B⁺-tree structure for large quadtrees.

D. J. Abel

Comput. Vis. Graph. Image Process., 1984

PREPOL: A Method to Convert a Mixed Data Set to All Numeric.

D. J. Abel, W. T. Williams

Aust. Comput. J., 1984

A Data Structure and Query Algorithm for a database of Areal Entities.

D. J. Abel, J. L. Smith

Aust. Comput. J., 1984

A Simple approach to the Nearest-Neighbour Problem.

D. J. Abel, J. L. Smith

Aust. Comput. J., 1984

1983

A data structure and algorithm based on a linear key for a rectangle retrieval problem.

D. J. Abel, J. L. Smith

Comput. Vis. Graph. Image Process., 1983

1981

Program INVER Revisited.

D. J. Abel, W. T. Williams

Aust. Comput. J., 1981

NEBALL and FINGRP: New Programs for Multiple Nearest-Neighbour Analyses.

D. J. Abel, W. T. Williams

Aust. Comput. J., 1981