Christian Mauduit

Orcid: 0000-0001-7374-6346

According to our database1, Christian Mauduit authored at least 19 papers between 1986 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
An algorithm for the word entropy.
Theor. Comput. Sci., 2018

2017
On finite pseudorandom binary lattices.
Discret. Appl. Math., 2017

The Word Entropy and How to Compute It.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2014
The cross-correlation measure for families of binary sequences.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
Family Complexity and VC-Dimension.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
On the correlation of binary sequences, II.
Discret. Math., 2012

2011
The sum-of-digits function of polynomial sequences.
J. Lond. Math. Soc., 2011

2008
Asymptotic behavior of growth functions of D0L-systems
CoRR, 2008

2006
Measures of Pseudorandomness for Finite Sequences: Minimal Values.
Comb. Probab. Comput., 2006

Large Families of Pseudorandom Sequences of <i>k</i> Symbols and Their Complexity - Part II.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Large Families of Pseudorandom Sequences of <i>k</i> Symbols and Their Complexity - Part I.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Large families of pseudorandom sequences of k symbols and their complexity, Part I.
Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part II.
Electron. Notes Discret. Math., 2005

2003
A complexity measure for families of binary sequences.
Period. Math. Hung., 2003

On the measures of pseudorandomness of binary sequences.
Discret. Math., 2003

2002
Finite and infinite pseudorandom binary words.
Theor. Comput. Sci., 2002

2000
On the Number of Prime Facttors of Integers Characterized by Digit Properties.
Period. Math. Hung., 2000

1999
On arithmetic properties of integers with missing digits II: Prime factors.
Discret. Math., 1999

1986
Morphismes Unispectraux.
Theor. Comput. Sci., 1986


  Loading...