Journals in DBLP
Alan Roberts , Antonios Symvonis On the Routing Number of Complete d-ARY Trees. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:411-434 [Journal ] Koichi Yamazaki , Sei'ichi Tani , Tetsuro Nishino A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:435-444 [Journal ] Pak-Ken Wong An Algorithm for Finding Longest Cycles in Certain Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:445-454 [Journal ] Lars Jacobsen , Kim S. Larsen Variants of (A, B)-Trees with Relaxed Balance. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:455-478 [Journal ] Cristian Calude , Hajime Ishihara , Takeshi Yamaguchi Coding with Minimal Programs. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:479-490 [Journal ] Meera Sitharam , Timothy Straney Derandomized Learning of Boolean Functions over Finite Abelian Groups. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:491-516 [Journal ] Oleg Verbitsky Remarks on a Query-Based Variant of the Parallel Repetition Theorem. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:517-532 [Journal ] Wing-Kai Hon , Tak Wah Lam Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:533-550 [Journal ] Adam Obtulowicz Membrane Computing and One-Way Functions. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:551-558 [Journal ]