![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Laurent Habsieger
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j13]Laurent Habsieger, Alain Plagne:
A Numerical Note on Upper Bounds for B2[g] Sets. Exp. Math. 27(2): 208-214 (2018)
2000 – 2009
- 2008
- [c2]Christophe Doche, Laurent Habsieger:
A Tree-Based Approach for Computing Double-Base Chains. ACISP 2008: 433-446 - 2001
- [j12]Laurent Habsieger:
Integer Zeros ofq-Krawtchouk Polynomials in Classical Combinatorics. Adv. Appl. Math. 27(Issues): 427-437 (2001) - 2000
- [j11]Laurent Habsieger, Alain Plagne:
New lower bounds for covering codes. Discret. Math. 222(1-3): 125-149 (2000)
1990 – 1999
- 1999
- [c1]Laurent Habsieger:
Integral zeroes of Krawtchouk polynomials. Codes and Association Schemes 1999: 151-165 - 1997
- [j10]Laurent Habsieger:
Binary codes with covering radius one: Some new lower bounds. Discret. Math. 176(1-3): 115-130 (1997) - [j9]Laurent Habsieger, Bruno Salvy:
On integer Chebyshev polynomials. Math. Comput. 66(218): 763-770 (1997) - 1996
- [j8]Laurent Habsieger:
Some new lower bounds for ternary covering codes. Electron. J. Comb. 3(2) (1996) - 1995
- [j7]Mireille Bousquet-Mélou, Laurent Habsieger:
Sur les matrices à signes alternants. Discret. Math. 139(1-3): 57-72 (1995) - [j6]Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette:
On-Line Evaluation of Powers Using Euclid's Algorithm. RAIRO Theor. Informatics Appl. 29(5): 431-450 (1995) - 1994
- [j5]Laurent Habsieger:
Lower Bounds for q-ary Coverings by Spheres of Radius One. J. Comb. Theory A 67(2): 199-222 (1994) - 1993
- [j4]Laurent Habsieger:
Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavité. Discret. Math. 115(1-3): 167-174 (1993) - [j3]Laurent Habsieger, Dennis Stanton:
More zeros of krawtchouk polynomials. Graphs Comb. 9(2-4): 163-172 (1993) - 1991
- [j2]Peter Gritzmann, Laurent Habsieger, Victor Klee:
Good and Bad Radii of Convex Polygons. SIAM J. Comput. 20(2): 395-403 (1991)
1980 – 1989
- 1989
- [j1]Laurent Habsieger:
Autour de la Conjecture de Dyson. Eur. J. Comb. 10(6): 527-535 (1989)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint