Implicit Selection. - Tony W. Lai; Derick Wood (SWAT, 1988)

Updating Almost Complete Trees or One Level Makes All the Difference. - Tony W. Lai; Derick Wood (STACS, 1990)

Fast Updating of Well-Balanced Trees. - Arne Andersson; Tony W. Lai (SWAT, 1990)

An interactive knowledge transfer model and analysis of "Mastermind" game. - Kenji Koyama; Tony W. Lai (ALT, 1991)

A Relationship Between Self-Organizing Lists and Binary Search Trees. - Tony W. Lai; Derick Wood (ICCI, 1991)

Comparison-Efficient And Write-Optimal Searching and Sorting. - Arne Andersson; Tony W. Lai (ISA, 1991)

A Top-Down Updating Algorithm for Weight-Balanced Trees. - Tony W. Lai; Derick Wood (Int. J. Found. Comput. Sci., 1993)

Updating Approximately Complete Trees. - Tony W. Lai; Derick Wood (RAIRO Theor. Informatics Appl., 1994)

Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. - Tony W. Lai; Derick Wood (SIAM J. Comput., 1998)

Paging on a RAM with Limited Resources. - Tony W. Lai (SWAT, 2002)