Journals in DBLP

Int. J. Found. Comput. Sci.
1999, volume: 10, number: 4

1. Daniel Andresen, Tao Yang
   Selected Papers from Irregular 1999 - Preface. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:373-0 [Journal]
   
2. Henrique Mongelli, Siang W. Song
   Parallel Range Minima on Coarse Grained Multicomputers. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:375-390 [Journal]
   
3. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
   Deterministic Branch-and-Bound on Distributed Memory Machines. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:391-404 [Journal]
   
4. Cristina Boeres, Aline Nascimento, Vinod E. F. Rebello
   Cluster-Based Task Scheduling for the LOGP Model. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:405-424 [Journal]
   
5. Frédérique Voisin, Guy-René Perrin
   Sparse Computation with PEI. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:425-442 [Journal]
   
6. Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha
   Distributed Processing in Automata. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:443-464 [Journal]
   
7. Alan P. Sprague, Tadao Takaoka
   O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:465-472 [Journal]
   
8. Ryuhei Uehara
   A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:473-482 [Journal]
   
9. Takeshi Okadome
   Simple Flat Languages: A Learnable Class in the Limit from Positive Data. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:483-502 [Journal]
   
10. Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Minimizing Congestion of Layouts for ATM Networks with Faulty Links. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:503-512 [Journal]
    
11. Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe
    Bipartite Graphs Totally Decomposable by Canonical Decomposition. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:513-534 [Journal]
    
12. Richard Beigel, Anna Bernasconi
    A Note on the Polynomial Representation of Boolean Functions over GF(2). [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:535-0 [Journal]