% csauthors.net - beta - BibTeX bibliography of Christian Mauduit
@article{journals/tcs/Mauduit86,
title = {Morphismes Unispectraux.},
year = {1986},
journal = {Theor. Comput. Sci.},
author = {{Christian Mauduit}}
}
@article{journals/dm/ErdosMS99,
title = {On arithmetic properties of integers with missing digits II: Prime factors.},
year = {1999},
journal = {Discret. Math.},
author = {{Paul Erdös} and {Christian Mauduit} and {András Sárközy}}
}
@article{journals/pmh/KonyaginMS00,
title = {On the Number of Prime Facttors of Integers Characterized by Digit Properties.},
year = {2000},
journal = {Period. Math. Hung.},
author = {{Sergei Konyagin} and {Christian Mauduit} and {András Sárközy}}
}
@article{journals/tcs/Mauduit02,
title = {Finite and infinite pseudorandom binary words.},
year = {2002},
journal = {Theor. Comput. Sci.},
author = {{Christian Mauduit}}
}
@article{journals/dm/MauduitS03,
title = {On the measures of pseudorandomness of binary sequences.},
year = {2003},
journal = {Discret. Math.},
author = {{Christian Mauduit} and {András Sárközy}}
}
@article{journals/pmh/AhlswedeKMS03,
title = {A complexity measure for families of binary sequences.},
year = {2003},
journal = {Period. Math. Hung.},
author = {{Rudolf Ahlswede} and {Levon H. Khachatrian} and {Christian Mauduit} and {András Sárközy}}
}
@article{journals/endm/AhlswedeMS05,
title = {Large families of pseudorandom sequences of k symbols and their complexity, Part II.},
year = {2005},
journal = {Electron. Notes Discret. Math.},
author = {{Rudolf Ahlswede} and {Christian Mauduit} and {András Sárközy}}
}
@article{journals/endm/AhlswedeMS05a,
title = {Large families of pseudorandom sequences of k symbols and their complexity, Part I.},
year = {2005},
journal = {Electron. Notes Discret. Math.},
author = {{Rudolf Ahlswede} and {Christian Mauduit} and {András Sárközy}}
}
@inproceedings{conf/gtitc/AhlswedeMS06,
title = {Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I.},
year = {2006},
booktitle = {GTIT-C},
author = {{Rudolf Ahlswede} and {Christian Mauduit} and {András Sárközy}},
publisher = {Springer},
booktitle = {General Theory of Information Transfer and Combinatorics}
}
@inproceedings{conf/gtitc/AhlswedeMS06a,
title = {Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II.},
year = {2006},
booktitle = {GTIT-C},
author = {{Rudolf Ahlswede} and {Christian Mauduit} and {András Sárközy}},
publisher = {Springer},
booktitle = {General Theory of Information Transfer and Combinatorics}
}
@article{journals/cpc/AlonKMMR06,
title = {Measures of Pseudorandomness for Finite Sequences: Minimal Values.},
year = {2006},
journal = {Comb. Probab. Comput.},
author = {{Noga Alon} and {Yoshiharu Kohayakawa} and {Christian Mauduit} and {Carlos Gustavo T. de A. Moreira} and {Vojtech Rödl}}
}
@article{journals/corr/abs-0804-1327,
title = {Asymptotic behavior of growth functions of D0L-systems},
year = {2008},
journal = {CoRR},
author = {{Julien Cassaigne} and {Christian Mauduit} and {François Nicolas}}
}
@article{journals/jlms/DrmotaMR11,
title = {The sum-of-digits function of polynomial sequences.},
year = {2011},
journal = {J. Lond. Math. Soc.},
author = {{Michael Drmota} and {Christian Mauduit} and {Joël Rivat}}
}
@article{journals/dm/GyarmatiM12,
title = {On the correlation of binary sequences, II.},
year = {2012},
journal = {Discret. Math.},
author = {{Katalin Gyarmati} and {Christian Mauduit}}
}
@inproceedings{conf/birthday/MauduitS13,
title = {Family Complexity and VC-Dimension.},
year = {2013},
booktitle = {Information Theory, Combinatorics, and Search Theory},
author = {{Christian Mauduit} and {András Sárközy}},
publisher = {Springer},
booktitle = {Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede}
}
@incollection{books/cu/p/GyarmatiMS14,
title = {The cross-correlation measure for families of binary sequences.},
year = {2014},
booktitle = {Applied Algebra and Number Theory},
author = {{Katalin Gyarmati} and {Christian Mauduit} and {András Sárközy}},
publisher = {Cambridge University Press},
booktitle = {Applied Algebra and Number Theory}
}
@inproceedings{conf/cwords/FerencziMM17,
title = {The Word Entropy and How to Compute It.},
year = {2017},
booktitle = {WORDS},
author = {{Sébastien Ferenczi} and {Christian Mauduit} and {Carlos Gustavo Moreira 001}},
publisher = {Springer},
booktitle = {Combinatorics on Words - 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings}
}
@article{journals/dam/GyarmatiMS17,
title = {On finite pseudorandom binary lattices.},
year = {2017},
journal = {Discret. Appl. Math.},
author = {{Katalin Gyarmati} and {Christian Mauduit} and {András Sárközy}}
}
@article{journals/tcs/FerencziMM18,
title = {An algorithm for the word entropy.},
year = {2018},
journal = {Theor. Comput. Sci.},
author = {{Sébastien Ferenczi} and {Christian Mauduit} and {Carlos Gustavo Moreira 001}}
}