The SCEAS System
Navigation Menu

Journals in DBLP

J. Complexity
1990, volume: 6, number: 3

  1. Stefan Heinrich
    Probabilistic complexity analysis for linear problems in bounded domains. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:231-255 [Journal]
  2. Klaus Meer
    Computations over Z and R: A comparison. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:256-263 [Journal]
  3. Ingo Althöfer
    The complexity of a simple stochastic OR-tree model in which "directional search" is bad. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:264-277 [Journal]
  4. Grzegorz W. Wasilkowski
    Note on quantization for signals with bounded (r + 1)st derivative. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:278-289 [Journal]
  5. David L. Donoho, Michael Nussbaum
    Minimax quadratic estimation of a quadratic functional. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:290-323 [Journal]
  6. Adam W. Bojanczyk
    Some complexity results in parallel matrix-based signal processing. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:324-336 [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