The SCEAS System
Navigation Menu

Journals in DBLP

J. Complexity
1987, volume: 3, number: 3

  1. John N. Tsitsiklis, Zhi-Quan Luo
    Communication complexity of convex optimization. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:231-243 [Journal]
  2. Edward W. Packel
    The algorithm designer versus nature: A game-theoretic approach to information-based complexity. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:244-257 [Journal]
  3. Michael Shub
    On the asymptotic behavior of the projective rescaling algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:258-269 [Journal]
  4. Arthur G. Werschulz
    An information-based approach to III-posed problems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:270-301 [Journal]
  5. Donald G. Saari
    Some informational requirements for convergence. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:302-311 [Journal]
  6. Charles A. Micchelli, T. J. Rivlin
    An optimal recovery view of Walsh's equiconvergence theorem. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:312-330 [Journal]
  7. Ivo Babuska
    Information-based numerical practice. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:331-346 [Journal]
  8. Aleksei G. Sukharev
    The concept of sequential optimality for problems in numerical analysis. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:3, pp:347-357 [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