Pascal Giorgi

Orcid: 0000-0002-0489-5134

According to our database1, Pascal Giorgi authored at least 36 papers between 2003 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations.
IACR Cryptol. ePrint Arch., 2024

Fast interpolation and multiplication of unbalanced polynomials.
CoRR, 2024

2023
Polynomial modular product verification and its implications.
J. Symb. Comput., 2023

2022
Random primes in arithmetic progressions.
IACR Cryptol. ePrint Arch., 2022

Sparse Polynomial Interpolation and Division in Soft-linear Time.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Random Primes without Primality Testing.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
On Exact Division and Divisibility Testing for Sparse Polynomials.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Essentially optimal sparse polynomial multiplication.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Generic Reductions for In-place Polynomial Multiplication.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Efficient algorithms and implementation in exact linear algebra. (Algorithmes et implantations efficaces en algèbre linéaire exacte).
, 2019

2018
Simultaneous Conversions with the Residue Number System Using Linear Algebra.
ACM Trans. Math. Softw., 2018

A probabilistic algorithm for verifying polynomial middle product in linear time.
Inf. Process. Lett., 2018

Certification of Minimal Approximant Bases.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2016
Recursive Double-Size Fixed Precision Arithmetic.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2014
Elements of Design for Containers and Solutions in the LinBox Library.
CoRR, 2014

Online order basis algorithm and its impact on the block Wiedemann algorithm.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Generating Optimized Sparse Matrix Vector Product over Finite Fields.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Relaxing order basis computation.
ACM Commun. Comput. Algebra, 2013

Parallel Modular Multiplication on Multi-core Processors.
Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

2012
On Polynomial Multiplication in Chebyshev Basis.
IEEE Trans. Computers, 2012

2011
Recursive double-size fixed precision arithmetic
CoRR, 2011

2010
Exact sparse matrix-vector multiplication on GPU's and multicore architectures.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

2009
Comparison of Modular Arithmetic Algorithms on GPUs.
Proceedings of the Parallel Computing: From Multicores and GPU's to Petascale, 2009

2008
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages.
ACM Trans. Math. Softw., 2008

2007
Formal proof for delayed finite field arithmetic using floating point operators
CoRR, 2007

Subquadratic Binary Field Multiplier in Double Polynomial System.
Proceedings of the SECRYPT 2007, 2007

Faster inversion and other black box matrix computations using efficient block projections.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Parallel computation of the rank of large sparse matrices from algebraic K-theory.
Proceedings of the Parallel Symbolic Computation, 2007

2006
Solving Sparse Integer Linear Systems
CoRR, 2006

Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages
CoRR, 2006

Solving sparse rational linear systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2004
Arithmétique et algorithmique en algèbre linéaire exacte pour la bibliothèque LinBox. (Arithmetic and algorithmic in exact linear algebra for the LinBox library).
PhD thesis, 2004

FFPACK: finite field linear algebra package.
Proceedings of the Symbolic and Algebraic Computation, 2004

2003
On the complexity of polynomial matrix computations.
Proceedings of the Symbolic and Algebraic Computation, 2003


  Loading...