![]() |
| 2002 | ||
|---|---|---|
| 10 | EE | Tony W. Lai: Paging on a RAM with Limited Resources. SWAT 2002: 418-427 |
| 1998 | ||
| 9 | EE | Tony W. Lai, Derick Wood: Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SIAM J. Comput. 27(6): 1564-1591 (1998) |
| 1994 | ||
| 8 | Tony W. Lai, Derick Wood: Updating Approximately Complete Trees. ITA 28(5): 431-446 (1994) | |
| 1993 | ||
| 7 | Tony W. Lai, Derick Wood: A Top-Down Updating Algorithm for Weight-Balanced Trees. Int. J. Found. Comput. Sci. 4(4): 309-324 (1993) | |
| 1991 | ||
| 6 | Tony W. Lai, Derick Wood: A Relationship Between Self-Organizing Lists and Binary Search Trees. ICCI 1991: 111-116 | |
| 5 | Arne Andersson, Tony W. Lai: Comparison-Efficient And Write-Optimal Searching and Sorting. ISA 1991: 273-282 | |
| 4 | Tony W. Lai, Derick Wood: Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SODA 1991: 72-77 | |
| 1990 | ||
| 3 | Tony W. Lai, Derick Wood: Updating Almost Complete Trees or One Level Makes All the Difference. STACS 1990: 188-194 | |
| 2 | Arne Andersson, Tony W. Lai: Fast Updating of Well-Balanced Trees. SWAT 1990: 111-121 | |
| 1988 | ||
| 1 | Tony W. Lai, Derick Wood: Implicit Selection. SWAT 1988: 14-23 | |
| 1 | Arne Andersson | [2] [5] |
| 2 | Derick Wood | [1] [3] [4] [6] [7] [8] [9] |