![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Patrick Dehornoy
Person information
- affiliation: University of Caen Normandy, France
Refine list
![note](https://dblp.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
- 2016
- [j21]Patrick Dehornoy:
Laver's results and low-dimensional topology. Arch. Math. Log. 55(1-2): 49-83 (2016) - [j20]Patrick Dehornoy, Yves Guiraud:
Quadratic normalization in monoids. Int. J. Algebra Comput. 26(5): 935-972 (2016) - 2015
- [c2]Patrick Dehornoy:
Garside and Quadratic Normalisation: A Survey. DLT 2015: 14-45 - 2014
- [j19]Patrick Dehornoy, Volker Gebhardt
:
Algorithms for Garside calculus. J. Symb. Comput. 63: 68-116 (2014) - 2011
- [j18]Patrick Dehornoy:
The Subword Reversing Method. Int. J. Algebra Comput. 21(1-2): 71-118 (2011) - 2010
- [j17]Patrick Dehornoy, Marc Autord:
On the distance between the expressions of a permutation. Eur. J. Comb. 31(7): 1829-1846 (2010)
2000 – 2009
- 2008
- [j16]Patrick Dehornoy:
Efficient solutions to the braid isotopy problem. Discret. Appl. Math. 156(16): 3091-3112 (2008) - [j15]Patrick Dehornoy, Vincent van Oostrom
:
Using groups for investigating rewrite systems. Math. Struct. Comput. Sci. 18(6): 1133-1167 (2008) - 2007
- [j14]Patrick Dehornoy:
Combinatorics of normal sequences of braids. J. Comb. Theory A 114(3): 389-409 (2007) - 2006
- [j13]Hervé Sibert, Patrick Dehornoy, Marc Girault:
Entity authentication schemes using braid word reduction. Discret. Appl. Math. 154(2): 420-436 (2006) - [j12]Patrick Dehornoy, Bert Wiest:
On Word Reversing in Braid Groups. Int. J. Algebra Comput. 16(5): 941-958 (2006) - [i3]Patrick Dehornoy:
Using shifted conjugacy in braid-based cryptography. CoRR abs/cs/0609091 (2006) - [i2]Patrick Dehornoy:
Using groups for investigating rewrite systems. CoRR abs/cs/0609102 (2006) - 2002
- [i1]Hervé Sibert, Patrick Dehornoy, Marc Girault:
Entity Authentication Schemes Using Braid Word Reduction. IACR Cryptol. ePrint Arch. 2002: 187 (2002) - 2000
- [j11]Patrick Dehornoy:
On completeness of word reversing. Discret. Math. 225(1-3): 93-119 (2000) - [j10]Patrick Dehornoy:
Construction of Self-Distributive Operations and Charged Braids. Int. J. Algebra Comput. 10(1): 173-190 (2000)
1990 – 1999
- 1998
- [j9]Patrick Dehornoy, Abderrahim Marzouk:
Theorem Proving by Chain Resolution. Theor. Comput. Sci. 206(1-2): 163-180 (1998) - 1996
- [j8]Patrick Dehornoy:
Another use of set theory. Bull. Symb. Log. 2(4): 379-391 (1996) - 1994
- [j7]Patrick Dehornoy:
A Normal Form for the Free Left Distributive Law. Int. J. Algebra Comput. 4(4): 499-528 (1994) - 1992
- [j6]Patrick Dehornoy:
A Criterion for Proving Noetherianity of a Relation. Theor. Comput. Sci. 93(2): 321-325 (1992) - [j5]Patrick Dehornoy:
Probleme de mots dans les gerbes libres. Theor. Comput. Sci. 94(2): 199-213 (1992) - 1991
- [c1]Patrick Dehornoy:
The Naming Problem for Left Distributivity. IWWERT 1991: 57-78 - 1990
- [j4]Patrick Dehornoy:
A coding of the countable linear orderings. Stud Logica 49(4): 585-590 (1990)
1980 – 1989
- 1988
- [j3]Patrick Dehornoy:
φ11-complete families of elementary sequences. Ann. Pure Appl. Log. 38(3): 257-287 (1988) - 1986
- [j2]Patrick Dehornoy:
Turing Complexity of the Ordinals. Inf. Process. Lett. 23(4): 167-170 (1986) - 1983
- [j1]Patrick Dehornoy:
An Application of Ultrapowers to Changing Cofinality. J. Symb. Log. 48(2): 225-235 (1983)
![](https://dblp.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:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint