Laurent Habsieger - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2018

A Numerical Note on Upper Bounds for B2[g] SetsLaurent Habsieger, Alain Plagne. em, 27(2):208-214, 2018. [doi]

2008

A Tree-Based Approach for Computing Double-Base ChainsChristophe Doche, Laurent Habsieger. acisp 2008: 433-446 [doi]

2001

q-Krawtchouk Polynomials in Classical CombinatoricsLaurent Habsieger. aam, 27(Issues):427-437, 2001. [doi]

2000

New lower bounds for covering codesLaurent Habsieger, Alain Plagne. DM, 222(1-3):125-149, 2000. [doi]

1999

Integral zeroes of Krawtchouk polynomialsLaurent Habsieger. dimacs 2001: 151-166

1997

Binary codes with covering radius one: Some new lower boundsLaurent Habsieger. DM, 176(1-3):115-130, 1997. [doi]

On integer Chebyshev polynomialsLaurent Habsieger, Bruno Salvy. moc, 66(218):763-770, 1997.

1996

Some new lower bounds for ternary covering codesLaurent Habsieger. combinatorics, 3(2), 1996. [doi]

1995

Sur les matrices à signes alternantsMireille Bousquet-Mélou, Laurent Habsieger. DM, 139(1-3):57-72, 1995. [doi]

On-Line Evaluation of Powers Using Euclid s AlgorithmSrecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette. ita, 29(5):431-450, 1995.

1994

Lower Bounds for q-ary Coverings by Spheres of Radius OneLaurent Habsieger. JCT, 67(2):199-222, 1994.

1993

Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavitéLaurent Habsieger. DM, 115(1-3):167-174, 1993. [doi]

More zeros of krawtchouk polynomialsLaurent Habsieger, Dennis Stanton. gc, 9(2-4):163-172, 1993. [doi]

1991

Good and Bad Radii of Convex PolygonsPeter Gritzmann, Laurent Habsieger, Victor Klee. SICOMP, 20(2):395-403, 1991.

1989

Autour de la Conjecture de DysonLaurent Habsieger. ejc, 10(6):527-535, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL