Staff profile

Personal webpage

I am an Associate Professor in Computer Science in the Algorithms and Complexity group.

I received my MSc and PhD in Computer Engineering from Lehigh University in December 2005 and May 2009, respectively. After graduation, I held a postdoctoral research position in Université de Reims Champagne-Ardenne, France until May 2010. I then was a postdoctoral research assistant in the Theoretical Computer Science group at Queen Mary, University of London until December 2011. I joined Durham in January 2012 as a Lecturer, and was promoted to Associate Professor in October 2016.

I am a member of the London Mathematical Society and of IFIP.

My research interests focus on two main areas: automata networks and codes and cryptography. I have been establishing novel connections with other areas of computer science and mathematics, such as graph theory (signed graphs, digraphs) algebra (semigroups, lattices), dynamical systems (cellular automata), and more.

• Boolean networks
• Automata networks
• Coding theory
• Cryptography
• Combinatorics
• Information theory
• Semigroups
• Cellular automata

• 2018: Carnegie Trust for the Universities of Scotland: Research Assessor:
• 2017: EPSRC Peer Review College member:

Chapter in book

• Random Network Coding and Matroids
  
  Gadouleau, M. (2012). Random Network Coding and Matroids. In K. Al Agha (Ed.), Network coding. (pp. 147-184). John Wiley and Sons.

Conference Paper

• Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape
  
  Austin, H., Gadouleau, M., Mertzios, G., & Trehan, A. (2025). Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. In PODC ’25: Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 541-544). ACM. https://doi.org/10.1145/3732772.3733523
• Amnesiac Flooding: Easy to Break, Hard to Escape
  
  Austin, H., Gadouleau, M., Mertzios, G. B., & Trehan, A. (2025). Amnesiac Flooding: Easy to Break, Hard to Escape. In D. R. Kowalski (Ed.), 39th International Symposium on Distributed Computing (DISC 2025). https://doi.org/10.4230/LIPIcs.DISC.2025.10
• On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
  
  Gadouleau, M., Mariot, L., & Mazzone, F. (2024). On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors. In Extended abstracts of BFA 2024 [Conference abstract] (pp. 1-5).
• Dynamical properties of disjunctive Boolean networks
  
  Gadouleau, M. (2021). Dynamical properties of disjunctive Boolean networks. In 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2021) (pp. 1:1-1:15). Dagstuhl Publishing. https://doi.org/10.4230/OASIcs.AUTOMATA.2021.1
• Commutative Automata Networks
  
  Bridoux, F., Gadouleau, M., & Theyssier, G. (2020). Commutative Automata Networks. In Cellular Automata and Discrete Complex Systems (pp. 43-58). Springer International Publishing. https://doi.org/10.1007/978-3-030-61588-8_4
• On Simulation in Automata Networks
  
  Bridoux, F., Gadouleau, M., & Theyssier, G. (2020). On Simulation in Automata Networks. In Beyond the Horizon of Computability (pp. 277-288). Springer International Publishing. https://doi.org/10.1007/978-3-030-51466-2_24
• Latin Hypercubes and Cellular Automata
  
  Gadouleau, M., & Mariot, L. (2020). Latin Hypercubes and Cellular Automata. In Cellular Automata and Discrete Complex Systems (pp. 139-151). Springer International Publishing. https://doi.org/10.1007/978-3-030-61588-8_11
• On Fixable Families of Boolean Networks
  
  Gadouleau, M., & Richard, A. (2018). On Fixable Families of Boolean Networks. In Cellular Automata (pp. 396-405). Springer International Publishing. https://doi.org/10.1007/978-3-319-99813-8_36
• Von Neumann Regular Cellular Automata
  
  Castillo-Ramirez, A., & Gadouleau, M. (2017). Von Neumann Regular Cellular Automata. In Cellular Automata and Discrete Complex Systems (pp. 44-55). Springer International Publishing. https://doi.org/10.1007/978-3-319-58631-1_4
• On Finite Monoids of Cellular Automata
  
  Castillo-Ramirez, A., & Gadouleau, M. (2016). On Finite Monoids of Cellular Automata. In M. Cook & T. Neary (Eds.), Cellular automata and discrete complex systems : 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016. Proceedings. (pp. 90-104). Springer Verlag. https://doi.org/10.1007/978-3-319-39300-1_8
• Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes
  
  Zeh, A., Wachter-Zeh, A., Gadouleau, M., & Bezzateev, S. (2013). Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. In International Symposium on Information Theory Proceedings (ISIT 2013), 7-12 July 2013, Istanbul, Turkey ; proceedings (pp. 126-130). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/isit.2013.6620201
• Network Coding Theorem for Dynamic Communication Networks
  
  Riis, S., & Gadouleau, M. (2011). Network Coding Theorem for Dynamic Communication Networks. Presented at IEEE International Symposium on Network Coding, Beijing, China.
• Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks
  
  Gadouleau, M., & Riis, S. (2011). Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks. Presented at IEEE International Symposium on Information Theory, St Petersburg, Russia.
• A Dispersion Theorem for Communication Networks Based on Term Sets
  
  Riis, S., & Gadouleau, M. (2011). A Dispersion Theorem for Communication Networks Based on Term Sets. Presented at IEEE International Symposium on Information Theory, St Petersburg, Russia.
• Binary Codes for Packet Error and Packet Loss Correction in Store and Forward
  
  Gadouleau, M., & Goupil, A. (2010). Binary Codes for Packet Error and Packet Loss Correction in Store and Forward. In Proc. International ITG Conference on Source and Channel Coding (pp. 1-6).
• Packing and Covering Properties of Subspace Codes
  
  Gadouleau, M., & Yan, Z. (2009). Packing and Covering Properties of Subspace Codes. Presented at IEEE International Symposium on Information Theory, Seoul, South Korea.
• On the Decoder Error Probability of Bounded Rank Distance Decoders for Rank Metric Codes
  
  Gadouleau, M., & Yan, Z. (2009). On the Decoder Error Probability of Bounded Rank Distance Decoders for Rank Metric Codes. Presented at IEEE Information Theory Workshop, Taormina, Italy.
• Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding
  
  Chen, N., Gadouleau, M., & Yan, Z. (2009). Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding. Presented at IEEE Workshop on Signal Processing Systems, Tampere, Finland.
• Construction and Covering Properties of Constant-Dimension Codes
  
  Gadouleau, M., & Yan, Z. (2009). Construction and Covering Properties of Constant-Dimension Codes. Presented at IEEE International Symposium on Information Theory, Seoul, South Korea.
• Decoder Error Probability of Bounded Distance Decoders for Constant-Dimension Codes
  
  Gadouleau, M., & Yan, Z. (2009). Decoder Error Probability of Bounded Distance Decoders for Constant-Dimension Codes. Presented at IEEE International Symposium on Information Theory, Seoul, South Korea.
• Constant-Rank Codes
  
  Gadouleau, M., & Yan, Z. (2008, July). Constant-Rank Codes. Presented at IEEE ISIT, Toronto, ON.
• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
  
  Gadouleau, M., & Yan, Z. (2008, June). Constant-Rank Codes and Their Connection to Constant-Dimension Codes. Presented at 2008 IEEE International Workshop on Wireless Network Coding (WiNC 2008), San Francisco, CA.
• Complexity of Decoding Gabidulin Codes
  
  Gadouleau, M., & Yan, Z. (2008). Complexity of Decoding Gabidulin Codes. In Proc. IEEE CISS (pp. 1081-1085).
• Covering Properties of Rank Metric Codes
  
  Gadouleau, M., & Yan, Z. (2007, November). Covering Properties of Rank Metric Codes. Presented at IEEE Globecom, Washington, DC.
• MacWilliams Identity for the Rank Metric
  
  Gadouleau, M., & Yan, Z. (2007, June). MacWilliams Identity for the Rank Metric. Presented at IEEE ISIT, Nice, France.
• Properties of Codes with the Rank Metric
  
  Gadouleau, M., & Yan, Z. (2006). Properties of Codes with the Rank Metric. In Proc. IEEE Globecom (pp. 1-5).
• Decoder Error Probability of MRD Codes
  
  Gadouleau, M., & Yan, Z. (2006). Decoder Error Probability of MRD Codes. In Proc. IEEE Information Theory Workshop (pp. 264-268).
• Security of the GPT-Type Cryptosystems
  
  Gadouleau, M., & Yan, Z. (2006, July). Security of the GPT-Type Cryptosystems. Presented at IEEE ISIT, Seattle, WA.
• A Private-Key Cryptosystem Based on the Rank Metric
  
  Gadouleau, M., & Yan, Z. (2005). A Private-Key Cryptosystem Based on the Rank Metric. In Proc. Algebraic Methods in Cryptography Workshop.
• Optimal Distortion Parameter for the GPT Public-Key Cryptosystem
  
  Gadouleau, M., & Yan, Z. (2005). Optimal Distortion Parameter for the GPT Public-Key Cryptosystem. In Proc. IEEE Sarnoff Symposium (pp. 130-133).

Conference Proceeding

• Cellular Automata and Discrete Complex Systems: 30th IFIP WG 1.5 International Workshop, AUTOMATA 2024, Durham, UK, July 22–24, 2024, Proceedings
  
  Gadouleau, M., & Castillo-Ramirez, A. (Eds.). (2024). Cellular Automata and Discrete Complex Systems: 30th IFIP WG 1.5 International Workshop, AUTOMATA 2024, Durham, UK, July 22–24, 2024, Proceedings. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-65887-7

Journal Article

• Trapping and commutative Boolean networks
  
  Gadouleau, M. (2026). Trapping and commutative Boolean networks. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 373-408. https://doi.org/10.61091/jcmcc131-18
• On the dynamics of bounded-degree automata networks
  
  Aracena, J., Bridoux, F., Gadouleau, M., Guillon, P., Perrot, K., Richard, A., & Theyssier, G. (2026). On the dynamics of bounded-degree automata networks. Natural Computing, 25(1), Article 6. https://doi.org/10.1007/s11047-026-10064-x
• Bringing memory to Boolean networks: a unifying framework
  
  Gadouleau, M., Paulevé, L., & Riva, S. (2026). Bringing memory to Boolean networks: a unifying framework. Journal of Computer and System Sciences, 156, Article 103729. https://doi.org/10.1016/j.jcss.2025.103729
• Linear Programming complementation
  
  Gadouleau, M., Mertzios, G., & Zamaraev, V. (2025). Linear Programming complementation. Theoretical Computer Science, 1032, Article 115087. https://doi.org/10.1016/j.tcs.2025.115087
• Generalising the maximum independent set algorithm via Boolean networks
  
  Gadouleau, M., & Kutner, D. C. (2025). Generalising the maximum independent set algorithm via Boolean networks. Information and Computation, 303, Article 105266. https://doi.org/10.1016/j.ic.2025.105266
• The MacWilliams Identity for the Skew Rank Metric
  
  Friedlander, I., Bouganis, A., & Gadouleau, M. (2025). The MacWilliams Identity for the Skew Rank Metric. Advances in Mathematics of Communications, 19(1), 140-179. https://doi.org/10.3934/amc.2023045
• Graphs with minimum degree-entropy
  
  Dong, Y., Gadouleau, M., Wan, P., & Zhang, S. (2024). Graphs with minimum degree-entropy. Information Sciences, 671, 120629. https://doi.org/10.1016/j.ins.2024.120629
• Factorisation in the semiring of finite dynamical systems
  
  Naquin, É., & Gadouleau, M. (2024). Factorisation in the semiring of finite dynamical systems. Theoretical Computer Science, 998, Article 114509. https://doi.org/10.1016/j.tcs.2024.114509
• Graphs with minimum fractional domatic number
  
  Gadouleau, M., Harms, N., Mertzios, G. B., & Zamaraev, V. (2024). Graphs with minimum fractional domatic number. Discrete Applied Mathematics, 343, 140-148. https://doi.org/10.1016/j.dam.2023.10.020
• Bent functions in the partial spread class generated by linear recurring sequences
  
  Gadouleau, M., Mariot, L., & Picek, S. (2023). Bent functions in the partial spread class generated by linear recurring sequences. Designs, Codes and Cryptography, 91(1), 63-82. https://doi.org/10.1007/s10623-022-01097-1
• Expansive automata networks
  
  Bridoux, F., Gadouleau, M., & Theyssier, G. (2020). Expansive automata networks. Theoretical Computer Science, 843, 25-44. https://doi.org/10.1016/j.tcs.2020.06.019
• Elementary, finite and linear vN-regular cellular automata
  
  Castillo-Ramirez, A., & Gadouleau, M. (2020). Elementary, finite and linear vN-regular cellular automata. Information and Computation, 274, Article 104533. https://doi.org/10.1016/j.ic.2020.104533
• Fixing monotone Boolean networks asynchronously
  
  Aracena, J., Gadouleau, M., Richard, A., & Salinas, L. (2020). Fixing monotone Boolean networks asynchronously. Information and Computation, 274, Article 104540. https://doi.org/10.1016/j.ic.2020.104540
• Complete Simulation of Automata Networks
  
  Bridoux, F., Castillo-Ramirez, A., & Gadouleau, M. (2020). Complete Simulation of Automata Networks. Journal of Computer and System Sciences, 109, 1-21. https://doi.org/10.1016/j.jcss.2019.12.001
• On the influence of the interaction graph on a finite dynamical system
  
  Gadouleau, M. (2020). On the influence of the interaction graph on a finite dynamical system. Natural Computing, 19(1), 15-28. https://doi.org/10.1007/s11047-019-09732-y
• Mutually orthogonal latin squares based on cellular automata
  
  Mariot, L., Gadouleau, M., Formenti, E., & Leporati, A. (2020). Mutually orthogonal latin squares based on cellular automata. Designs, Codes and Cryptography, 88(2), 391-411. https://doi.org/10.1007/s10623-019-00689-8
• Structural aspects of semigroups based on digraphs
  
  East, J., Gadouleau, M., & Mitchell, J. D. (2019). Structural aspects of semigroups based on digraphs. Algebraic Combinatorics, 2(5), 711-733. https://doi.org/10.5802/alco.56
• Cellular automata and finite groups
  
  Castillo-Ramirez, A., & Gadouleau, M. (2019). Cellular automata and finite groups. Natural Computing, 18(3), 445-458. https://doi.org/10.1007/s11047-017-9640-3
• Max-flow min-cut theorems on dispersion and entropy measures for communication networks
  
  Riis, S., & Gadouleau, M. (2019). Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Information and Computation, 267, 49-73. https://doi.org/10.1016/j.ic.2019.03.004
• On the stability and instability of finite dynamical systems with prescribed interaction graphs
  
  Gadouleau, M. (2019). On the stability and instability of finite dynamical systems with prescribed interaction graphs. Electronic Journal of Combinatorics, 26(3), Article P3.32.
• On the Rank and Periodic Rank of Finite Dynamical Systems
  
  Gadouleau, M. (2018). On the Rank and Periodic Rank of Finite Dynamical Systems. Electronic Journal of Combinatorics, 25(3), Article #P3.48.
• Finite Dynamical Systems, Hat Games, and Coding Theory
  
  Gadouleau, M. (2018). Finite Dynamical Systems, Hat Games, and Coding Theory. SIAM Journal on Discrete Mathematics, 32(3), 1922-1945. https://doi.org/10.1137/15m1044758
• On the possible values of the entropy of undirected graphs
  
  Gadouleau, M. (2018). On the possible values of the entropy of undirected graphs. Journal of Graph Theory, 88(2), 302-311. https://doi.org/10.1002/jgt.22213
• Chains of subsemigroups
  
  Cameron, P. J., Gadouleau, M., Mitchell, J. D., & Peresse, Y. (2017). Chains of subsemigroups. Israel Journal of Mathematics, 220(1), 479-508. https://doi.org/10.1007/s11856-017-1523-x
• Lengths of words in transformation semigroups generated by digraphs
  
  Cameron, P. J., Castillo-Ramirez, A., Gadouleau, M., & Mitchell, J. D. (2017). Lengths of words in transformation semigroups generated by digraphs. Journal of Algebraic Combinatorics, 45(1), 149-170. https://doi.org/10.1007/s10801-016-0703-9
• Ranks of finite semigroups of one-dimensional cellular automata
  
  Castillo-Ramirez, A., & Gadouleau, M. (2016). Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum, 93(2), 347-362. https://doi.org/10.1007/s00233-016-9783-z
• Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
  
  Gadouleau, M., Richard, A., & Fanchon, E. (2016). Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. IEEE Transactions on Information Theory, 62(5), 2504-2519. https://doi.org/10.1109/tit.2016.2544344
• Simple dynamics on graphs
  
  Gadouleau, M., & Richard, A. (2016). Simple dynamics on graphs. Theoretical Computer Science, 628, 62-77. https://doi.org/10.1016/j.tcs.2016.03.013
• Fixed points of Boolean networks, guessing graphs, and coding theory
  
  Gadouleau, M., Richard, A., & Riis, S. (2015). Fixed points of Boolean networks, guessing graphs, and coding theory. SIAM Journal on Discrete Mathematics, 29(4), 2312-2335. https://doi.org/10.1137/140988358
• New Constructions and Bounds for Winkler's Hat Game
  
  Gadouleau, M., & Georgiou, N. (2015). New Constructions and Bounds for Winkler’s Hat Game. SIAM Journal on Discrete Mathematics, 29(2), 823-834. https://doi.org/10.1137/130944680
• Memoryless computation: New results, constructions, and extensions
  
  Gadouleau, M., & Riis, S. (2015). Memoryless computation: New results, constructions, and extensions. Theoretical Computer Science, 562, 129-145. https://doi.org/10.1016/j.tcs.2014.09.040
• Computing in Permutation Groups Without Memory
  
  Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Permutation Groups Without Memory. Chicago Journal of Theoretical Computer Science, 2014(7), Article 7. https://doi.org/10.4086/cjtcs.2014.007
• Computing in Matrix Groups Without Memory
  
  Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Matrix Groups Without Memory. Chicago Journal of Theoretical Computer Science, 2014(8), Article 8. https://doi.org/10.4086/cjtcs.2014.008
• Entropy of Closure Operators and Network Coding Solvability
  
  Gadouleau, M. (2014). Entropy of Closure Operators and Network Coding Solvability. Entropy, 16(9), 5122-5143. https://doi.org/10.3390/e16095122
• Closure Solvability for Network Coding and Secret Sharing
  
  Gadouleau, M. (2013). Closure Solvability for Network Coding and Secret Sharing. IEEE Transactions on Information Theory, 59(12), 7858-7869. https://doi.org/10.1109/tit.2013.2282293
• Combinatorial Representations
  
  Cameron, P. J., Gadouleau, M., & Riis, S. (2013). Combinatorial Representations. Journal of Combinatorial Theory, Series A, 120(3), 671-682. https://doi.org/10.1016/j.jcta.2012.12.002
• Remoteness of permutation codes
  
  Cameron, P. J., & Gadouleau, M. (2012). Remoteness of permutation codes. European Journal of Combinatorics, 33(6), 1273-1285. https://doi.org/10.1016/j.ejc.2012.03.027
• Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control
  
  Chen, N., Yan, Z., Gadouleau, M., Wang, Y., & Suter, B. W. (2012). Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control. IEEE Transactions on Very Large Scale Integration (VLSI) Systems., 20(2), 296-309. https://doi.org/10.1109/tvlsi.2010.2096239
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
  
  Gadouleau, M., & Riis, S. (2011). Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Transactions on Information Theory, 57(10), 6703-6717. https://doi.org/10.1109/tit.2011.2155618
• A Matroid Framework for Noncoherent Random Network Communications
  
  Gadouleau, M., & Goupil, A. (2011). A Matroid Framework for Noncoherent Random Network Communications. IEEE Transactions on Information Theory, 57(2), 1031-1045. https://doi.org/10.1109/tit.2010.2094818
• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
  
  Gadouleau, M., & Yan, Z. (2010). Constant-Rank Codes and Their Connection to Constant-Dimension Codes. IEEE Transactions on Information Theory, 56(7), 3207-3216. https://doi.org/10.1109/tit.2010.2048447
• Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
  
  Gadouleau, M., & Yan, Z. (2010). Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding. IEEE Transactions on Information Theory, 56(5), 2097-2108.
• Bounds on Covering Codes with the Rank Metric
  
  Gadouleau, M., & Yan, Z. (2009). Bounds on Covering Codes with the Rank Metric. IEEE Communications Letters, 13(9), 691-693.
• Packing and Covering Properties of Rank Metric Codes
  
  Gadouleau, M., & Yan, Z. (2008). Packing and Covering Properties of Rank Metric Codes. IEEE Transactions on Information Theory, 54(9), 3873-3883. https://doi.org/10.1109/tit.2008.928284
• On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum Rank Distance Codes
  
  Gadouleau, M., & Yan, Z. (2008). On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum Rank Distance Codes. IEEE Transactions on Information Theory, 54(7), 3202-3206.
• MacWilliams Identity for Codes with the Rank Metric
  
  Gadouleau, M., & Yan, Z. (2008). MacWilliams Identity for Codes with the Rank Metric. EURASIP Journal on Wireless Communications and Networking., 2008, Article 754021. https://doi.org/10.1155/2008/754021

Presentation

• Words fixing the kernel network and maximum independent sets in graphs
  
  Gadouleau, M. (2023, August 30 – 2023, September 1). Words fixing the kernel network and maximum independent sets in graphs. Presented at AUTOMATA 2023, Trieste, Italy.