default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis Wlazinski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Francis Wlazinski:
3-anti-power uniform morphisms. CoRR abs/2312.14514 (2023)
2010 – 2019
- 2017
- [j7]Francis Wlazinski:
A uniform cube-free morphism is k-power-free for all integers k ≥ 4. RAIRO Theor. Informatics Appl. 51(4): 205-216 (2017) - 2016
- [j6]Francis Wlazinski:
Reduction in non-(k + 1)-power-free morphisms. RAIRO Theor. Informatics Appl. 50(1): 3-20 (2016)
2000 – 2009
- 2007
- [j5]Gwénaël Richomme, Francis Wlazinski:
Existence of finite test-sets for k-power-freeness of uniform morphisms. Discret. Appl. Math. 155(15): 2001-2016 (2007) - [c5]Olivier Soyez, Cyril Randriamaro, Gil Utard, Francis Wlazinski:
Dynamic Distribution for Data Storage in a P2P Network. GPC 2007: 555-566 - 2006
- [j4]Cyril Randriamaro, Olivier Soyez, Gil Utard, Francis Wlazinski:
Data Distribution in a Peer to Peer Storage System. J. Grid Comput. 4(3): 311-321 (2006) - 2005
- [c4]Cyril Randriamaro, Olivier Soyez, Gil Utard, Francis Wlazinski:
Data distribution in a peer to peer storage system. CCGRID 2005: 284-291 - [c3]Cyril Randriamaro, Olivier Soyez, Gil Utard, Francis Wlazinski:
Data distribution for failure correlation management in a Peer to Peer storage system. ISPDC 2005: 242-249 - [i1]Gwénaël Richomme, Francis Wlazinski:
Existence of finite test-sets for k-power-freeness of uniform morphisms. CoRR abs/cs/0512051 (2005) - 2004
- [j3]Gwénaël Richomme, Francis Wlazinski:
Overlap-free morphisms and finite test-sets. Discret. Appl. Math. 143(1-3): 92-109 (2004) - 2002
- [j2]Gwénaël Richomme, Francis Wlazinski:
Some results on k-power-free morphisms. Theor. Comput. Sci. 273(1-2): 119-142 (2002) - [c2]Gwénaël Richomme, Francis Wlazinski:
Finite Test-Sets for Overlap-Free Morphisms. MFCS 2002: 605-614 - 2001
- [j1]Francis Wlazinski:
A test-set for k-power-free binary morphisms. RAIRO Theor. Informatics Appl. 35(5): 437-452 (2001) - 2000
- [c1]Gwénaël Richomme, Francis Wlazinski:
About Cube-Free Morphisms. STACS 2000: 99-109
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 2025-01-09 13:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
