Tony W. Lai

According to our database, Tony W. Lai authored at least 10 papers between 1988 and 2002.

Collaborative distances:

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

2002

Paging on a RAM with Limited Resources.

Tony W. Lai

Proceedings of the Algorithm Theory, 2002

1998

Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost.

Tony W. Lai, Derick Wood

SIAM J. Comput., 1998

1994

Updating Approximately Complete Trees.

Tony W. Lai, Derick Wood

RAIRO Theor. Informatics Appl., 1994

1993

A Top-Down Updating Algorithm for Weight-Balanced Trees.

Tony W. Lai, Derick Wood

Int. J. Found. Comput. Sci., 1993

1991

Comparison-Efficient And Write-Optimal Searching and Sorting.

Arne Andersson, Tony W. Lai

Proceedings of the ISA '91 Algorithms, 1991

A Relationship Between Self-Organizing Lists and Binary Search Trees.

Tony W. Lai, Derick Wood

Proceedings of the Advances in Computing and Information, 1991

An interactive knowledge transfer model and analysis of "Mastermind" game.

Kenji Koyama, Tony W. Lai

Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1990

Fast Updating of Well-Balanced Trees.

Arne Andersson, Tony W. Lai

Proceedings of the SWAT 90, 1990

Updating Almost Complete Trees or One Level Makes All the Difference.

Tony W. Lai, Derick Wood

Proceedings of the STACS 90, 1990

1988

Implicit Selection.

Tony W. Lai, Derick Wood

Proceedings of the SWAT 88, 1988