Journals in DBLP

Theor. Comput. Sci.
2007, volume: 378, number: 3

1. Zhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:209-210 [Journal]
   
2. Sumit Ganguly
   Counting distinct items over update streams. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:211-222 [Journal]
   
3. Erdong Chen, Linji Yang, Hao Yuan
   Longest increasing subsequences in windows based on canonical antichain partition. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:223-236 [Journal]
   
4. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
   Efficient algorithms for center problems in cactus networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:237-252 [Journal]
   
5. Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
   Decision-making based on approximate and smoothed Pareto curves. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:253-270 [Journal]
   
6. Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
   Average case analysis for tree labelling schemes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:271-291 [Journal]
   
7. Bodo Manthey, Rüdiger Reischuk
   Smoothed analysis of binary search trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:292-315 [Journal]
   
8. Lan Liu, Chen Xi, Jing Xiao, Tao Jiang
   Complexity and approximation of the minimum recombinant haplotype configuration problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:378, n:3, pp:316-330 [Journal]