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: Author="Sikorski, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on two fixed point problems
Ch. Boonyasiriwat
,
K. Sikorski
,
Ch. Xiong
Journal of Complexity
23
(4-6), 2007, pp. 952-961
A recursive algorithm for the infinity-norm fixed point problem
Spencer Shellman
,
K. Sikorski
Journal of Complexity
19
(6), 2003, pp. 799-834
A two-dimensional bisection envelope algorithm for fixed points
Spencer Shellman
,
K. Sikorski
Journal of Complexity
18
(2), 2002, pp. 641-659
Approximating fixed points of weakly contracting mappings
Z. Huang
,
L. Khachiyan
,
K. Sikorski
Journal of Complexity
15
(2), 1999, pp. 200-213
An ellipsoid algorithm for the computation of fixed points
K. Sikorski
,
C.W. Tsay
,
H. Woźniakowski
Journal of Complexity
9
(1), 1993, pp. 181-200
Complexity of fixed points, I
K. Sikorski
,
H. Woźniakowski
Journal of Complexity
3
, 1987, pp. 388-405
Complexity of computing topological degree of Lipschitz functions in
n
dimensions
T. Boult
,
K. Sikorski
Journal of Complexity
2
, 1986, pp. 44-59
Optimal solution of nonlinear equations
K. Sikorski
Journal of Complexity
1
, 1985, pp. 197-209