Narayan Vikas A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:406-439 [Journal]
Juha Honkala An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:506-519 [Journal]
Philipp Woelfel Bounds on the OBDD-size of integer multiplication via universal hashing. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:520-534 [Journal]