Journals in DBLP

J. Comput. Syst. Sci.
2003, volume: 67, number: 2

1. John H. Reif
   Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:211- [Journal]
   
2. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
   Random sampling and approximation of MAX-CSPs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:212-243 [Journal]
   
3. Saugata Basu
   Computing the Betti numbers of arrangements via spectral sequences. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:244-262 [Journal]
   
4. Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair
   Clifford algebras and approximating the permanent. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:263-290 [Journal]
   
5. Mary Cryan, Martin E. Dyer
   A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:291-310 [Journal]
   
6. Xiaotie Deng, Christos H. Papadimitriou, Shmuel Safra
   On the complexity of price equilibria. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:311-324 [Journal]
   
7. Sanjeev Arora, Subhash Khot
   Fitting algebraic curves to noisy data. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:325-340 [Journal]
   
8. Tim Roughgarden
   The price of anarchy is independent of the network topology. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:341-364 [Journal]
   
9. Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
   Recognizing string graphs in NP. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:2, pp:365-380 [Journal]
   
10. Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
    Optimal finger search trees in the pointer machine. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:381-418 [Journal]
    
11. Christopher Umans
    Pseudo-random generators for all hardnesses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:419-440 [Journal]
    
12. Dimitris Achlioptas, Cristopher Moore
    Almost all graphs with average degree 4 are 3-colorable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:441-471 [Journal]