default search action
Boleslaw Z. Kacewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j34]Boleslaw Z. Kacewicz
:
Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems. Adv. Comput. Math. 44(5): 1325-1344 (2018) - [j33]Boleslaw Z. Kacewicz
Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information. J. Complex. 47: 86-96 (2018) - [j32]Boleslaw Z. Kacewicz
Adaptive mesh point selection for the efficient solution of scalar IVPs. Numer. Algorithms 77(1): 57-75 (2018) - 2017
- [j31]Boleslaw Z. Kacewicz
Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions. J. Complex. 38: 6-21 (2017) - 2016
- [j30]Boleslaw Z. Kacewicz
On the optimal robust solution of IVPs with noisy information. Numer. Algorithms 71(3): 505-518 (2016) - 2015
- [j29]Boleslaw Z. Kacewicz
Efficient solution of IVPs with right-hand sides having discontinuities on an unknown hypersurface. Appl. Math. Comput. 265: 469-485 (2015) - [j28]Boleslaw Z. Kacewicz
Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface. J. Complex. 31(1): 75-97 (2015) - 2014
- [j27]Boleslaw Z. Kacewicz
Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface. Appl. Math. Comput. 228: 116-127 (2014) - [j26]Boleslaw Z. Kacewicz
Optimal solution of a class of non-autonomous initial-value problems with unknown singularities. J. Comput. Appl. Math. 261: 364-377 (2014) - 2013
- [j25]Maciej Gocwin
Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings. Appl. Math. Comput. 224: 652-662 (2013) - 2011
- [j24]Boleslaw Z. Kacewicz
On the quantum and randomized approximation of linear functionals on function spaces. Quantum Inf. Process. 10(3): 279-296 (2011)
2000 – 2009
- 2008
- [j23]Boleslaw Z. Kacewicz
Optimal adaptive solution of initial-value problems with unknown singularities. J. Complex. 24(4): 455-476 (2008) - 2007
- [j22]Boleslaw Z. Kacewicz
Issue dedicated to Professor Henryk Wozniakowski. J. Complex. 23(4-6): 421-422 (2007) - 2006
- [j21]Boleslaw Z. Kacewicz
Almost optimal solution of initial-value problems by randomized and quantum algorithms. J. Complex. 22(5): 676-690 (2006) - 2005
- [j20]Boleslaw Z. Kacewicz
Improved bounds on the randomized and quantum complexity of initial-value problems. J. Complex. 21(5): 740-756 (2005) - 2004
- [j19]Boleslaw Z. Kacewicz
Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result. J. Complex. 20(5): 796-806 (2004) - [j18]Boleslaw Z. Kacewicz
Randomized and quantum algorithms yield a speed-up for initial-value problems. J. Complex. 20(6): 821-834 (2004) - 2003
- [j17]Boleslaw Z. Kacewicz
How to minimize the cost of iterative methods in the presence of perturbations. J. Complex. 19(1): 85-99 (2003) - [j16]Boleslaw Z. Kacewicz
Weighted Average Errors in Set-Membership Estimation. Math. Control. Signals Syst. 16(2-3): 238-253 (2003) - 2002
- [j15]Boleslaw Z. Kacewicz
Complexity of Nonlinear Two-Point Boundary-Value Problems. J. Complex. 18(3): 702-738 (2002) - 2000
- [j14]Boleslaw Z. Kacewicz
Optimal Average Case Estimation in Hilbert Norms. Math. Control. Signals Syst. 13(4): 347-359 (2000) - [j13]Andrea Garulli
Error bounds for conditional algorithms in restricted complexity set membership identification. IEEE Trans. Autom. Control. 45(1): 160-164 (2000)
1990 – 1999
- 1999
- [j12]Boleslaw Z. Kacewicz
Worst-case conditional system identification in a general class of norms. Autom. 35(6): 1049-1058 (1999) - 1998
- [c2]Andrea Garulli, Boleslaw Z. Kacewicz, Antonio Vicino, Giovanni Zappa:
Suboptimal conditional estimators for restricted complexity set membership identification. Robustness in Identification and Control 1998: 117-133 - 1997
- [j11]Laura Giarré, Boleslaw Z. Kacewicz
Model quality evaluation in set membership identification. Autom. 33(6): 1133-1139 (1997) - 1995
- [j10]Boleslaw Z. Kacewicz
Recovering Linear Operators from Inaccurate Data. J. Complex. 11(2): 227-239 (1995) - 1993
- [j9]Boleslaw Z. Kacewicz
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. J. Complex. 9(1): 113-134 (1993) - 1991
- [j8]Boleslaw Z. Kacewicz
Noisy information for linear problems in the asymptotic setting. J. Complex. 7(1): 35-57 (1991) - 1990
- [j7]Boleslaw Z. Kacewicz
On sequential and parallel solution of initial value problems. J. Complex. 6(2): 136-148 (1990)
1980 – 1989
- 1988
- [j6]Boleslaw Z. Kacewicz
Conditionally optimal algorithms and estimation of reduced order models. J. Complex. 4(1): 73-85 (1988) - [j5]Boleslaw Z. Kacewicz
Minimum asymptotic error of algorithms for solving ODE. J. Complex. 4(4): 373-389 (1988) - 1987
- [j4]Boleslaw Z. Kacewicz
Asymptotic error of algorithms for solving nonlinear problems. J. Complex. 3(1): 41-56 (1987) - [j3]Boleslaw Z. Kacewicz
Optimal solution of ordinary differential equations. J. Complex. 3(4): 451-465 (1987) - 1986
- [j2]Boleslaw Z. Kacewicz
How powerful is continuous nonlinear information for linear problems? J. Complex. 2(4): 306-316 (1986)
1970 – 1979
- 1979
- [j1]Boleslaw Z. Kacewicz
Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions. J. ACM 26(2): 239-249 (1979) - 1977
- [c1]Boleslaw Z. Kacewicz
A Survey of Recent Problems and Results in Analytic Computational Complexity. MFCS 1977: 93-107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: