The following pages link to Joris van der Hoeven (Q190427):
Displayed 50 items.
- Certifying Trajectories of Dynamical Systems (Q2807872) (← links)
- Mathematical Font Art (Q2819273) (← links)
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms (Q2819758) (← links)
- GNU $_{\scriptsize{\rm MACS}}$ towards a Scientific Office Suite (Q2879178) (← links)
- Effective real numbers in Mmxlib (Q2958980) (← links)
- Structured FFT and TFT (Q2963258) (← links)
- Asymptotic Differential Algebra and Model Theory of Transseries (Q2963577) (← links)
- Fast Polynomial Multiplication over F <sub>2</sub> <sub>60</sub> (Q2985835) (← links)
- Modular SIMD arithmetic in M <scp>athemagix</scp> (Q3176303) (← links)
- Faster Polynomial Multiplication over Finite Fields (Q3177879) (← links)
- Faster relaxed multiplication (Q3452421) (← links)
- (Q3566603) (← links)
- (Q4226932) (← links)
- (Q4227357) (← links)
- (Q4232510) (← links)
- (Q4342498) (← links)
- (Q4421461) (← links)
- (Q4519869) (← links)
- Maximal immediate extensions of valued differential fields (Q4583434) (← links)
- On the Complexity of Multivariate Polynomial Division (Q4610026) (← links)
- Preserving Syntactic Correctness While Editing Mathematical Formulas (Q4610027) (← links)
- Efficient Certification of Numeric Solutions to Eigenproblems (Q4628482) (← links)
- Fast Chinese Remaindering in Practice (Q4628483) (← links)
- Implementing Fast Carryless Multiplication (Q4628485) (← links)
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q4630311) (← links)
- Dimension in the realm of transseries (Q4635356) (← links)
- The truncated fourier transform and applications (Q4657338) (← links)
- (Q4660660) (← links)
- (Q4660693) (← links)
- Faster integer multiplication using plain vanilla FFT primes (Q4683179) (← links)
- (Q4998449) (← links)
- Implementing the Tangent Graeffe Root Finding Method (Q5041082) (← links)
- On a differential intermediate value property (Q5054753) (← links)
- Ultimate complexity for numerical algorithms (Q5060285) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- Revisiting closed asymptotic couples (Q5088620) (← links)
- On sparse interpolation of rational functions and gcds (Q5102020) (← links)
- Computing one billion roots using the tangent Graeffe method (Q5102031) (← links)
- EFFECTIVE ASYMPTOTICS ANALYSIS FOR FINANCE (Q5114683) (← links)
- The Frobenius FFT (Q5119972) (← links)
- Composition Modulo Powers of Polynomials (Q5119973) (← links)
- Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases (Q5120197) (← links)
- LU Factorization with Errors (Q5120484) (← links)
- ON NUMBERS, GERMS, AND TRANSSERIES (Q5122017) (← links)
- Mathemagix (Q5175317) (← links)
- Logarithmic hyperseries (Q5234517) (← links)
- On the complexity of multivariate blockwise polynomial multiplication (Q5244537) (← links)
- Automatic asymptotics for coefficients of smooth, bivariate rational functions (Q5494771) (← links)
- Fast evaluation of holonomic functions near and in regular singularities (Q5937886) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)