Journals in DBLP

Inf. Comput.
2004, volume: 192, number: 2

1. John Ellis, Minko Markov
   Computing the vertex separation of unicyclic graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2004, v:192, n:2, pp:123-161 [Journal]
   
2. Richard Cleve
   The query complexity of order-finding. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2004, v:192, n:2, pp:162-171 [Journal]
   
3. Mark-Jan Nederhof, Giorgio Satta
   The language intersection problem for non-recursive context-free grammars. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2004, v:192, n:2, pp:172-184 [Journal]
   
4. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
   Learning all subfunctions of a function. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2004, v:192, n:2, pp:185-215 [Journal]