Journal of Complexity, Volume 18

Volume 18, Number 1, March 2002

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

Volume 18, Number 2, June 2002

• Sergei V. Pereverzev, Grzegorz W. Wasilkowski:
  Dagstuhl 2000. 393-
  Electronic Edition (link) BibTeX
• Norbert Hofmann, Thomas Müller-Gronbach, Klaus Ritter:
  Linear vs Standard Information for Scalar Stochastic Differential Equations. 394-414
  Electronic Edition (link) BibTeX
• Gerhard Larcher, Friedrich Pillichshammer:
  On the L₂-Discrepancy of the Sobol-Hammersley Net in Dimension 3. 415-448
  Electronic Edition (link) BibTeX
• Hrushikesh Narhar Mhaskar:
  On the Representation of Band Limited Functions Using Finitely Many Bits. 449-478
  Electronic Edition (link) BibTeX
• Ian H. Sloan, Henryk Wozniakowski:
  Tractability of Integration in Non-periodic and Periodic Weighted Tensor Product Hilbert Spaces. 479-499
  Electronic Edition (link) BibTeX
• Peter Mathé, Sergei V. Pereverzev:
  Direct Estimation of Linear Functionals from Indirect Noisy Observations. 500-516
  Electronic Edition (link) BibTeX
• Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski:
  Average Case Complexity of Weighted Approximation and Integration over R⁺. 517-544
  Electronic Edition (link) BibTeX
• Eugene L. Allgower, Kurt Georg, Christopher A. Sikorski:
  Joint AMS-SIAM Conference. 545-546
  Electronic Edition (link) BibTeX
• Eugene L. Allgower, Andrew J. Sommese:
  Piecewise Linear Approximation of Smooth Compact Fibers. 547-556
  Electronic Edition (link) BibTeX
• M. Al-Baali:
  Extra-Updates Criterion for the Limited Memory BFGS Algorithm for Large Scale Nonlinear Optimizatio. 557-572
  Electronic Edition (link) BibTeX
• Eugene L. Allgower, Melissa Erdmann, Kurt Georg:
  On the Complexity of Exclusion Algorithms for Optimization. 573-588
  Electronic Edition (link) BibTeX
• R. Baker Kearfott, Jianwei Dian:
  Verifying Topological Indices for Higher-Order Rank Deficiencies. 589-611
  Electronic Edition (link) BibTeX
• Bernard Mourrain, Michael N. Vrahatis, Jean-Claude Yakoubsohn:
  On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree. 612-640
  Electronic Edition (link) BibTeX
• Spencer D. Shellman, K. Sikorski:
  A Two-Dimensional Bisection Envelope Algorithm for Fixed Points. 641-659
  Electronic Edition (link) BibTeX
• Arthur G. Werschulz, Henryk Wozniakowski:
  What Is the Complexity of Volume Calculation? 660-678
  Electronic Edition (link) BibTeX

Volume 18, Number 3, September 2002

• Joseph F. Traub:
  FROM THE EDITOR. 679-
  Electronic Edition (link) BibTeX
• Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
  2001 Best Paper Award. 680-
  Electronic Edition (link) BibTeX
• Fred J. Hickernell, Peter Mathé:
  2002 Best Paper Award Committee. 681-
  Electronic Edition (link) BibTeX
• 2002 Prize for Achievement in Information-Based Complexity. 682-
  Electronic Edition (link) BibTeX
• Xiaoqun Wang:
  A Constructive Approach to Strong Tractability Using Quasi-Monte Carlo Algorithms. 683-701
  Electronic Edition (link) BibTeX
• Boleslaw Z. Kacewicz:
  Complexity of Nonlinear Two-Point Boundary-Value Problems. 702-738
  Electronic Edition (link) BibTeX
• Ding-Xuan Zhou:
  The covering number in learning theory. 739-767
  Electronic Edition (link) BibTeX
• Ingo Steinwart:
  Support Vector Machines are Universally Consistent. 768-791
  Electronic Edition (link) BibTeX
• Youming Li:
  Applicability of Smolyak's Algorithms to Certain Banach Spaces of Multivariate Functions. 792-814
  Electronic Edition (link) BibTeX
• Liu Yongping, Xu Guiqiao:
  The Infinite-Dimensional Widths and Optimal Recovery of Generalized Besov Classes. 815-832
  Electronic Edition (link) BibTeX
• Petra Huhn, Karl Heinz Borgwardt:
  Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure. 833-910
  Electronic Edition (link) BibTeX

Volume 18, Number 4, December 2002

• 2003 Information-Based Complexity Prize Committee. 911-
  Electronic Edition (link) BibTeX
• Peter Hertling:
  Topological Complexity of Zero Finding with Algebraic Operations. 912-942
  Electronic Edition (link) BibTeX
• Frances Y. Kuo, Stephen Joe:
  Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points. 943-976
  Electronic Edition (link) BibTeX
• Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa:
  An Analog Characterization of the Grzegorczyk Hierarchy. 977-1000
  Electronic Edition (link) BibTeX
• Gavin Brown, Dai Feng, Sun Yong Sheng:
  Kolmogorov Width of Classes of Smooth Functions on the Sphere S^d-1. 1001-1023
  Electronic Edition (link) BibTeX
• Jie Wang:
  Complete on Average Boolean Satisfiability. 1024-1036
  Electronic Edition (link) BibTeX