A new family of hyper-bent Boolean functions in polynomial form. 2 S. Mesnager. Proceedings of Twelfth International Conference on Cryptography and Coding. Cirencester, United Kingdom. M. G. Parker (Ed.): IMACC 2009, LNCS 5921, pp. 402--417. Springer, Heidelberg (2009).

Hyper-bent Boolean Functions with Multiple Trace Terms. 6 S. Mesnager. Proceedings of International Workshop on the Arithmetic of Finite Fields. M.A. Hasan and T.Helleseth (Eds.): WAIFI 2010, LNCS 6087, pp. 97-113. Springer, Heidelberg (2010).

CCZ-equivalence of single and multi output Boolean functions. 14 L. Budaghyan and C. Carlet. AMS Contemporary Math. 518, Post-proceedings of the conference Fq9, pp. 43-54, 2010.

On the algebraic immunities and higher order nonlinearitie of vectorial Boolean functions. 15 C. Carlet. NATO Science for Peace and Security Series, D: Information and Communication Security - Vol 23; Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes}, pp. 104-116, 2009. Invited paper.

On a construction of quadratic APN functions. 16 L. Budaghyan, C. Carlet and G. Leander. Proceedings of ITW 2009.

A new class of Bent Boolean functions in polynomial forms. 17 S. Mesnager. Proceedings of international Workshop on Coding and Cryptography, WCC 2009, pp. 5-18, Ullensvang, Norway.

The distribution of height and diameter in random non-plane binary trees. 22 [Version pdf] Nicolas Broutin and Philippe Flajolet, [arXiv:1009.1515] Submitted.

No Shannon effect on probability distribution on Boolean functions induced by random expressions. 21 [Version pdf] A. Genitrini and B. Gittenberger. In proc. 21st International Meeting of Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'10), Vienna, 2010.

Recent Results on Bent and Hyper-bent Functions and Their Link With Some Exponential Sums. 23 S. Mesnager. IEEE Information Theory Workshop, ITW 2010 Dublin.

On a conjecture about binary strings distribution. 24 J-P. Flori, H. Randriambololona et G. Cohen et S. Mesnager. Proceedings of 6 th International conference Sequences and Their Applications, Paris, France. C. Carlet and A. Pott (Eds.): SETA 2010, LNCS 6338, pp. 346-358. Springer, Heidelberg (2010).

The growing trees distribution on Boolean functions. 25 [Version pdf] Brigitte Chauvin, Danièle Gardy and Cécile Mailler. In proc. 8th SIAM Workshop on Analytic and Combinatorics (ANALCO), pp 45-56, 2011.

Limit Theorems for Random MAX-2-XORSAT. 27 V. Rasendrahasina and V. Ravelomanana. LATIN Int. Conf., 2010, pages 320-331.

On the link of some semi-bent functions with Kloosterman sums. 28 S. Mesnager, G. Cohen. Proceedings of International Workshop on Coding and Cryptology (IWCC 2011), pages 263-272, LNCS 6639, Springer, 2011.

On a conjecture about binary strings distribution. 29 G. Cohen, J.P. Flori, H. Randriambololona, S. Mesnager. Proceedings of 6-th International Conference SEquences and Their Applications, SETA 2010, LNCS 6338, pp. 346-358. Springer, Heidelberg (2010).

Lambda-terms of Bounded Unary Height. 30 O. Bodini, D. Gardy, B. Gittenberger. International Workshop ANALCO, San Francisco (USA), Janvier 2011.

On known and new differentially uniform functions. 43 C. Carlet. Proceedings of the 16th Australasian Conference on Information Security and Privacy ACISP 2011, Lecture Notes in Computer Science 6812, pages 1-15, 2011 (conference invitee).

On the Dual of Bent Functions with $2^r$ Niho Exponents. 44 C. Carlet, T. Helleseth, S. Kholosha and S. Mesnager. Proceedings of ISIT 2011, Saint Petersburg, 2011.

On Bent Functions Associated to AB Functions. 45 L. Budaghyan, C. Carlet and T. Helleseth. Proceedings of IEEE Information Theory Workshop 2011.

Binary Kloosterman sums with value 4. 54 J.P Flori S. Mesnager et G.Cohen. Proceedings of Thirteenth International Conference on Cryptography and Coding, Oxford, Angleterre.L. Chen ( Ed), IMACC 2011, LNCS 7089 pages 61-78, Springer.

Fully Analyzing an Algebraic Pólya Urn Model. 55 [Version pdf] B. Morcrette. In proc. Latin American Symposium on Theoretical Informatics (LATIN 2012) LNCS 7256, pp. 568--581, Springer, Heidelberg (2012).

Exactly solvable balanced tenable urns with random entries via the analytic methodology. 57 [Version pdf] B.Morcrette and Hosam M.Mahmoud. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA 2012, Montreal, Canada). DMTCS Proceedings, vol. AQ, pp. 219--232 .

On hyper-bent functions via Dillon-like exponents. 60 S. Mesnager et J.P. Flori, ISIT 2012-IEEE Internaional Symposium on Information Theory, IMT, Cambridge, MA, USA, Juillet 2012.

Semi-bent functions with multiple trace terms and hyperelliptic curves. 61 S. Mesnager, Proceeding of International Conference on Cryptology and Information Security in Latin America, Latincrypt 2012, LNCS 7533, Springer, pages 18-36, 2012.

Niho Bent Functions and Subiaco Hyperovals. 62 T.Helleseth, A. Kholosha et S. Mesnager, Proceedings of the 10-th International Conference on Finite Fields and Their Applications (Fq'10), Contemporary Math., AMS, 2012. Vol 579, pages 91-101, 2012.

Dickson polynomials, hyperelliptic curves and hyper-bent functions. 63 J.P. Flori et S. Mesnager, Proceedings of 7-th International conference SEquences and Their Applications, SETA 2012, Waterloo, Canada. LNCS 7780, pages 40-52, Springer, 2012.

On Dillon’s class H of Niho bent functions and o-polynomials. 64 C. Carlet et S. Mesnager, Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Floride, USA, Janvier 2012.

Monomials in arithmetic circuits: Complete problems in the counting hierarchy. 68 Hervé Fournier, Guillaume Malod, Stefan Mengel. STACS 2012: 362-373.

On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. 69 Hervé Fournier, Sylvain Perifel, Rémi de Verclos. MFCS 2013: 433-444.

Efficient data structure and algorithms for sparse integers, sets and predicates. 78 J. Vuillemin. In 19th IEEE Symposium on Computer Arithmetic, Proceedings, pages 7–14. IEEE, 2009.

Compact normal form for regular languages as xor automata. 79 J. Vuillemin and N. Gama. In 14th International Conference, CIAA 2009, Sydney Australia, vol. 5642 of LLNCS, pages 24–33. Springer Verlag, 2009.

Defensive Leakage Camouflage. 80 E. Brier, Q. Fortier, R. Korkikian, K. W. Magld, D. Naccache, G. Ozari de Almeida, A. Pommellet, A. H. Ragab, J. Vuillemin. CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications, December 2012, pp 77-295 and pp 277-295 in Springer-Verlag Berlin, Heidelberg.

Probabilities of Boolean Functions Given by Random Implicational Formulas. 81 A. Genitrini, B. Gittenberger, V. Kraus and C. Mailler. In Electronic Journal of Combinatorics (EJC), 19, No. 2, P37 (electronic), 2012.