Journals in DBLP

J. Comput. Syst. Sci.
2006, volume: 72, number: 5

1. Moses Charikar
   Guest editor's foreword. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:785- [Journal]
   
2. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
   Extractors from Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:786-812 [Journal]
   
3. Camil Demetrescu, Giuseppe F. Italiano
   Fully dynamic all pairs shortest paths with real edge weights. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:813-837 [Journal]
   
4. Lisa Fleischer, Kamal Jain, David P. Williamson
   Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:838-867 [Journal]
   
5. Jittat Fakcharoenphol, Satish Rao
   Planar graphs, negative weight edges, shortest paths, and near linear time. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:868-889 [Journal]
   
6. Yair Bartal, Béla Bollobás, Manor Mendel
   Ramsey-type theorems for metric spaces with applications to online problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:890-921 [Journal]
   
7. Tim Roughgarden
   On the severity of Braess's Paradox: Designing networks for selfish users is hard. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2006, v:72, n:5, pp:922-953 [Journal]