Journals in DBLP

Int. J. Found. Comput. Sci.
2000, volume: 11, number: 2

1. Sanguthevar Rajasekaran, Sartaj Sahni
   Special Issue on Randomized Computing. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:205- [Journal]
   
2. Keqin Li
   A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:207-230 [Journal]
   
3. Nihar R. Mahapatra, Shantanu Dutt
   Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:231-246 [Journal]
   
4. Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung
   Connectivity Properties in Random Regular Graphs with Edge Faults. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:247-262 [Journal]
   
5. Hung-Min Sun
   On the Dealer's Randomness Required in Perfect Secret Sharing Schemes with Access Structures of Constant Rank. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:263-281 [Journal]
   
6. R. K. Shyamasundar, S. Ramesh
   Languages for Reactive Specifications: Synchrony Vs Asynchrony. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:283-314 [Journal]
   
7. Harald Hempel, Gerd Wechsung
   The Operators min and max on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:315-342 [Journal]
   
8. Hans Zantema, Hans L. Bodlaender
   Finding Small Equivalent Decision Trees is Hard. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:343-354 [Journal]