default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Ballet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c5]Stéphane Ballet, Bastien Pacifico:
Chudnovsky-Type Algorithms over the Projective Line Using Generalized Evaluation Maps. C2SI 2023: 360-375- 2022
- [j9]Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze
, Mila Tukumuli:
Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields. Des. Codes Cryptogr. 90(12): 2783-2811 (2022) - [c4]Stéphane Ballet, Robert Rolland:
Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication. CAI 2022: 3-14 - [c3]Stéphane Ballet, Alexis Bonnecaze, Bastien Pacifico:
Polynomial Constructions of Chudnovsky-type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity. WAIFI 2022: 35-52 - 2021
- [j8]Stéphane Ballet, Alexis Bonnecaze, Thanh-Hung Dang:
Optimization of the scalar complexity of Chudnovsky2 multiplication algorithms in finite fields. Cryptogr. Commun. 13(4): 495-517 (2021)
2010 – 2019
- 2019
- [j7]Stéphane Ballet, Alexey Zykin:
Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields. Des. Codes Cryptogr. 87(2-3): 517-525 (2019) - [c2]Stéphane Ballet, Alexis Bonnecaze, Thanh-Hung Dang:
On the Scalar Complexity of Chudnovsky ^2 Multiplication Algorithm in Finite Fields. CAI 2019: 64-75 - 2017
- [j6]Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland:
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm. Math. Comput. 86(308): 2975-3000 (2017) - 2016
- [i5]Stéphane Ballet, Julia Pieltant, Matthieu Rambaud:
On some bounds for symmetric tensor rank of multiplication in finite fields. CoRR abs/1601.00126 (2016) - 2015
- [i4]Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland:
On Chudnovsky-Based Arithmetic Algorithms in Finite Fields. CoRR abs/1510.00090 (2015) - 2014
- [j5]Stéphane Ballet, Robert Rolland:
On low weight codewords of generalized affine and projective Reed-Muller codes. Des. Codes Cryptogr. 73(2): 271-297 (2014) - [i3]Stéphane Ballet, Julia Pieltant:
Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of $\mathbb{F}_2$ and $\mathbb{F}_3$. CoRR abs/1409.3440 (2014) - 2013
- [c1]Stéphane Ballet, Jean Chaumine, Julia Pieltant:
Shimura Modular Curves and Asymptotic Symmetric Tensor Rank of Multiplication in any Finite Field. CAI 2013: 160-172 - 2012
- [i2]Stéphane Ballet, Robert Rolland:
Remarks on low weight codewords of generalized affine and projective Reed-Muller codes. CoRR abs/1203.4592 (2012) - 2011
- [j4]Stéphane Ballet, Robert Rolland:
A note on Yao's theorem about pseudo-random generators. Cryptogr. Commun. 3(4): 189-206 (2011) - [j3]Stéphane Ballet, Julia Pieltant:
On the tensor rank of multiplication in any extension of Fs. J. Complex. 27(2): 230-245 (2011)
2000 – 2009
- 2009
- [i1]Stéphane Ballet, Robert Rolland:
A NOTE ON YAO'S THEOREM ABOUT PSEUDORANDOM GENERATORS. IACR Cryptol. ePrint Arch. 2009: 548 (2009) - 2006
- [j2]Stéphane Ballet:
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields. Theor. Comput. Sci. 352(1-3): 293-305 (2006) - 2004
- [j1]Stéphane Ballet, Jean Chaumine:
On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields. Appl. Algebra Eng. Commun. Comput. 15(3-4): 205-211 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
