Search the dblp DataBase
Boleslaw Z. Kacewicz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Boleslaw Z. Kacewicz, Henryk Wozniakowski
A Survey of Recent Problems and Results in Analytic Computational Complexity. [Citation Graph (0, 0)][DBLP]
MFCS, 1977, pp:93-107 [Conf] - Boleslaw Z. Kacewicz
Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions. [Citation Graph (0, 0)][DBLP]
J. ACM, 1979, v:26, n:2, pp:239-249 [Journal] - Boleslaw Z. Kacewicz
Complexity of Nonlinear Two-Point Boundary-Value Problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2002, v:18, n:3, pp:702-738 [Journal] - Boleslaw Z. Kacewicz
How to minimize the cost of iterative methods in the presence of perturbations. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2003, v:19, n:1, pp:85-99 [Journal] - Boleslaw Z. Kacewicz
Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2004, v:20, n:5, pp:796-806 [Journal] - Boleslaw Z. Kacewicz
Randomized and quantum algorithms yield a speed-up for initial-value problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2004, v:20, n:6, pp:821-834 [Journal] - Boleslaw Z. Kacewicz
Improved bounds on the randomized and quantum complexity of initial-value problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2005, v:21, n:5, pp:740-756 [Journal] - Boleslaw Z. Kacewicz
Asymptotic error of algorithms for solving nonlinear problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1987, v:3, n:1, pp:41-56 [Journal] - Boleslaw Z. Kacewicz
Optimal solution of ordinary differential equations. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1987, v:3, n:4, pp:451-465 [Journal] - Boleslaw Z. Kacewicz
Minimum asymptotic error of algorithms for solving ODE. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1988, v:4, n:4, pp:373-389 [Journal] - Boleslaw Z. Kacewicz
On sequential and parallel solution of initial value problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1990, v:6, n:2, pp:136-148 [Journal] - Boleslaw Z. Kacewicz, Marek A. Kowalski
Recovering Linear Operators from Inaccurate Data. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1995, v:11, n:2, pp:227-239 [Journal] - Boleslaw Z. Kacewicz, Mario Milanese, Antonio Vicino
Conditionally optimal algorithms and estimation of reduced order models. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1988, v:4, n:1, pp:73-85 [Journal] - Boleslaw Z. Kacewicz, Leszek Plaskota
Noisy information for linear problems in the asymptotic setting. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1991, v:7, n:1, pp:35-57 [Journal] - Boleslaw Z. Kacewicz, Leszek Plaskota
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1993, v:9, n:1, pp:113-134 [Journal] - Boleslaw Z. Kacewicz, Grzegorz W. Wasilkowski
How powerful is continuous nonlinear information for linear problems? [Citation Graph (0, 0)][DBLP]
J. Complexity, 1986, v:2, n:4, pp:306-316 [Journal] - Boleslaw Z. Kacewicz
Almost optimal solution of initial-value problems by randomized and quantum algorithms. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2006, v:22, n:5, pp:676-690 [Journal]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002