Complete Classifications for the Communication Complexity of Regular Languages Pascal TessonDenis Thérien OriginalPaper 24 November 2004 Pages: 135 - 159
Commutation with Ternary Sets of Words Juhani KarhumäkiMichel LatteuxIon Petre OriginalPaper 14 January 2005 Pages: 161 - 169
The Complexity of Resolution with Generalized Symmetry Rules Stefan Szeider OriginalPaper 21 January 2005 Pages: 171 - 188
Effective Jordan Decomposition Xizhong ZhengRobert Rettinger OriginalPaper 13 December 2004 Pages: 189 - 209
Some Results on Derandomization Harry BuhrmanLance FortnowA. Pavan OriginalPaper 20 December 2004 Pages: 211 - 227
Space Efficient Hash Tables with Worst Case Constant Access Time Dimitris FotakisRasmus PaghPaul Spirakis OriginalPaper 13 December 2004 Pages: 229 - 248