Journal: J. Complexity

Volume 18, Issue 4

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

Volume 18, Issue 3

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

Volume 18, Issue 2

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

Volume 18, Issue 1

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