Skip to main content

Research Repository

Advanced Search

Dr Maximilien Gadouleau's Outputs (4)

Computing in Matrix Groups Without Memory (2014)
Journal Article
Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Matrix Groups Without Memory. Chicago journal of theoretical computer science, 2014(8), 1-16. https://doi.org/10.4086/cjtcs.2014.008

Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates o... Read More about Computing in Matrix Groups Without Memory.

Computing in Permutation Groups Without Memory (2014)
Journal Article
Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Permutation Groups Without Memory. Chicago journal of theoretical computer science, 2014(7), 1-20. https://doi.org/10.4086/cjtcs.2014.007

Memoryless computation is a modern technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve up... Read More about Computing in Permutation Groups Without Memory.

Memoryless computation: New results, constructions, and extensions (2014)
Journal Article
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

In this paper, we are interested in memoryless computation, a modern paradigm to compute functions which generalises the famous XOR swap algorithm to exchange the contents of two variables without using a buffer. In memoryless computation, programs a... Read More about Memoryless computation: New results, constructions, and extensions.

Entropy of Closure Operators and Network Coding Solvability (2014)
Journal Article
Gadouleau, M. (2014). Entropy of Closure Operators and Network Coding Solvability. Entropy, 16(9), 5122-5143. https://doi.org/10.3390/e16095122

The entropy of a closure operator has been recently proposed for the study ofnetwork coding and secret sharing. In this paper, we study closure operators in relation to their entropy. We first introduce four different kinds of rank functions for a gi... Read More about Entropy of Closure Operators and Network Coding Solvability.