Journals in DBLP

Int. J. Found. Comput. Sci.
2002, volume: 13, number: 5

1. Jesús Mario Bilbao, J. R. Fernández, J. J. López
   On the Complexity of Computing Values of Restricted Games. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:633-651 [Journal]
   
2. Qizhi Fang, Shanfeng Zhu
   Linear and Integer Programming Techniques for Cooperative Games. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:653-666 [Journal]
   
3. Weijia Jia, Zhibin Sun
   On Computational Complexity of Hierarchical Optimization. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:667-670 [Journal]
   
4. Xiaoguang Yang, Shuo Tao, Rongjun Liu, Mao-cheng Cai
   Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:671-679 [Journal]
   
5. Xiaotie Deng, Zhongfei Li, Shouyang Wang
   Computational Complexity of Arbitrage in Frictional Security Market. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:681-684 [Journal]
   
6. Jiwu Shu, Yonggen Gu, Weimin Zheng
   A Novel Numerical Approach of Computing American Option. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:685-693 [Journal]
   
7. Emmanuelle Anceaume
   Efficient Solution to Uniform Atomic Broadcast. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:695-717 [Journal]
   
8. Nicoletta De Francesco, Antonella Santone
   A Formula-Driven Modular Attack on State Explosion. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:719-731 [Journal]
   
9. Carlos Martín-Vide, Alexandru Mateescu, Victor Mitrana
   Parallel Finite Automata Systems Communicating by States. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:733-749 [Journal]
   
10. Abdullah N. Arslan, Ömer Egecioglu
    Approximation Algorithms for Local Alignment with Length Constraints. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:751-767 [Journal]
    
11. Juha Honkala
    Remarks Concerning the D0L w-Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:769-777 [Journal]