David T. H. Ng

According to our database, David T. H. Ng authored at least 10 papers between 1988 and 1994.

Collaborative distances:

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

1994

A New Technique for Enhancing Linked-List Data Retrieval: Reorganize Data Using Artificially synthesized Queries.

B. John Oommen, David T. H. Ng

Comput. J., 1994

1993

Adaptive learning mechanisms for ordering actions using random races.

David T. H. Ng, B. John Oommen, E. R. Hansen

IEEE Trans. Syst. Man Cybern., 1993

Adaptive Structuring of Binary Search Trees Using Conditional Rotations.

Robert P. Cheetham, B. John Oommen, David T. H. Ng

IEEE Trans. Knowl. Data Eng., 1993

An Optimal Absorbing List Organization Strategy with Constant Memory Requirements.

B. John Oommen, David T. H. Ng

Theor. Comput. Sci., 1993

1992

A Short Note on Doubly-Linked List Reorganizing Heuristics.

David T. H. Ng, B. John Oommen

Comput. J., 1992

Enhancing Data Retrieval using Artificially synthesized Queries.

B. John Oommen, David T. H. Ng

Proceedings of the Computer Science and Operations Research, 1992

1990

On Generating Random Permutations with Arbitrary Distributions.

B. John Oommen, David T. H. Ng

Comput. J., 1990

1989

Optimal Constant Space Move-to-Rear List Organization.

B. John Oommen, David T. H. Ng

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists.

David T. H. Ng, B. John Oommen

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees.

Robert P. Cheetham, B. John Oommen, David T. H. Ng

Proceedings of the ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31, 1988