The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems Friedrich Otto OriginalPaper Pages: 241 - 251
General circular permutation layout R. D. LouMajid SarrafzadehSumio Masuda OriginalPaper Pages: 269 - 292
The complexity of on-line simulations between multidimensional turing machines and random access machines Michael C. LouiDavid R. Luginbuhl OriginalPaper Pages: 293 - 308