Tony W. Lai

11 papers A* 1A 1B 1C 1Journal 3Unranked 4

Year	Rank	Type	Title / Venue / Authors
2002	—	`conf`	Paging on a RAM with Limited Resources. SWAT Tony W. Lai
1998	J	`jnl`	Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SIAM J. Comput. Tony W. Lai, Derick Wood
1994	J	`jnl`	Updating Approximately Complete Trees. RAIRO Theor. Informatics Appl. Tony W. Lai, Derick Wood
1993	J	`jnl`	A Top-Down Updating Algorithm for Weight-Balanced Trees. Int. J. Found. Comput. Sci. Tony W. Lai, Derick Wood
1991	C	`conf`	A Relationship Between Self-Organizing Lists and Binary Search Trees. ICCI Tony W. Lai, Derick Wood
1991	A*	`conf`	Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SODA Tony W. Lai, Derick Wood
1991	B	`conf`	An interactive knowledge transfer model and analysis of "Mastermind" game. ALT Kenji Koyama, Tony W. Lai
1991	—	`conf`	Comparison-Efficient And Write-Optimal Searching and Sorting. ISA Arne Andersson, Tony W. Lai
1990	—	`conf`	Fast Updating of Well-Balanced Trees. SWAT Arne Andersson, Tony W. Lai
1990	A	`conf`	Updating Almost Complete Trees or One Level Makes All the Difference. STACS Tony W. Lai, Derick Wood
1988	—	`conf`	Implicit Selection. SWAT Tony W. Lai, Derick Wood