Journal of Complexity
, Volume 5
Volume 5, Number 1, March 1989
Grzegorz W. Wasilkowski
:
A clock synchronization problem with random delays.
1-11
Electronic Edition
(link)
BibTeX
Joel Friedman
:
On the convergence of newton's method.
12-33
Electronic Edition
(link)
BibTeX
Harold Levine
:
A lower bound for the topological complexity of poly(
D, n
).
34-44
Electronic Edition
(link)
BibTeX
Marek A. Kowalski
,
Frank Stenger
:
Optimal complexity recovery of band- and energy-limited signals II.
45-59
Electronic Edition
(link)
BibTeX
Erich Novak
,
Klaus Ritter
:
A stochastic analog to Chebyshev centers and optimal average case algorithms.
60-79
Electronic Edition
(link)
BibTeX
Andrzej Kozek
,
Anna Trzmielak-Staniseawska
:
On a class of omnibus algorithms for zero-finding.
80-95
Electronic Edition
(link)
BibTeX
Benny Chor
,
Oded Goldreich
:
On the power of two-point based sampling.
96-106
Electronic Edition
(link)
BibTeX
Bruno Codenotti
,
Franco Flandoli
:
A Monte Carlo method for the parallel solution of linear systems.
107-117
Electronic Edition
(link)
BibTeX
Volume 5, Number 2, June 1989
Paul E. Wright
:
Statistical complexity of the power method for markov chains.
119-143
Electronic Edition
(link)
BibTeX
Arthur G. Werschulz
:
Optimal algorithms for a problem of optimal control.
144-181
Electronic Edition
(link)
BibTeX
Misako Yokoyama
:
On optimal algorithms for problems defined on groups.
182-194
Electronic Edition
(link)
BibTeX
Grzegorz W. Wasilkowski
:
Randomization for continuous problems.
195-218
Electronic Edition
(link)
BibTeX
James H. Curry
:
On zero finding methods of higher order from data at one point.
219-237
Electronic Edition
(link)
BibTeX
Boris S. Veroy
:
Optimal search algorithm for extrema of a discrete periodic bimodal function.
238-250
Electronic Edition
(link)
BibTeX
Mark A. Kon
,
Roberto Tempo
:
On linearity of spline algorithms.
251-259
Electronic Edition
(link)
BibTeX
Volume 5, Number 3, September 1989
J. Michael Steele
:
Certifying smoothness of discrete functions and measuring legitimacy of images.
261-270
Electronic Edition
(link)
BibTeX
Mark Chaimovich
,
Gregory Freiman
,
Zvi Galil
:
Solving dense subset-sum problems by using analytical number theory.
271-282
Electronic Edition
(link)
BibTeX
Marek A. Kowalski
:
On approximation of band-limited signals.
283-302
Electronic Edition
(link)
BibTeX
Michael Shub
:
On the distance to the zero set of a homogeneous polynomial.
303-305
Electronic Edition
(link)
BibTeX
Arthur G. Werschulz
:
Average case complexity of elliptic partial differential equations.
306-330
Electronic Edition
(link)
BibTeX
Myong-Hi Kim
:
Topological complexity of a root finding algorithm.
331-344
Electronic Edition
(link)
BibTeX
Mark A. Kon
,
Erich Novak
:
On the adaptive and continuous information problems.
345-362
Electronic Edition
(link)
BibTeX
Grzegorz W. Wasilkowski
:
On adaptive information with varying cardinality for linear problems with elliptically contoured measures.
363-368
Electronic Edition
(link)
BibTeX
Leszek Plaskota
:
Asymptotic error for the global maximum of functions in s dimensions.
369-378
Electronic Edition
(link)
BibTeX
Volume 5, Number 4, December 1989
Michael D. Hirsch
,
Christos H. Papadimitriou
,
Stephen A. Vavasis
:
Exponential lower bounds for finding Brouwer fix points.
379-416
Electronic Edition
(link)
BibTeX
Ömer Egecioglu
,
Efstratios Gallopoulos
,
Çetin Kaya Koç
:
Fast computation of divided differences and parallel hermite interpolation.
417-437
Electronic Edition
(link)
BibTeX
David Tischler
:
Critical points and values of complex polynomials.
438-456
Electronic Edition
(link)
BibTeX
Grzegorz W. Wasilkowski
,
Henryk Wozniakowski
:
Mixed settings for linear problems.
457-465
Electronic Edition
(link)
BibTeX
Chef-Seng Chow
,
John N. Tsitsiklis
:
The complexity of dynamic programming.
466-488
Electronic Edition
(link)
BibTeX
Erich Novak
:
Average-case results for zero finding.
489-501
Electronic Edition
(link)
BibTeX
Copyright ©
Sun May 17 00:06:55 2009 by
Michael Ley
(
ley@uni-trier.de
)