default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaximilien Gadouleau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
:
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024)- [j35]Yanni Dong, Maximilien Gadouleau, Pengfei Wan, Shenggui Zhang:
Graphs with minimum degree-entropy. Inf. Sci. 671: 120629 (2024) - [j34]Émile Naquin, Maximilien Gadouleau:
Factorisation in the semiring of finite dynamical systems. Theor. Comput. Sci. 998: 114509 (2024) - [e2]Maximilien Gadouleau, Alonso Castillo-Ramirez:
Cellular Automata and Discrete Complex Systems - 30th IFIP WG 1.5 International Workshop, AUTOMATA 2024, Durham, UK, July 22-24, 2024, Proceedings. Lecture Notes in Computer Science 14782, Springer 2024, ISBN 978-3-031-65886-0 [contents] - [i59]Maximilien Gadouleau, David C. Kutner:
Generalising the maximum independent set algorithm via Boolean networks. CoRR abs/2403.17658 (2024) - [i58]Maximilien Gadouleau, Loïc Paulevé, Sara Riva:
Bringing memory to Boolean networks: a unifying framework. CoRR abs/2404.03553 (2024) - [i57]Maximilien Gadouleau, Luca Mariot, Federico Mazzone:
On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors. CoRR abs/2405.08741 (2024) - 2023
- [j33]Maximilien Gadouleau, Luca Mariot, Stjepan Picek:
Bent functions in the partial spread class generated by linear recurring sequences. Des. Codes Cryptogr. 91(1): 63-82 (2023) - [i56]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev:
Graphs with minimum fractional domatic number. CoRR abs/2302.11668 (2023) - [i55]Maximilien Gadouleau, David C. Kutner:
Words fixing the kernel network and maximum independent sets in graphs. CoRR abs/2307.05216 (2023) - [i54]Maximilien Gadouleau:
Robert's theorem and graphs on complete lattices. CoRR abs/2309.11363 (2023) - [i53]Shenghua Li, Maximilien Gadouleau, Jiaojiao Wang, Dabin Zheng:
A New Centralized Multi-Node Repair Scheme of MSR codes with Error-Correcting Capability. CoRR abs/2309.15668 (2023) - 2022
- [i52]Émile Naquin, Maximilien Gadouleau:
Factorisation in the semiring of finite dynamical systems. CoRR abs/2210.11270 (2022) - [i51]Izzy Friedlander, Thanasis Bouganis, Maximilien Gadouleau:
The MacWilliams Identity for the Skew Rank Metric. CoRR abs/2210.16153 (2022) - 2021
- [c21]Maximilien Gadouleau:
Dynamical Properties of Disjunctive Boolean Networks (Invited Talk). AUTOMATA 2021: 1:1-1:15 - [c20]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii - [e1]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents] - [i50]Maximilien Gadouleau, Tobias Weinzierl:
The maximum discrete surface-to-volume ratio of space-filling curve partitions. CoRR abs/2106.12856 (2021) - [i49]Yanni Dong, Maximilien Gadouleau, Pengfei Wan, Shenggui Zhang:
Graphs with minimum degree-based entropy. CoRR abs/2108.13884 (2021) - [i48]Maximilien Gadouleau, Luca Mariot, Stjepan Picek:
Bent Functions in the Partial Spread Class Generated by Linear Recurring Sequences. CoRR abs/2112.08705 (2021) - 2020
- [j32]Luca Mariot, Maximilien Gadouleau, Enrico Formenti, Alberto Leporati:
Mutually orthogonal latin squares based on cellular automata. Des. Codes Cryptogr. 88(2): 391-411 (2020) - [j31]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Elementary, finite and linear vN-regular cellular automata. Inf. Comput. 274: 104533 (2020) - [j30]Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas:
Fixing monotone Boolean networks asynchronously. Inf. Comput. 274: 104540 (2020) - [j29]Florian Bridoux, Alonso Castillo-Ramirez, Maximilien Gadouleau:
Complete simulation of automata networks. J. Comput. Syst. Sci. 109: 1-21 (2020) - [j28]Maximilien Gadouleau:
On the influence of the interaction graph on a finite dynamical system. Nat. Comput. 19(1): 15-28 (2020) - [j27]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Expansive automata networks. Theor. Comput. Sci. 843: 25-44 (2020) - [c19]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative Automata Networks. Automata 2020: 43-58 - [c18]Maximilien Gadouleau, Luca Mariot:
Latin Hypercubes and Cellular Automata. Automata 2020: 139-151 - [c17]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
On Simulation in Automata Networks. CiE 2020: 277-288 - [i47]Samuel E. Hunt, Maximilien Gadouleau:
Grover's Algorithm and Many-Valued Quantum Logic. CoRR abs/2001.06316 (2020) - [i46]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Simulation of automata networks. CoRR abs/2001.09198 (2020) - [i45]Maximilien Gadouleau, Luca Mariot:
Latin Hypercubes and Cellular Automata. CoRR abs/2004.07131 (2020) - [i44]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative automata networks. CoRR abs/2004.09806 (2020) - [i43]Maximilien Gadouleau, Luca Mariot, Stjepan Picek:
Bent Functions from Cellular Automata. IACR Cryptol. ePrint Arch. 2020: 1272 (2020)
2010 – 2019
- 2019
- [j26]Maximilien Gadouleau:
On the Stability and Instability of Finite Dynamical Systems with Prescribed Interaction Graphs. Electron. J. Comb. 26(3): 3 (2019) - [j25]Søren Riis, Maximilien Gadouleau:
Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Inf. Comput. 267: 49-73 (2019) - [j24]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Cellular automata and finite groups. Nat. Comput. 18(3): 445-458 (2019) - [i42]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Expansive Automata Networks. CoRR abs/1902.08007 (2019) - [i41]Luca Mariot, Maximilien Gadouleau, Enrico Formenti, Alberto Leporati:
Mutually Orthogonal Latin Squares based on Cellular Automata. CoRR abs/1906.08249 (2019) - [i40]Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev:
Linear Programming complementation and its application to fractional graph theory. CoRR abs/1907.12775 (2019) - 2018
- [j23]Maximilien Gadouleau:
On the Rank and Periodic Rank of Finite Dynamical Systems. Electron. J. Comb. 25(3): 3 (2018) - [j22]Maximilien Gadouleau:
On the possible values of the entropy of undirected graphs. J. Graph Theory 88(2): 302-311 (2018) - [j21]Maximilien Gadouleau:
Finite Dynamical Systems, Hat Games, and Coding Theory. SIAM J. Discret. Math. 32(3): 1922-1945 (2018) - [c16]Maximilien Gadouleau, Adrien Richard:
On Fixable Families of Boolean Networks. ACRI 2018: 396-405 - [i39]Julio Aracena, Maximilien Gadouleau, Adrien Richard, Lilian Salinas:
Fixing monotone Boolean networks asynchronously. CoRR abs/1802.02068 (2018) - [i38]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Elementary, Finite and Linear vN-Regular Cellular Automata. CoRR abs/1804.00511 (2018) - [i37]Maximilien Gadouleau, Adrien Richard:
On fixable families of Boolean networks. CoRR abs/1804.01931 (2018) - [i36]Maximilien Gadouleau:
On the influence of the interaction graph on a finite dynamical system. CoRR abs/1805.12247 (2018) - 2017
- [c15]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Von Neumann Regular Cellular Automata. AUTOMATA 2017: 44-55 - [i35]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Von Neumann Regular Cellular Automata. CoRR abs/1701.02692 (2017) - [i34]Maximilien Gadouleau:
Constant-Weight Array Codes. CoRR abs/1709.03424 (2017) - 2016
- [j20]Maximilien Gadouleau, Adrien Richard:
Simple dynamics on graphs. Theor. Comput. Sci. 628: 62-77 (2016) - [j19]Maximilien Gadouleau, Adrien Richard, Eric Fanchon:
Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. IEEE Trans. Inf. Theory 62(5): 2504-2519 (2016) - [c14]Alonso Castillo-Ramirez, Maximilien Gadouleau:
On Finite Monoids of Cellular Automata. Automata 2016: 90-104 - [i33]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Cellular Automata and Finite Groups. CoRR abs/1610.00532 (2016) - 2015
- [j18]Maximilien Gadouleau, Nicholas Georgiou:
New Constructions and Bounds for Winkler's Hat Game. SIAM J. Discret. Math. 29(2): 823-834 (2015) - [j17]Maximilien Gadouleau, Adrien Richard, Søren Riis:
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. SIAM J. Discret. Math. 29(4): 2312-2335 (2015) - [j16]Maximilien Gadouleau, Søren Riis:
Memoryless computation: New results, constructions, and extensions. Theor. Comput. Sci. 562: 129-145 (2015) - [i32]Maximilien Gadouleau, Adrien Richard:
Simple dynamics on graphs. CoRR abs/1503.04688 (2015) - [i31]Alonso Castillo-Ramirez, Maximilien Gadouleau:
Universal Simulation of Automata Networks. CoRR abs/1504.00169 (2015) - [i30]Maximilien Gadouleau:
Finite dynamical systems, hat games, and coding theory. CoRR abs/1510.05824 (2015) - [i29]Maximilien Gadouleau:
On the possible values of the entropy of undirected graphs. CoRR abs/1512.01348 (2015) - [i28]Maximilien Gadouleau:
Maximum Rank and Asymptotic Rank of Finite Dynamical Systems. CoRR abs/1512.01448 (2015) - 2014
- [j15]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in Permutation Groups Without Memory. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j14]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in Matrix Groups Without Memory. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j13]Maximilien Gadouleau:
Entropy of Closure Operators and Network Coding Solvability. Entropy 16(9): 5122-5143 (2014) - [i27]Maximilien Gadouleau, Adrien Richard, Søren Riis:
Fixed points of Boolean networks, guessing graphs, and coding theory. CoRR abs/1409.6144 (2014) - [i26]Maximilien Gadouleau, Adrien Richard, Eric Fanchon:
Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. CoRR abs/1412.5310 (2014) - 2013
- [j12]Peter J. Cameron, Maximilien Gadouleau, Søren Riis:
Combinatorial representations. J. Comb. Theory A 120(3): 671-682 (2013) - [j11]Maximilien Gadouleau:
Closure Solvability for Network Coding and Secret Sharing. IEEE Trans. Inf. Theory 59(12): 7858-7869 (2013) - [c13]Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev:
Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes. ISIT 2013: 126-130 - [i25]Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev:
Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. CoRR abs/1301.6231 (2013) - [i24]Maximilien Gadouleau:
Lexicographic identifying codes. CoRR abs/1304.2618 (2013) - [i23]Maximilien Gadouleau:
Entropy of Closure Operators. CoRR abs/1307.6059 (2013) - [i22]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in permutation groups without memory. CoRR abs/1310.6008 (2013) - [i21]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in matrix groups without memory. CoRR abs/1310.6009 (2013) - [i20]Maximilien Gadouleau, Nicholas Georgiou:
New constructions and bounds for Winkler's hat game. CoRR abs/1311.2022 (2013) - 2012
- [j10]Peter J. Cameron, Maximilien Gadouleau:
Remoteness of permutation codes. Eur. J. Comb. 33(6): 1273-1285 (2012) - [j9]Ning Chen, Zhiyuan Yan, Maximilien Gadouleau, Ying Wang, Bruce W. Suter:
Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control. IEEE Trans. Very Large Scale Integr. Syst. 20(2): 296-309 (2012) - [i19]Maximilien Gadouleau:
Closure solvability for network coding. CoRR abs/1209.6558 (2012) - 2011
- [j8]Maximilien Gadouleau, Alban Goupil:
A Matroid Framework for Noncoherent Random Network Communications. IEEE Trans. Inf. Theory 57(2): 1031-1045 (2011) - [j7]Maximilien Gadouleau, Søren Riis:
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Trans. Inf. Theory 57(10): 6703-6717 (2011) - [c12]Søren Riis, Maximilien Gadouleau:
A dispersion theorem for communication networks based on term sets. ISIT 2011: 593-597 - [c11]Maximilien Gadouleau, Søren Riis:
Max-flow min-cut theorem for Rényi entropy in communication networks. ISIT 2011: 603-607 - [i18]Maximilien Gadouleau, Søren Riis:
Computing without memory. CoRR abs/1111.6026 (2011) - 2010
- [j6]Maximilien Gadouleau, Zhiyuan Yan:
Packing and covering properties of subspace codes for error control in random linear network coding. IEEE Trans. Inf. Theory 56(5): 2097-2108 (2010) - [j5]Maximilien Gadouleau, Zhiyuan Yan:
Constant-rank codes and their connection to constant-dimension codes. IEEE Trans. Inf. Theory 56(7): 3207-3216 (2010) - [i17]Maximilien Gadouleau, Alban Goupil:
A Matroid Framework for Noncoherent Random Network Communications. CoRR abs/1001.5178 (2010) - [i16]Maximilien Gadouleau, Søren Riis:
Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications. CoRR abs/1010.2619 (2010) - [i15]Maximilien Gadouleau, Søren Riis:
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic. CoRR abs/1012.5224 (2010)
2000 – 2009
- 2009
- [j4]Maximilien Gadouleau, Zhiyuan Yan:
Bounds on covering codes with the rank metric. IEEE Commun. Lett. 13(9): 691-693 (2009) - [c10]Maximilien Gadouleau, Zhiyuan Yan:
Construction and covering properties of constant-dimension codes. ISIT 2009: 2221-2225 - [c9]Maximilien Gadouleau, Zhiyuan Yan:
Decoder error probability of bounded distance decoders for constant-dimension codes. ISIT 2009: 2226-2230 - [c8]Maximilien Gadouleau, Zhiyuan Yan:
Packing and covering properties of subspace codes. ISIT 2009: 2867-2871 - [c7]Ning Chen, Maximilien Gadouleau, Zhiyuan Yan:
Rank metric decoder architectures for noncoherent error control in random network coding. SiPS 2009: 127-132 - [i14]Maximilien Gadouleau, Zhiyuan Yan:
Construction and Covering Properties of Constant-Dimension Codes. CoRR abs/0903.2675 (2009) - [i13]Ning Chen, Maximilien Gadouleau, Zhiyuan Yan:
Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding. CoRR abs/0909.4601 (2009) - 2008
- [j3]Maximilien Gadouleau, Zhiyuan Yan:
MacWilliams Identity for Codes with the Rank Metric. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [j2]Maximilien Gadouleau, Zhiyuan Yan:
On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes. IEEE Trans. Inf. Theory 54(7): 3202-3206 (2008) - [j1]Maximilien Gadouleau, Zhiyuan Yan:
Packing and Covering Properties of Rank Metric Codes. IEEE Trans. Inf. Theory 54(9): 3873-3883 (2008) - [c6]Maximilien Gadouleau, Zhiyuan Yan:
Complexity of decoding Gabidulin codes. CISS 2008: 1081-1085 - [c5]Maximilien Gadouleau, Zhiyuan Yan:
Constant-rank codes. ISIT 2008: 876-880 - [i12]Maximilien Gadouleau, Zhiyuan Yan:
Constant-Rank Codes. CoRR abs/0803.0778 (2008) - [i11]Maximilien Gadouleau, Zhiyuan Yan:
On the Connection between Optimal Constant-Rank Codes and Optimal Constant-Dimension Codes. CoRR abs/0803.2262 (2008) - [i10]Maximilien Gadouleau, Zhiyuan Yan:
Bounds on Covering Codes with the Rank Metric. CoRR abs/0809.2968 (2008) - [i9]Maximilien Gadouleau, Zhiyuan Yan:
Packing and Covering Properties of CDCs and Subspace Codes. CoRR abs/0811.4163 (2008) - [i8]Maximilien Gadouleau, Zhiyuan Yan:
On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes. CoRR abs/0812.2379 (2008) - 2007
- [c4]Maximilien Gadouleau, Zhiyuan Yan:
Covering Properties of Rank Metric Codes. GLOBECOM 2007: 1446-1450 - [c3]Maximilien Gadouleau, Zhiyuan Yan:
MacWilliams Identity for the Rank Metric. ISIT 2007: 36-40 - [i7]Maximilien Gadouleau, Zhiyuan Yan:
MacWilliams Identity for Codes with the Hamming and Rank Metrics. CoRR abs/0706.1751 (2007) - [i6]Maximilien Gadouleau, Zhiyuan Yan:
MacWilliams Identity for the Rank Metric. CoRR abs/cs/0701097 (2007) - [i5]Maximilien Gadouleau, Zhiyuan Yan:
Packing and Covering Properties of Rank Metric Codes. CoRR abs/cs/0701098 (2007) - [i4]Maximilien Gadouleau, Zhiyuan Yan:
Properties of Rank Metric Codes. CoRR abs/cs/0702077 (2007) - 2006
- [c2]Maximilien Gadouleau, Zhiyuan Yan:
Properties of Codes with the Rank Metric. GLOBECOM 2006 - [c1]Maximilien Gadouleau, Zhiyuan Yan:
Security of the GPT-Type Cryptosystems. ISIT 2006: 724-728 - [i3]Maximilien Gadouleau, Zhiyuan Yan:
Properties of Codes with the Rank Metric. CoRR abs/cs/0610099 (2006) - [i2]Maximilien Gadouleau, Zhiyuan Yan:
Decoder Error Probability of MRD Codes. CoRR abs/cs/0610148 (2006) - [i1]Maximilien Gadouleau, Zhiyuan Yan:
Error Performance Analysis of Maximum Rank Distance Codes. CoRR abs/cs/0612051 (2006)
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-10-07 22:06 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:
