| 1994 |
|---|
| 9 | | B. John Oommen,
David T. H. Ng:
A New Technique for Enhancing Linked-List Data Retrieval: Reorganize Data Using Artificially synthesized Queries.
Comput. J. 37(7): 598-609 (1994) |
| 1993 |
|---|
| 8 | EE | Robert P. Cheetham,
B. John Oommen,
David T. H. Ng:
Adaptive Structuring of Binary Search Trees Using Conditional Rotations.
IEEE Trans. Knowl. Data Eng. 5(4): 695-704 (1993) |
| 7 | | B. John Oommen,
David T. H. Ng:
An Optimal Absorbing List Organization Strategy with Constant Memory Requirements.
Theor. Comput. Sci. 119(2): 355-361 (1993) |
| 1992 |
|---|
| 6 | | David T. H. Ng,
B. John Oommen:
A Short Note on Doubly-Linked List Reorganizing Heuristics.
Comput. J. 35(5): 533-535 (1992) |
| 1990 |
|---|
| 5 | | B. John Oommen,
David T. H. Ng:
On Generating Random Permutations with Arbitrary Distributions.
Comput. J. 33(4): 368-374 (1990) |
| 1989 |
|---|
| 4 | | B. John Oommen,
David T. H. Ng:
On Generating Random Permutations with Arbitrary Distributions.
ACM Conference on Computer Science 1989: 27-32 |
| 3 | | David T. H. Ng,
B. John Oommen:
Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists.
MFCS 1989: 380-389 |
| 2 | | B. John Oommen,
David T. H. Ng:
Optimal Constant Space Move-to-Rear List Organization.
Optimal Algorithms 1989: 115-125 |
| 1988 |
|---|
| 1 | EE | Robert P. Cheetham,
B. John Oommen,
David T. H. Ng:
On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees.
ICDT 1988: 161-175 |
