default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Plagne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Frédéric Hecht, Sidi-Mahmoud Kaber, Lucas Perrin, Alain Plagne, Julien Salomon:
Parallel approximation of the exponential of Hermitian matrices. CoRR abs/2306.16778 (2023)
2010 – 2019
- 2018
- [j18]Laurent Habsieger, Alain Plagne:
A Numerical Note on Upper Bounds for B2[g] Sets. Exp. Math. 27(2): 208-214 (2018) - 2016
- [j17]Alain Plagne, Anne de Roton:
Maximal sets with no solution to x+y=3z. Comb. 36(2): 229-248 (2016) - 2013
- [j16]Alain Plagne, Oriol Serra, Gilles Zémor
:
Preface. Eur. J. Comb. 34(8): 1205-1206 (2013) - [j15]Alain Plagne, Oriol Serra, Gilles Zémor:
Yahya Ould Hamidoune's mathematical journey: A critical review of his work. Eur. J. Comb. 34(8): 1207-1222 (2013) - [j14]Yahya Ould Hamidoune, Susana-Clara López, Alain Plagne:
Large restricted sumsets in general Abelian groups. Eur. J. Comb. 34(8): 1348-1364 (2013) - [j13]Oscar Ordaz, Alain Plagne, Wolfgang A. Schmid:
Some remarks on barycentric-sum problems over cyclic groups. Eur. J. Comb. 34(8): 1415-1428 (2013) - 2011
- [j12]Alain Plagne:
Yahya Ould Hamidoune the Mauritanian mathematician 1948 - 11 March 2011. Comb. Probab. Comput. 20(5): 641-645 (2011) - [j11]Alain Plagne:
Sums of Dilates in Groups of Prime Order. Comb. Probab. Comput. 20(6): 867-873 (2011) - [j10]Alain Plagne, Wolfgang A. Schmid:
An application of coding theory to estimating Davenport constants. Des. Codes Cryptogr. 61(1): 105-118 (2011)
2000 – 2009
- 2009
- [j9]Alain Plagne:
A remark on Haas' method. Discret. Math. 309(10): 3318-3322 (2009) - 2007
- [j8]Alain Plagne:
Retraction of "Optimally small sumsets in general Abelian groups" [Adv. in Appl. Math. 38 (2007) 324-326]. Adv. Appl. Math. 39(1): 141 (2007) - [j7]Norbert Hegyvári, François Hennecart, Alain Plagne:
Answer to a Question by Burr and Erdös on Restricted Addition, and Related Results. Comb. Probab. Comput. 16(5): 747-756 (2007) - 2006
- [j6]Alain Plagne:
On threshold properties of k-SAT: An additive viewpoint. Eur. J. Comb. 27(7): 1186-1198 (2006) - 2004
- [j5]Jean-Marc Deshouillers, François Hennecart, Alain Plagne:
On Small Sumsets in (Z/2Z)n. Comb. 24(1): 53-68 (2004) - 2003
- [j4]François Hennecart, Alain Plagne:
On the subgroup generated by a small doubling binary set. Eur. J. Comb. 24(1): 5-14 (2003) - [j3]Guillaume Gommard, Alain Plagne:
K5(7, 3) <= 100. J. Comb. Theory A 104(2): 365-370 (2003) - 2001
- [j2]Alain Plagne:
A New Upper Bound for B2[2] Sets. J. Comb. Theory A 93(2): 378-384 (2001) - 2000
- [j1]Laurent Habsieger, Alain Plagne:
New lower bounds for covering codes. Discret. Math. 222(1-3): 125-149 (2000)
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-06-10 21:22 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:
