Patrick Dehornoy

Affiliations:
  • University of Caen Normandy, France


According to our database1, Patrick Dehornoy authored at least 25 papers between 1983 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Quadratic normalization in monoids.
Int. J. Algebra Comput., 2016

Laver's results and low-dimensional topology.
Arch. Math. Log., 2016

2015
Garside and Quadratic Normalisation: A Survey.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Algorithms for Garside calculus.
J. Symb. Comput., 2014

2011
The Subword Reversing Method.
Int. J. Algebra Comput., 2011

2010
On the distance between the expressions of a permutation.
Eur. J. Comb., 2010

2008
Using groups for investigating rewrite systems.
Math. Struct. Comput. Sci., 2008

Efficient solutions to the braid isotopy problem.
Discret. Appl. Math., 2008

2007
Combinatorics of normal sequences of braids.
J. Comb. Theory A, 2007

2006
On Word Reversing in Braid Groups.
Int. J. Algebra Comput., 2006

Entity authentication schemes using braid word reduction.
Discret. Appl. Math., 2006

Using groups for investigating rewrite systems
CoRR, 2006

Using shifted conjugacy in braid-based cryptography
CoRR, 2006

2000
Construction of Self-Distributive Operations and Charged Braids.
Int. J. Algebra Comput., 2000

On completeness of word reversing.
Discret. Math., 2000

1998
Theorem Proving by Chain Resolution.
Theor. Comput. Sci., 1998

1996
Another use of set theory.
Bull. Symb. Log., 1996

1994
A Normal Form for the Free Left Distributive Law.
Int. J. Algebra Comput., 1994

1992
Probleme de mots dans les gerbes libres.
Theor. Comput. Sci., 1992

A Criterion for Proving Noetherianity of a Relation.
Theor. Comput. Sci., 1992

1991
The Naming Problem for Left Distributivity.
Proceedings of the Word Equations and Related Topics, Second International Workshop, 1991

1990
A coding of the countable linear orderings.
Stud Logica, 1990

1988
φ<sup>1</sup><sub>1</sub>-complete families of elementary sequences.
Ann. Pure Appl. Log., 1988

1986
Turing Complexity of the Ordinals.
Inf. Process. Lett., 1986

1983
An Application of Ultrapowers to Changing Cofinality.
J. Symb. Log., 1983


  Loading...