The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
2004, volume: 68, number: 2

  1. Sampath Kannan, Mihalis Yannakakis
    Guest Editors' foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:237- [Journal]
  2. Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy
    A sharp threshold in proof complexity yields lower bounds for satisfiability search. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:238-268 [Journal]
  3. Bernard Chazelle, Ding Liu
    Lower bounds for intersection searching and fractional cascading in higher dimension. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:269-284 [Journal]
  4. Martin Grohe
    Computing crossing numbers in quadratic time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:285-302 [Journal]
  5. Adam R. Klivans, Rocco A. Servedio
    Learning DNF in time 2Õ(n1/3). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:303-318 [Journal]
  6. Marcus Schaefer, Daniel Stefankovic
    Decidability of string graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:319-334 [Journal]
  7. John Dunagan, Santosh Vempala
    Optimal outlier removal in high-dimensional spaces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:335-373 [Journal]
  8. Luca de Alfaro, Rupak Majumdar
    Quantitative solution of omega-regular games. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:374-397 [Journal]
  9. Andris Ambainis
    A new protocol and lower bounds for quantum coin flipping. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:398-416 [Journal]
  10. Moses Charikar, Rina Panigrahy
    Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:417-441 [Journal]
  11. Michel X. Goemans, David P. Williamson
    Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:442-470 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002