The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1997, volume: 54, number: 2

  1. Dror Lapidot, Adi Shamir
    Fully Parallelized Multi-Prover Protocols for NEXP-Time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:215-220 [Journal]
  2. Jaikumar Radhakrishnan
    Better Lower Bounds for Monotone Threshold Formulas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:221-226 [Journal]
  3. Donald B. Johnson, Panagiotis Takis Metaxas
    Connected Components in O (log^3/2 n) Parallel Time for the CREW PRAM. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:227-242 [Journal]
  4. Zvi Galil, Oded Margalit
    All Pairs Shortest Paths for Graphs with Small Integer Length Edges. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:243-254 [Journal]
  5. Noga Alon, Zvi Galil, Oded Margalit
    On the Exponent of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:255-262 [Journal]
  6. Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
    Breaking the Theta (n log² n) Barrier for Sorting with Faults. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:265-304 [Journal]
  7. Uriel Feige
    A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:305-316 [Journal]
  8. Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk
    The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:317-331 [Journal]
  9. Charles E. Leiserson, Satish Rao, Sivan Toledo
    Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:332-344 [Journal]
  10. Amir M. Ben-Amram
    When Can We Sort in o(n log n) Time? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:345-370 [Journal]
  11. Avrim Blum, Ravindran Kannan
    Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:371-380 [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