David T. H. Ng

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

1993
Adaptive learning mechanisms for ordering actions using random races.
IEEE Trans. Systems, Man, and Cybernetics, 1993

Adaptive Structuring of Binary Search Trees Using Conditional Rotations.
IEEE Trans. Knowl. Data Eng., 1993

An Optimal Absorbing List Organization Strategy with Constant Memory Requirements.
Theor. Comput. Sci., 1993

1992
A Short Note on Doubly-Linked List Reorganizing Heuristics.
Comput. J., 1992

1990
On Generating Random Permutations with Arbitrary Distributions.
Comput. J., 1990

1989
Optimal Constant Space Move-to-Rear List Organization.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

On Generating Random Permutations with Arbitrary Distributions.
Proceedings of the Computer Trends in the 1990s, 1989

1988
On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees.
Proceedings of the ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31, 1988


  Loading...