#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1994

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Serge Burckel
- Order
- 1999

- Serge Burckel, Sébastien Hoarau, Frédéric Mesnard, Ulrich Neumerkel
- 15. WLP
- 2000

- Serge Burckel
- Theor. Comput. Sci.
- 1994

- Serge Burckel
- Theor. Comput. Sci.
- 1996

- Serge Burckel, Marianne Morillon
- ITA
- 2000

- Serge Burckel, Marianne Morillon
- Theor. Comput. Sci.
- 2004

- Serge Burckel, Emeric Gioan, Emmanuel Thomé
- UC
- 2009

We investigate the computation of mappings from a set S to itself with in situ programs, that is using no extra variables than the input, and performing modifications of one component at a time. We consider several types of mappings and obtain effective computation and decomposition methods, together with upper bounds on the program length (number of… (More)

- Serge Burckel, Marianne Morillon
- Theory of Computing Systems
- 2003

This paper proposes a constructive proof that any mapping on n boolean variables can be computed by a straight-line program made up of n2 assignments of the n input variables.

- Serge Burckel
- J. Symb. Comput.
- 2001

Artin’s braid groups Bn (see Birman, 1975, and Garside, 1969) are ordered using left distributive algebras (see Dehornoy, 1994). The restriction of this order to positive braid monoids B n is a well-ordering (see Burckel, 1997, and Laver, 1996). A combinatorial characterization of this well-ordering is based on a representation of braids by trees and… (More)

- Serge Burckel, Emeric Gioan, Emmanuel Thomé
- Discrete Mathematics & Theoretical Computer…
- 2014

We investigate the computation of mappings from a set S to itself with in situ programs, that is using no extra variables than the input, and performing modifications of one component at a time, hence using no extra memory. In this paper, we survey this problem introduced in previous papers by the authors, we detail its close relation with rearrangeable… (More)