- 16
- 6
- 3
- 2
- 1
- 1
- 1
- 1
- 1
Pascal Giorgi
32
Documents
Publications
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 7
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 18
- 7
- 4
- 1
- 1
- 1
- 1
- 1
|
Fast Secure Computations on Shared Polynomials and Applications to Private Set OperationsITC 2024 - 5th Information-Theoretic Cryptography Conference, Aug 2024, Stanford, CA, United States
Conference papers
lirmm-04593144v1
|
|
Sparse Polynomial Interpolation and Division in Soft-linear TimeISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation, Jul 2022, Lille, France. pp.459-468, ⟨10.1145/3476446.3536173⟩
Conference papers
lirmm-03784815v1
|
|
Random Primes without Primality TestingISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation, Jul 2022, Lille, France. pp.207-215, ⟨10.1145/3476446.3536191⟩
Conference papers
lirmm-03784821v1
|
On exact division and divisibility testing for sparse polynomialsISSAC 2021 - 46th International Symposium on Symbolic and Algebraic Computation, Jul 2021, Saint-Pétersbourg, Russia. pp.163-170, ⟨10.1145/3452143.3465539⟩
Conference papers
hal-03136945v1
|
|
|
Fast in-place algorithms for polynomial operations: division, evaluation, interpolationISSAC 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. pp.210-217, ⟨10.1145/3373207.3404061⟩
Conference papers
lirmm-02493066v3
|
|
Essentially optimal sparse polynomial multiplicationISSAC 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. pp.202-209, ⟨10.1145/3373207.3404026⟩
Conference papers
hal-02476609v2
|
|
Generic reductions for in-place polynomial multiplicationISSAC 2019 - 44th International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.187-194, ⟨10.1145/3326229.3326249⟩
Conference papers
lirmm-02003089v2
|
|
Complex molecule synthesis made easyUniversité Côte d'Azur Complex Days, M. Argentina; S. Barland; P. Reynaud-Bouret; F. Cauneau; K. Guillouzouic; U. Kuhl; T. Passot; F. Planchon, Jan 2018, Nice, France. pp.77-86
Conference papers
hal-02014226v1
|
|
Certification of minimal approximant basesISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. pp.167-174, ⟨10.1145/3208976.3208991⟩
Conference papers
hal-01701861v2
|
|
Recursive double-size fixed precision arithmeticICMS: International Congress of Mathematical Software, Jul 2016, Berlin, Germany. pp.223--231, ⟨10.1007/978-3-319-42432-3_28⟩
Conference papers
hal-00582593v2
|
|
Elements of Design for Containers and Solutions in the LinBox LibraryICMS: International Congress on Mathematical Software, Aug 2014, Seoul, South Korea. pp.654-662, ⟨10.1007/978-3-662-44199-2_98⟩
Conference papers
hal-01015138v1
|
|
Online order basis algorithm and its impact on the block Wiedemann algorithmISSAC 204 - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan. pp.202-209, ⟨10.1145/2608628.2608647⟩
Conference papers
lirmm-01232873v1
|
|
Generating Optimized Sparse Matrix Vector Product over Finite FieldsICMS: International Congress on Mathematical Software, Aug 2014, Séoul, South Korea. pp.685-690, ⟨10.1007/978-3-662-44199-2_102⟩
Conference papers
lirmm-01275818v1
|
|
Parallel modular multiplication on multi-core processorsIEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.135-142, ⟨10.1109/ARITH.2013.20⟩
Conference papers
hal-00805242v1
|
|
Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore ArchitecturesPASCO'10: 4th International Symposium on Parallel Symbolic Computation, Jul 2010, Grenoble, France. pp.80-88, ⟨10.1145/1837210.1837224⟩
Conference papers
hal-00475185v1
|
|
Comparison of Modular Arithmetic Algorithms on GPUsParCo'09: International Conference on Parallel Computing, France. pp.N/A
Conference papers
lirmm-00424288v2
|
|
Optimizing Elliptic Curve Scalar Multiplication for Small ScalarsMathematics for Signal and Information Processing, 2009, San Diego, CA, United States. pp.74440N, ⟨10.1117/12.827689⟩
Conference papers
lirmm-00424282v1
|
|
Formal proof for delayed finite field arithmetic using floating point operators8th Conference on Real Numbers and Computers, Jul 2008, Saint Jacques de Compostelle, Spain. pp.113-122
Conference papers
hal-00135090v3
|
|
Parallel computation of the rank of large sparse matrices from algebraic K-theoryPASCO '07 - International Workshop on Parallel Symbolic Computation, Jul 2007, London, Canada. pp.43-52, ⟨10.1145/1278177.1278186⟩
Conference papers
hal-00142141v2
|
|
Subquadratic Binary Field Multiplier in Double Polynomial SystemSECRYPT'2007: International Conference on Security and Cryptography,, Jul 2007, Barcelona, Spain. pp.229--236
Conference papers
hal-00140082v1
|
FFPACK: finite field linear algebra packageInternational Symposium on Symbolic and Algebraic Computation (ISSAC'04), Jul 2004, Santander, Spain. pp.119-126, ⟨10.1145/1005285.1005304⟩
Conference papers
hal-02018838v1
|
|
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections2007
Preprints, Working Papers, ...
hal-00127807v1
|
|
Solving Sparse Integer Linear Systems2006
Preprints, Working Papers, ...
hal-00021456v1
|
|
Multipartite Modular MultiplicationRR-11024, 2011, pp.25
Reports
lirmm-00618437v1
|
|
Arithmétique et algorithmique en algèbre linéaire exacte pour la bibliothèque LinBoxGénie logiciel [cs.SE]. Ecole normale supérieure de lyon - ENS LYON, 2004. Français. ⟨NNT : ⟩
Theses
tel-00008951v1
|
|
Efficient algorithms and implementation in exact linear algebraSymbolic Computation [cs.SC]. Université de Montpellier, 2019
Habilitation à diriger des recherches
tel-02360023v1
|