The following pages link to Daniel S. Roche (Q540328):
Displayed 24 items.
- Chunky and equal-spaced polynomial multiplication (Q540329) (← links)
- Interpolation of shifted-lacunary polynomials (Q626682) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- New instantiations of the CRYPTO 2017 masking schemes (Q1710600) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication (Q2819733) (← links)
- Space- and time-efficient polynomial multiplication (Q2883831) (← links)
- An in-place truncated fourier transform and applications to polynomial multiplication (Q2946559) (← links)
- Computing Sparse Multiples of Polynomials (Q3060739) (← links)
- Sparse interpolation over finite fields via low-order roots of unity (Q3452373) (← links)
- Multivariate sparse interpolation using randomized Kronecker substitutions (Q3452374) (← links)
- What Can (and Can't) we Do with Sparse Polynomials? (Q5120174) (← links)
- Error Correction in Fast Matrix Multiplication and Inverse (Q5120215) (← links)
- LU Factorization with Errors (Q5120484) (← links)
- Generic Reductions for In-place Polynomial Multiplication (Q5121106) (← links)
- Fast in-place algorithms for polynomial operations (Q5145975) (← links)
- Faster Sparse Interpolation of Straight-Line Programs (Q5168460) (← links)
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic (Q5203969) (← links)
- Diversification improves interpolation (Q5254162) (← links)
- Sparse polynomials in FLINT (Q5270202) (← links)
- On lacunary polynomial perfect powers (Q5301610) (← links)
- Random primes in arithmetic progressions (Q6390893) (← links)