Journal of Complexity, Volume 9

Volume 9, Number 1, March 1993

• Festschrift for Joseph F. Traub. 1-3
  Electronic Edition (link) BibTeX
• Michael Shub, Steve Smale:
  Complexity of Bezout's Theorem: III. Condition Number and Packing. 4-14
  Electronic Edition (link) BibTeX
• Erich Novak, Klaus Ritter:
  Some Complexity Results for Zero Finding for Univariate Functions. 15-40
  Electronic Edition (link) BibTeX
• Vladimir N. Temlyakov:
  On Approximate Recovery of Functions with Bounded Mixed Derivative. 41-59
  Electronic Edition (link) BibTeX
• Harald Niederreiter:
  Improved Error Bounds for Lattice Rules. 60-75
  Electronic Edition (link) BibTeX
• David Lee, Grzegorz W. Wasilkowski:
  Discontinuity Detection and Thresholding-A Stochastic Approach. 76-96
  Electronic Edition (link) BibTeX
• Arieh Iserles, Gustaf Söderlind:
  Global Bounds on Numerical Error for Ordinary Differential Equations. 97-112
  Electronic Edition (link) BibTeX
• Boleslaw Z. Kacewicz, Leszek Plaskota:
  The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. 113-134
  Electronic Edition (link) BibTeX
• Guri I. Marchuk:
  On Numerical Solution of Poincaré Problem for Oceanic Circulations. 135-
  Electronic Edition (link) BibTeX
• Stefan Heinrich:
  Complexity of Integral Equations and Relations to s-Numbers. 141-153
  Electronic Edition (link) BibTeX
• Arthur G. Werschulz:
  The Complexity of Two-Point Boundary-Value Problems with Analytic Data. 154-170
  Electronic Edition (link) BibTeX
• Peter Mathé:
  On Optimal Random Nets. 171-180
  Electronic Edition (link) BibTeX
• Christopher (Krzysztof) Sikorski, C. W. Tsay, Henryk Wozniakowski:
  An Ellipsoid Algorithm for the Computation of Fixed Points. 181-200
  Electronic Edition (link) BibTeX

Volume 9, Number 2, June 1993

• Zvi Galil, Oded Margalit:
  Witnesses for Boolean Matrix Multiplication and for Transitive Closure. 201-221
  Electronic Edition (link) BibTeX
• Vitaly Maiorov:
  Average n-Widths of the Wiener Space in the L_infinity-Norm. 222-230
  Electronic Edition (link) BibTeX
• Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
  On Randomized Semi-algebraic Test Complexity. 231-251
  Electronic Edition (link) BibTeX
• Anargyros Papageorgiou:
  Integration of Monotone Functions of Several Variables. 252-268
  Electronic Edition (link) BibTeX
• Masao Iri:
  A Proof of the Polynomiality of the Iri-Imai Method. 269-290
  Electronic Edition (link) BibTeX
• Spassimir H. Paskov:
  Average Case Complexity of Multivariate Integration for Smooth Functions. 291-312
  Electronic Edition (link) BibTeX
• Sergei V. Pereverzev, Sergei G. Solodky:
  On Optimization of Direct Methods of Solving Weakly Singular Integral Equations. 313-325
  Electronic Edition (link) BibTeX
• Grzegorz W. Wasilkowski, Henryk Wozniakowski:
  There Exists a Linear Problem with Infinite Combinatory Complexity. 326-337
  Electronic Edition (link) BibTeX

Volume 9, Number 3, September 1993

• Dany Breslauer, Zvi Galil:
  Efficient Comparison Based String Matching. 339-365
  Electronic Edition (link) BibTeX
• Klaus Meer:
  Real Number Models under Various Sets of Operations. 366-372
  Electronic Edition (link) BibTeX
• Feng Gao, Grzegorz W. Wasilkowski:
  On Detecting Regularity of Functions: A Probabilistic Analysis. 373-386
  Electronic Edition (link) BibTeX
• Victor Pan, James Demmel:
  A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem. 387-405
  Electronic Edition (link) BibTeX
• B. K. Natarajan:
  Condition-Sensitive Computation of Approximate Fixed Points. 406-411
  Electronic Edition (link) BibTeX
• S. Perfilov:
  Choosing Optimal Parameters in Iterative Processes. 412-425
  Electronic Edition (link) BibTeX

Volume 9, Number 4, December 1993

• Mario Milanese, Antonio Vicino:
  Information-Based Complexity and Nonparametric Worst-Case System Identification. 427-446
  Electronic Edition (link) BibTeX
• Hans Strauss:
  Variational Principles in Curve Design. 447-457
  Electronic Edition (link) BibTeX
• Leszek Plaskota:
  A Note on Varying Cardinality in the Average Case Setting. 458-470
  Electronic Edition (link) BibTeX
• Joos Heintz, Jacques Morgenstern:
  On the Intrinsic Complexity of Elimination Theory. 471-498
  Electronic Edition (link) BibTeX
• Aaron J. Shenhar:
  On the Kolmogorov Complexity of Arbitrary Objects. 499-517
  Electronic Edition (link) BibTeX