Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Complexity AND Volume=5
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A clock synchronization problem with random delays
G.W. Wasilkowski
Journal of Complexity
5
, 1989, pp. 1-11
On the convergence of Newton's method
Joel Friedman
Journal of Complexity
5
, 1989, pp. 12-33
A lower bound for the topological complexity of Poly(D,n)
Harold Levine
Journal of Complexity
5
, 1989, pp. 34-44
Optimal complexity recovery of band- and energy-limited signals II
Marek A. Kowalski
,
Frank Stenger
Journal of Complexity
5
, 1989, pp. 45-59
A stochastic analog to Chebyshev centers and optimal average case algorithms
Erich Novak
,
Klaus Ritter
Journal of Complexity
5
, 1989, pp. 60-79
On a class of omnibus algorithms for zero-finding
Andrzej Kozek
,
Anna Trzmielak-StanisÆawska
Journal of Complexity
5
, 1989, pp. 80-95
On the power of two-point based sampling
Benny Chor
,
Oded Goldreich
Journal of Complexity
5
, 1989, pp. 96-106
A Monte Carlo method for the parallel solution of linear systems
Bruno Codenotti
,
Franco Flandoli
Journal of Complexity
5
, 1989, pp. 107-117
Statistical complexity of the power method for Markov chains
Paul E. Wright
Journal of Complexity
5
, 1989, pp. 119-143
Optimal algorithms for a problem of optimal control
Arthur G. Werschulz
Journal of Complexity
5
, 1989, pp. 144-181
On optimal algorithms for problems defined on groups
Misako Yokoyama
Journal of Complexity
5
, 1989, pp. 182-194
Randomization for continuous problems
G.W. Wasilkowski
Journal of Complexity
5
, 1989, pp. 195-218
On zero finding methods of higher order from data at one point
James H. Curry
Journal of Complexity
5
, 1989, pp. 219-237
Optimal search algorithm for extrema of a discrete periodic bimodal function
Boris S. Veroy
Journal of Complexity
5
, 1989, pp. 238-250
On linearity of spline algorithms
M.A. Kon
,
R. Tempo
Journal of Complexity
5
, 1989, pp. 251-259
Certifying smoothness of discrete functions and measuring legitimacy of images
J. Michael Steele
Journal of Complexity
5
, 1989, pp. 261-270
Solving dense subset-sum problems by using analytical number theory
Mark Chaimovich
,
Gregory Freiman
,
Zvi Galil
Journal of Complexity
5
, 1989, pp. 271-282
On approximation of band-limited signals
Marek A. Kowalski
Journal of Complexity
5
, 1989, pp. 283-302
On the distance to the zero set of a homogeneous polynomial
Michael Shub
Journal of Complexity
5
, 1989, pp. 303-305
Average case complexity of elliptic partial differential equations
Arthur G. Werschulz
Journal of Complexity
5
, 1989, pp. 306-330
Topological complexity of a root finding algorithm
Myong-Hi Kim
Journal of Complexity
5
, 1989, pp. 331-344
On the adaptive and continuous information problems
Mark A. Kon
,
Erich Novak
Journal of Complexity
5
, 1989, pp. 345-362
On adaptive information with varying cardinality for linear problems with elliptically contoured measures
G.W. Wasilkowski
Journal of Complexity
5
, 1989, pp. 363-368
Asymptotic error for the global maximum of functions in
s
dimensions
L. Plaskota
Journal of Complexity
5
, 1989, pp. 369-378
Exponential lower bounds for finding Brouwer fixed points
Michael D. Hirsch
,
Christos H. Papadimitriou
,
Stephen A. Vavasis
Journal of Complexity
5
, 1989, pp. 379-416
Seiten 1
2
>