Journals in DBLP
Inf. Comput. 2001, volume: 168, number: 2
Konstantin Skodinis The Complexity of the K_{n, n} -Problem for Node Replacement Graph Languages. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:168, n:2, pp:95-112 [Journal ] Anna Bernasconi , Carsten Damm , Igor Shparlinski Circuit and Decision Tree Complexity of Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:168, n:2, pp:113-124 [Journal ] Henning Fernau , Ludwig Staiger Iterated Function Systems and Control Languages. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:168, n:2, pp:125-143 [Journal ] Clelia de Felice On Some Schützenberger Conjectures. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:168, n:2, pp:144-155 [Journal ] Frank Neven , Martin Otto , Jerzy Tyszkiewicz , Jan Van den Bussche Adding For-Loops to First-Order Logic. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:168, n:2, pp:156-186 [Journal ] Shigeki Iwata Lower Bounds for Merging Networks. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:168, n:2, pp:187-195 [Journal ]