- J. Santoso, G. Dick van Albada, Peter M. A. Sloot, Bobby A. A. Nazief:
Simulation of Hierarchical Resource Management for Meta-Computing Systems. Int. J. Found. Comput. Sci. 12(5): 629-643 (2001) - Jennifer M. Schopf, Francine Berman:
Using Stochastic Information to Predict Application Behavior on Contended Resources. Int. J. Found. Comput. Sci. 12(3): 341-364 (2001) - Weisong Shi, Zhimin Tang:
Load Balancing in Home-Based Software DSMS. Int. J. Found. Comput. Sci. 12(3): 307-324 (2001) - Fabrício Alves Barbosa da Silva, Isaac D. Scherson:
Efficient Parallel Job Scheduling Using Gang Service. Int. J. Found. Comput. Sci. 12(3): 265-284 (2001) - Meera Sitharam, Timothy Straney:
Derandomized Learning of Boolean Functions over Finite Abelian Groups. Int. J. Found. Comput. Sci. 12(4): 491-516 (2001) - Masako Takahashi:
Lambda-Representable Functions Over Term Algebras. Int. J. Found. Comput. Sci. 12(1): 3-29 (2001) - Takayoshi Touyama, Susumu Horiguchi:
Performance Evaluation of Practical Parallel Computer Model LogPQ. Int. J. Found. Comput. Sci. 12(3): 325-340 (2001) - Yasuyuki Tsukada:
Martin-Löf's Type Theory as an Open-Ended Framework. Int. J. Found. Comput. Sci. 12(1): 31-67 (2001) - Yasuyuki Tsukada:
Errata to "Martin-Löf's Type Theory as an Open-Ended Framework". Int. J. Found. Comput. Sci. 12(5): 695 (2001) - Oleg Verbitsky:
Remarks on a Query-Based Variant of the Parallel Repetition Theorem. Int. J. Found. Comput. Sci. 12(4): 517-532 (2001) - Pak-Ken Wong:
An Algorithm for Finding Longest Cycles in Certain Bipartite Graphs. Int. J. Found. Comput. Sci. 12(4): 445-454 (2001) - Koichi Yamazaki, Sei'ichi Tani, Tetsuro Nishino:
A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees. Int. J. Found. Comput. Sci. 12(4): 435-444 (2001) - Albert Y. Zomaya:
Scheduling: Theory and Applications - Guest Editor's Preface. Int. J. Found. Comput. Sci. 12(5): 559-564 (2001)