default search action
Gérard Maze
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c8]Abdelkader Elhanaoui, Gérard Maze, Elhoucein Aassif, Dominique Decultot:
Usefulness of time-frequency treatment to an acoustic signal. ATSIP 2017: 1-5 - 2016
- [j6]Yaya Sidibé, Fabrice Druaux, Dimitri Lefebvre, Gérard Maze, Fernand Leon:
Signal processing and Gaussian neural networks for the edge and damage detection in immersed metal plate-like structures. Artif. Intell. Rev. 46(3): 289-305 (2016) - [c7]Youssef Nahraoui, Elhoucein Aassif, Gérard Maze:
Modeling of the thickness of a Submerged Tube by the Artificial Neural Network. ICMCS 2016: 583-587 - 2014
- [j5]Urs Wagner, Gérard Maze:
Improvements in closest point search based on dual HKZ-bases. Theor. Comput. Sci. 520: 62-74 (2014) - [c6]Yaya Sidibé, Dimitri Lefebvre, Fabrice Druaux, Gérard Maze, Fernand Leon:
Damage detection based on wavelet transform and artificial intelligence for underwater metallic structures. ECC 2014: 2992-2997 - 2013
- [c5]Youssef Nahraoui, Elhoucein Aassif, Rachid Latif, Gérard Maze:
Modeling the Cut-off Frequency of Acoustic Signal with a Fuzzy Logic System. NETYS 2013: 268-273 - 2012
- [j4]Gérard Maze:
Analysis of a key distribution scheme in secure multicasting. J. Math. Cryptol. 6(1): 69-80 (2012) - [c4]Abdelkader Elhanaoui, Gérard Maze, Elhoucein Aassif:
Evolution study of the phase and group velocities by Choi-Williams and Born-Jordan time-frequency representations. ICMCS 2012: 146-151 - [i4]Gérard Maze:
Analysis of a Key Distribution Scheme in Secure Multicasting. CoRR abs/1201.4243 (2012) - [i3]Urs Wagner, Gérard Maze:
Improvements in closest point search based on dual HKZ-bases. CoRR abs/1201.5273 (2012)
2000 – 2009
- 2008
- [c3]Jens Zumbrägel, Gérard Maze, Joachim Rosenthal
:
Efficient recovering of operation tables of black box groups and rings. ISIT 2008: 639-643 - [i2]Jens Zumbrägel, Gérard Maze, Joachim Rosenthal:
Efficient recovering of operation tables of black box groups and rings. CoRR abs/0805.0514 (2008) - 2007
- [j3]Gérard Maze, Chris Monico, Joachim Rosenthal:
Public key cryptography based on semigroup actions. Adv. Math. Commun. 1(4): 489-507 (2007) - [j2]Gérard Maze:
Existence of a limiting distribution for the binary GCD algorithm. J. Discrete Algorithms 5(1): 176-186 (2007) - [c2]Rachid Latif, Elhoucein Aassif, Mustapha Laaboubi, Gérard Maze:
Determination of the group velocity using the time-varying autoregressive TVAR. ISSPA 2007: 1-4 - 2005
- [i1]Gérard Maze, Chris Monico, Joachim Rosenthal:
Public Key Cryptography based on Semigroup Actions. CoRR abs/cs/0501017 (2005) - 2004
- [j1]Gérard Maze:
Partitions modulo n and circulant matrices. Discret. Math. 287(1-3): 77-84 (2004) - [c1]Gérard Maze, Hugo Parlier:
Determinants of binary circulant matrices. ISIT 2004: 120
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-25 05:45 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: