Journals in DBLP

J. Complexity
1991, volume: 7, number: 4

1. Stefan Heinrich, Jörg-Detlef Kern
   Parallel information-based complexity. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:339-370 [Journal]
   
2. Eric Kostlan
   Statistical complexity of dominant eigenvector calculation. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:371-379 [Journal]
   
3. Klaus Weihrauch
   On the complexity of online computations of real functions. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:380-394 [Journal]
   
4. Jeff I. Chu, Georg Schnitger
   The communication complexity of several problems in matrix computation. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:395-407 [Journal]
   
5. Dario Bini, Victor Y. Pan
   On the evaluation of the Eigenvalues of a banded toeplitz block matrix. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:408-424 [Journal]
   
6. Jeremy A. Kahn
   Newtonian graphs for families of complex polynomials. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:425-442 [Journal]
   
7. Santosh S. Venkatesh, Pierre Baldi
   Programmed interactions in higher-order neural networks: The outer-product algorithm. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 1991, v:7, n:4, pp:443-479 [Journal]