Laurent Habsieger

According to our database1, Laurent Habsieger authored at least 15 papers between 1989 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
A Numerical Note on Upper Bounds for B2[g] Sets.
Exp. Math., 2018

2008
A Tree-Based Approach for Computing Double-Base Chains.
Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2001
Integer Zeros of<i>q</i>-Krawtchouk Polynomials in Classical Combinatorics.
Adv. Appl. Math., 2001

2000
New lower bounds for covering codes.
Discret. Math., 2000

1999
Integral zeroes of Krawtchouk polynomials.
Proceedings of the Codes and Association Schemes, 1999

1997
On integer Chebyshev polynomials.
Math. Comput., 1997

Binary codes with covering radius one: Some new lower bounds.
Discret. Math., 1997

1996
Some new lower bounds for ternary covering codes.
Electron. J. Comb., 1996

1995
On-Line Evaluation of Powers Using Euclid's Algorithm.
RAIRO Theor. Informatics Appl., 1995

Sur les matrices à signes alternants.
Discret. Math., 1995

1994
Lower Bounds for q-ary Coverings by Spheres of Radius One.
J. Comb. Theory, Ser. A, 1994

1993
More zeros of krawtchouk polynomials.
Graphs Comb., 1993

Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavité.
Discret. Math., 1993

1991
Good and Bad Radii of Convex Polygons.
SIAM J. Comput., 1991

1989
Autour de la Conjecture de Dyson.
Eur. J. Comb., 1989


  Loading...