default search action
Ryszard Smarzewski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j15]Przemyslaw Rutka
, Ryszard Smarzewski
The electrostatic equilibrium problem for classical discrete orthogonal polynomials. Math. Comput. 92(341): 1331-1348 (2022) - 2020
- [j14]Waldemar W. Koczkodaj, Ryszard Smarzewski
On Orthogonal Projections on the Space of Consistent Pairwise Comparisons Matrices. Fundam. Informaticae 172(4): 379-397 (2020) - [j13]Waldemar W. Koczkodaj, Fang Liu
On the use of group theory to generalize elements of pairwise comparisons matrix: A cautionary note. Int. J. Approx. Reason. 124: 59-65 (2020) - [j12]Ryszard Smarzewski
Consistent projections and indicators in pairwise comparisons. Int. J. Approx. Reason. 124: 123-132 (2020) - [i1]Waldemar W. Koczkodaj, Ryszard Smarzewski, Jacek Szybowski:
On Orthogonal Projections on the Space of Consistent Pairwise Comparisons Matrices. CoRR abs/2002.06607 (2020)
2010 – 2019
- 2019
- [j11]Przemyslaw Rutka
Difference inequalities and barycentric identities for classical discrete iterated weights. Math. Comput. 88(318): 1791-1804 (2019) - 2017
- [j10]Przemyslaw Rutka
Explicit barycentric formulae for osculatory interpolation at roots of classical orthogonal polynomials. Math. Comput. 86(307): 2409-2427 (2017) - 2012
- [j9]Przemyslaw Rutka
Complete solution of the electrostatic equilibrium problem for classical weights. Appl. Math. Comput. 218(10): 6027-6037 (2012) - [j8]Joanna Kapusta, Ryszard Smarzewski:
Fast multidimensional Bernstein-Lagrange algorithms. Ann. UMCS Informatica 12(2): 7-18 (2012) - 2010
- [j7]Ryszard Smarzewski
An isoperimetric type problem for Bézier curves of degree n. Comput. Aided Geom. Des. 27(4): 313-321 (2010)
2000 – 2009
- 2009
- [j6]Joanna Kapusta, Ryszard Smarzewski
Fast algorithms for multivariate interpolation and evaluation at special points. J. Complex. 25(4): 332-338 (2009) - 2008
- [j5]Przemyslaw Rutka
A weighted extremal problem for the Bézier curves of degree n with jacobi densities. Ann. UMCS Informatica 8(2): 15-26 (2008) - 2007
- [j4]Ryszard Smarzewski
Fast Lagrange-Newton transformations. J. Complex. 23(3): 336-345 (2007) - [j3]Joanna Kapusta, Ryszard Smarzewski:
Fast algorithms for polynomial evaluation and differentiation at special knots. Ann. UMCS Informatica 6(1): 95-102 (2007) - 2006
- [j2]Joanna Kapusta, Ryszard Smarzewski:
Fast interpolating algorithms in cryptography. Ann. UMCS Informatica 5(1): 37-45 (2006) - 2005
- [j1]Ryszard Smarzewski, Joanna Kapusta:
Algorithms for multi-secret hierarchical sharing schemes of shamir type. Ann. UMCS Informatica 3(1): 65-91 (2005)
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-04-25 05:49 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: