default search action
Simon Abelard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Simon Abelard, Alain Couvreur, Grégoire Lecerf:
Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities. Appl. Algebra Eng. Commun. Comput. 35(6): 739-804 (2024) - [j4]Aurélien Dupin, Simon Abelard:
Broadcast Encryption using Sum-Product decomposition of Boolean functions. IACR Commun. Cryptol. 1(1): 18 (2024) - [i5]Aurélien Dupin, Simon Abelard:
Broadcast Encryption using Sum-Product decomposition of Boolean functions. IACR Cryptol. ePrint Arch. 2024: 154 (2024) - 2022
- [j3]Simon Abelard, Elena Berardini
, Alain Couvreur, Grégoire Lecerf:
Computing Riemann-Roch spaces via Puiseux expansions. J. Complex. 73: 101666 (2022) - 2020
- [j2]Simon Abelard:
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus. J. Complex. 57: 101440 (2020) - [c2]Simon Abelard:
On the Complexity of Computing Integral Bases of Function Fields. CASC 2020: 42-62 - [c1]Simon Abelard, Alain Couvreur, Grégoire Lecerf:
Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves. ISSAC 2020: 14-21 - [i4]Simon Abelard:
On the complexity of computing integral bases of function fields. CoRR abs/2005.03964 (2020)
2010 – 2019
- 2019
- [j1]Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Found. Comput. Math. 19(3): 591-621 (2019) - 2018
- [b1]Simon Abelard:
Counting points on hyperelliptic curves in large characteristic : algorithms and complexity. (Comptage de points de courbes hyperelliptiques en grande caractéristique : algorithmes et complexité). University of Lorraine, Nancy, France, 2018 - [i3]Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer:
Counting points on genus-3 hyperelliptic curves with explicit real multiplication. CoRR abs/1806.05834 (2018) - [i2]Simon Abelard:
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus. CoRR abs/1810.11068 (2018) - 2017
- [i1]Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer:
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. CoRR abs/1710.03448 (2017)
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 2025-01-20 22:52 CET 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: