Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID"On the complexity of deciding avoidability of sets of partial words."
Brandon Blakeley et al. (2010)
- Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. 411(49): 4263-4271 (2010)
a service of 
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.
last updated on 2021-02-17 22:00 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:
