default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuilhem Gamard
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i6]Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Hardness of monadic second-order formulae over succinct graphs. CoRR abs/2302.04522 (2023)- 2021
- [c4]Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Rice-Like Theorems for Automata Networks. STACS 2021: 32:1-32:17 - 2020
- [j7]Florian Barbero, Guilhem Gamard
, Anaël Grandjean:
Quasiperiods of biinfinite words. Eur. J. Comb. 85 (2020) - [j6]Cong Thang Pham, Thi Thu Thao Tran, Guilhem Gamard:
An Efficient Total Variation Minimization Method for Image Restoration. Informatica 31(3): 539-560 (2020)
2010 – 2019
- 2019
- [j5]Guilhem Gamard, Gwénaël Richomme:
Coverability and multi-scale coverability on infinite pictures. J. Comput. Syst. Sci. 104: 258-277 (2019) - 2018
- [j4]Cong Thang Pham, Guilhem Gamard, Andrei V. Kopylov, Thi Thu Thao Tran:
An algorithm for image restoration with mixed noise using total variation regularization. Turkish J. Electr. Eng. Comput. Sci. 26(6): 2832-2846 (2018) - [j3]Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. Theor. Comput. Sci. 726: 1-4 (2018) - [i5]Florian Barbero, Guilhem Gamard, Anaël Grandjean:
Quasiperiods of biinfinite Sturmian words. CoRR abs/1803.02643 (2018) - [i4]Guilhem Gamard:
On the entropy of coverable subshifts. CoRR abs/1812.08022 (2018) - 2017
- [b1]Guilhem Gamard:
Couverture d'un mot bidimensionnel par un motif chevauchant. (Covering a bidimensional word with an overlapping pattern). University of Montpellier, France, 2017 - [j2]Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith:
Periodicity in rectangular arrays. Inf. Process. Lett. 118: 58-63 (2017) - [j1]Bruno Durand, Guilhem Gamard, Anaël Grandjean:
Aperiodic tilings and entropy. Theor. Comput. Sci. 666: 36-47 (2017) - 2016
- [c3]Guilhem Gamard, Gwénaël Richomme:
Determining Sets of Quasiperiods of Infinite Words. MFCS 2016: 40:1-40:13 - [i3]Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. CoRR abs/1610.04439 (2016) - 2015
- [c2]Guilhem Gamard, Gwénaël Richomme:
Coverability in Two Dimensions. LATA 2015: 402-413 - [i2]Guilhem Gamard, Gwénaël Richomme:
Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. CoRR abs/1506.08375 (2015) - 2014
- [c1]Bruno Durand, Guilhem Gamard, Anaël Grandjean:
Aperiodic Tilings and Entropy. Developments in Language Theory 2014: 166-177 - 2013
- [i1]Bruno Durand, Guilhem Gamard, Anaël Grandjean:
Aperiodic tilings and entropy. CoRR abs/1312.4126 (2013)
Coauthor Index
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-04-24 23:16 CEST 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:
