Boleslaw Z. Kacewicz

Orcid: 0000-0003-4601-5278

According to our database1, Boleslaw Z. Kacewicz authored at least 36 papers between 1977 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Adaptive mesh point selection for the efficient solution of scalar IVPs.
Numer. Algorithms, 2018

Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information.
J. Complex., 2018

Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems.
Adv. Comput. Math., 2018

2017
Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions.
J. Complex., 2017

2016
On the optimal robust solution of IVPs with noisy information.
Numer. Algorithms, 2016

2015
Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface.
J. Complex., 2015

Efficient solution of IVPs with right-hand sides having discontinuities on an unknown hypersurface.
Appl. Math. Comput., 2015

2014
Optimal solution of a class of non-autonomous initial-value problems with unknown singularities.
J. Comput. Appl. Math., 2014

Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface.
Appl. Math. Comput., 2014

2013
Complexity of solving nonlinear equations in the deterministic, randomized and quantum settings.
Appl. Math. Comput., 2013

2011
On the quantum and randomized approximation of linear functionals on function spaces.
Quantum Inf. Process., 2011

2008
Optimal adaptive solution of initial-value problems with unknown singularities.
J. Complex., 2008

2007
Issue dedicated to Professor Henryk Wozniakowski.
J. Complex., 2007

2006
Almost optimal solution of initial-value problems by randomized and quantum algorithms.
J. Complex., 2006

2005
Improved bounds on the randomized and quantum complexity of initial-value problems.
J. Complex., 2005

2004
Randomized and quantum algorithms yield a speed-up for initial-value problems.
J. Complex., 2004

Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result.
J. Complex., 2004

2003
Weighted Average Errors in Set-Membership Estimation.
Math. Control. Signals Syst., 2003

How to minimize the cost of iterative methods in the presence of perturbations.
J. Complex., 2003

2002
Complexity of Nonlinear Two-Point Boundary-Value Problems.
J. Complex., 2002

2000
Error bounds for conditional algorithms in restricted complexity set membership identification.
IEEE Trans. Autom. Control., 2000

Optimal Average Case Estimation in Hilbert Norms.
Math. Control. Signals Syst., 2000

1999
Worst-case conditional system identification in a general class of norms.
Autom., 1999

1998
Suboptimal conditional estimators for restricted complexity set membership identification.
Proceedings of the Robustness in Identification and Control, Workshop Robustness in Identification and Control, Siena, Italy, July 30, 1998

1997
Model quality evaluation in set membership identification.
Autom., 1997

1995
Recovering Linear Operators from Inaccurate Data.
J. Complex., 1995

1993
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting.
J. Complex., 1993

1991
Noisy information for linear problems in the asymptotic setting.
J. Complex., 1991

1990
On sequential and parallel solution of initial value problems.
J. Complex., 1990

1988
Conditionally optimal algorithms and estimation of reduced order models.
J. Complex., 1988

Minimum asymptotic error of algorithms for solving ODE.
J. Complex., 1988

1987
Optimal solution of ordinary differential equations.
J. Complex., 1987

Asymptotic error of algorithms for solving nonlinear problems.
J. Complex., 1987

1986
How powerful is continuous nonlinear information for linear problems?
J. Complex., 1986

1979
Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions.
J. ACM, 1979

1977
A Survey of Recent Problems and Results in Analytic Computational Complexity.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977


  Loading...