The SCEAS System
Navigation Menu

Journals in DBLP

J. Complexity
2002, volume: 18, number: 1

  1. Stefan Heinrich
    Quantum Summation with an Application to Integration. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:1-50 [Journal]
  2. Asa Ben-Hur, Hava T. Siegelmann, Shmuel Fishman
    A Theory of Complexity for Continuous Time Systems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:51-86 [Journal]
  3. Wilfried Meidl, Harald Niederreiter
    Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:87-103 [Journal]
  4. Felipe Cucker
    Real Computations with Fake Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:104-134 [Journal]
  5. Rong-Xian Yue, Fred J. Hickernell
    The Discrepancy and Gain Coefficients of Scrambled Digital Nets. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:135-151 [Journal]
  6. Shahar Mendelson
    Learnability in Hilbert Spaces with Reproducing Kernels. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:152-170 [Journal]
  7. Anargyros Papageorgiou
    The Brownian Bridge Does Not Offer a Consistent Advantage in Quasi-Monte Carlo Integration. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:171-186 [Journal]
  8. Jean-Pierre Dedieu, Myong-Hi Kim
    Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:187-209 [Journal]
  9. K. J. Harrison, Jonathan R. Partington, J. A. Ward
    Input-Output Identifiability of Continuous-Time Linear Systems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:210-223 [Journal]
  10. Boris Ryabko, Flemming Topsøe
    On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:224-241 [Journal]
  11. Elena Celledoni, Arieh Iserles, Syvert P. Nørsett, Bojan Orel
    Complexity Theory for Lie-Group Solvers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:242-286 [Journal]
  12. Jakob Creu
    Relations between Classical, Average, and Probabilistic Kolmogorov Widths. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:287-303 [Journal]
  13. Orizon Pereira Ferreira, Benar Fux Svaiter
    Kantorovich's Theorem on Newton's Method in Riemannian Manifolds. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:304-329 [Journal]
  14. Youming Li, Grzegorz W. Wasilkowski
    Worst Case Complexity of Weighted Approximation and Integration over Rd. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:330-345 [Journal]
  15. Elizabeth Mauch
    Complexity Estimates for Representations of Schmu"dgen Type. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:346-355 [Journal]
  16. Jovan Dj. Golic, Renato Menicocci
    Computation of Edit Probabilities and Edit Distances for the A5-Type Keystream Generator. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:356-374 [Journal]
  17. Michael N. Vrahatis, Basilis Boutsinas, Panagiotis Alevizos, Georgios Pavlides
    The New k-Windows Algorithm for Improving the k-Means Clustering Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:375-391 [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