- Oscar H. Ibarra:
Verification in Queue-Connected Multicounter Machines. Int. J. Found. Comput. Sci. 13(1): 115-127 (2002) - Weijia Jia, Zhibin Sun:
On Computational Complexity of Hierarchical Optimization. Int. J. Found. Comput. Sci. 13(5): 667-670 (2002) - Fairouz Kamareddine, François Monin:
An Extension of an Automated Termination Method of Recursive Functions. Int. J. Found. Comput. Sci. 13(3): 361-386 (2002) - Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
MONA Implementation Secrets. Int. J. Found. Comput. Sci. 13(4): 571-586 (2002) - Renaud Lepère, Denis Trystram, Gerhard J. Woeginger:
Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. Int. J. Found. Comput. Sci. 13(4): 613-627 (2002) - Charles X. Ling, Nick Cercone:
Editorial Notes. Int. J. Found. Comput. Sci. 13(4): 473-475 (2002) - András Lörincz, István Kókai, Attila Meretei:
Intelligent High-Performance Crawlers Used to Reveal Topic-Specific Structure of WWW. Int. J. Found. Comput. Sci. 13(4): 477-495 (2002) - Andrea Mantler, Helen Cameron:
Constructing Red-Black Tree Shapes. Int. J. Found. Comput. Sci. 13(6): 837-863 (2002) - Carlos Martín-Vide, Alexandru Mateescu, Victor Mitrana:
Parallel Finite Automata Systems Communicating by States. Int. J. Found. Comput. Sci. 13(5): 733-749 (2002) - Mehryar Mohri:
Generic e-Removal and Input e-Normalization Algorithms for Weighted Transducers. Int. J. Found. Comput. Sci. 13(1): 129-143 (2002) - Nadia Nedjah, Luiza de Macedo Mourelle:
Pattern Matching Code Minimization in Rewriting-Based Programming Languages. Int. J. Found. Comput. Sci. 13(6): 873-887 (2002) - Vincent Ng, Mok Kwan Ho:
An Intelligent Agent for Web Advertisements. Int. J. Found. Comput. Sci. 13(4): 531-554 (2002) - Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg:
Computing by Communication in Networks of Membranes. Int. J. Found. Comput. Sci. 13(6): 779-798 (2002) - Giovanni Pighizzini, Jeffrey O. Shallit:
Unary Language Operations, State Complexity and Jacobsthal's Function. Int. J. Found. Comput. Sci. 13(1): 145-159 (2002) - Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan:
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. Int. J. Found. Comput. Sci. 13(3): 387-403 (2002) - Jürgen Schmidhuber:
Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit. Int. J. Found. Comput. Sci. 13(4): 587-612 (2002) - Jiwu Shu, Yonggen Gu, Weimin Zheng:
A Novel Numerical Approach of Computing American Option. Int. J. Found. Comput. Sci. 13(5): 685-693 (2002) - P. S. Thiagarajan, Roland H. C. Yap:
5th Asian Computing Science Conference - Preface. Int. J. Found. Comput. Sci. 13(3): 313-314 (2002) - Nicholas Q. Tran:
On Universally Polynomial Context-Free Languages. Int. J. Found. Comput. Sci. 13(6): 829-835 (2002) - Alper Üngör, Alla Sheffer:
Pitching Tents in Space-Time: Mesh Generation for Discontinuous Galerkin Method. Int. J. Found. Comput. Sci. 13(2): 201-221 (2002) - Guoliang Xu, Chandrajit L. Bajaj, Susan Evans:
C1 Modeling with Hybrid Multiple-Sided A-Patches. Int. J. Found. Comput. Sci. 13(2): 261-284 (2002) - Wei Xu, Richard Hammersley, Karen Lu, Donald S. Fussell:
Lossless Subdivision-Based Multiresolution Representation of Arbitrary Triangle Meshes Using Kite Trees. Int. J. Found. Comput. Sci. 13(2): 243-260 (2002) - Xiaoguang Yang, Shuo Tao, Rongjun Liu, Mao-cheng Cai:
Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective. Int. J. Found. Comput. Sci. 13(5): 671-679 (2002) - Sheng Yu:
Implementation and Application of Automata - Editor's Foreword. Int. J. Found. Comput. Sci. 13(1): 1-3 (2002) - Hans Zantema, Hans L. Bodlaender:
Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002) - Ning Zhong:
Representation and Construction of Ontologies for Web Intelligence. Int. J. Found. Comput. Sci. 13(4): 555-570 (2002)