5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.GM2025
Conformal dimensionality reduction / increase
Nicholas J. Daras
We give two low-complexity algorithms, one for dimensionality reduction and one for dimensionality increase, which are applicable to any dataset, regardless of whether the set has…
cs.CR2024
Post-quantum encryption algorithms of high-degree 3-variable polynomial congruences: BS cryptosystems and BS key generation
Nicholas J. Daras
We will construct post-quantum encryption algorithms based on three-variable polynomial Beal-Schur congruence. After giving a proof of Beal's conjecture and citing some application…
math.CV2015★ 5 cited
Universal Padé approximants on simply connected domains
N. Daras, G. Fournodavlos, V. Nestoridis
The theory of universal Taylor series can be extended to the case of Padé approximants where the universal approximation is not realized by polynomials any more, but by rational fu…