Publications

  1. Asymptotic enumeration of compacted binary trees (with Antoine Genitrini, Manuel Kauers and Michael Wallner). Submitted. Preprint: arXiv 1703.10031.
  2. Enumerating lambda terms by weighted length of their De Bruijn representation (with Olivier Bodini and Zbigniew Gołębiewski). Discrete Applied Mathematics, to appear 2018. Preprint: arXiv 1707.02101.
  3. On the shape of random Pólya structures (with Emma Yu Jin and Michael Wallner). Discrete Mathematics, to appear 2018. Preprint: arXiv 1707.02144.
  4. On the number of unary-binary tree-like structures with restrictions on the unary height (with Olivier Bodini, Danièle Gardy and Zbigniew Gołębiewski). Annals of Combinatorics, to appear 2018. Preprint: arXiv 1510.01167.
  5. Threshold functions for small subgraphs: an analytic approach (with Gwendal Collet, Élie de Panafieu, Danièle Gardy and Vlady Ravelomanana). Electronic Notes in Discrete Mathematics 61, 271-277, 2017.
  6. A note on the scaling limits of random Pólya trees (with Emma Yu Jin and Michael Wallner). Proceedings of the 14th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 85-93, 2017.
  7. The relation between tree size complexity and probability for Boolean functions generated by uniform random trees (with Veronika Daxner, Antoine Genitrini and Cécile Mailler). Applicable Analysis and Discrete Mathematics 10(2):408-446, 2016.
  8. 2-XOR revisited: satisfiability and probabilities of functions (with Élie de Panafieu, Danièle Gardy, and Markus Kuba). Algorithmica, 76(4), 1035-1076, 2016.
  9. On the number of lambda terms with prescribed size of their De Bruijn representation (with Zbigniew Gołębiewski). STACS 2016: 40:1-40:13, 2016.
  10. Associative and commutative tree representations for Boolean functions (with Antoine Genitrini, Veronika Kraus and Cécile Mailler). Theoretical Computer Science, 570:70-101, 2015.
  11. No Shannon-effect induced by And/Or trees (with Antoine Genitrini and Cécile Mailler). DMTCS Proceedings, BA:109-120, 2014.
  12. Probabilities of 2-XOR functions (with Èlie de Panafieu, Danièle Gardy, and Markus Kuba). LATIN 14, LNCS 8392:454-465, Springer, Berlin, 2014.
  13. On the asymptotic number of ${BCK}(2)$-terms [pdf] (with Olivier Bodini). 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 25-39, 2014.
  14. Enumeration of generalized BCI lambda-terms [pdf] (with Olivier Bodini, Danièle Gardy and Alice Jacquot). Electronic Journal of Combinatorics, 20, Article P30, 23pp., 2013.
  15. Probabilities of Boolean functions given by random implicational formulas [pdf] (with Antoine Genitrini, Veronika Kraus and Cécile Mailler). Electronic Journal of Combinatorics 19, Article P37, 20+6pp., 2012. Erratum: 2014.
  16. Infinite systems of functional equations and Gaussian limiting distributions (with Michael Drmota and Johannes Morgenbesser). DMTCS Proceedings, AQ:453-478, 2012.
  17. On the number of transversals in random trees (with Veronika Kraus). DMTCS Proceedings, AQ:141-154, 2012.
  18. The degree profile of random Pólya trees (with Veronika Kraus). Journal of Combinatorial Theory, Ser. A, 119:1528-1557, 2012.
  19. The fraction of large random trees representing a given Boolean function in implicational logic (with Hervé Fournier, Danièle Gardy and Antoine Genitrini). Random Structures and Algorithms, 40(3):317-349, 2012.
  20. Lambda-terms of bounded unary height [pdf] (with Olivier Bodini and Danièle Gardy). In Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO11), pp. 23--32, 2011.
  21. The shape of unlabeled rooted random trees (with Michael Drmota). European Journal of Combinatorics, 31(8):2028-2063, 2010.
  22. No Shannon effect on probability distributions on Boolean functions induced by random expressions (with Antoine Genitrini). DMTCS Proceedings, AM:305-318, 2010.
  23. Combinatorial models for cooperation networks (with Michael Drmota and Reinhard Kutzelnigg). In Proceedings of the 20th International Workshop on Combinatorial Algorithms, LNCS 5874, 206-217, Springer 2009.
  24. On the shape of the fringe of various types of random trees (with Michael Drmota, Alois Panholzer, Helmut Prodinger, and Mark D. Ward). Mathematical Methods in the Applied Sciences 32, 1207-1245, 2009.
  25. Analytic Combinatorics on Random Graphs (with Michael Drmota). In Analysis of Complex Networks: From Biology to Linguistics, M. Dehmer and F. Emmert-Streib Eds., Wiley 2009.
  26. The degree distribution in thickened trees (with Michael Drmota and Alois Panholzer). DMTCS Proceedings AG, 5th Colloquium of Mathematics and Computer Science, Blaubeuren, pp. 153-166, 2008.
  27. Complexity and limiting ratio of Boolean functions over implication (with Hervé Fournier, Antoine Genitrini, and Danièle Gardy). Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, LNCS 5162/2008, pp. 347-362, Springer 2008.
  28. Hayman admissible functions in several variables (with Johannes Mandlburger). Electronic Journal of Combinatorics 13, Article 106, 29 pp., 2006.
  29. Analytic Combinatorics of Lattice Paths: Enumeration and Asymtpotics for the Average Area (with Cyril Banderier). In 4th Colloquium of Mathematics and Computer Science, DMTCS Proceedings, AG:345-355, 2006.
  30. Nodes of large degree in random trees and forests. Random Structures and Algorithms 28(3):374-385, 2006.
  31. Some results for monotonically labelled simply generated trees (with Alois Panholzer). In 2005 International Conference on Analysis of Algorithms, DMTCS Proceedings, AD:173-180, 2005.
  32. The profile of unlabeled trees. In 2005 International Conference on Analysis of Algorithms, DMTCS Proceedings, AD:167-172, 2005.
  33. Extended admissible functions and Gaussian limiting distributions (with Michael Drmota and Thomas Klausner). Mathematics of Computation, 74:1953-1966, 2005.
  34. And/Or trees revisited (with Brigitte Chauvin, Philippe Flajolet, and Danièle Gardy). Combinatorics, Probability, and Computing, 13(4-5):475-497, 2004.
  35. The width of Galton-Watson trees (with Michael Drmota). Discrete Mathematics and Theoretical Computer Science, 6(2):387-400, 2004.
  36. Reflected Brownian bridge local time conditioned on its local time at the origin (with Guy Louchard). Statistics and Probability Letters 68(1):51-60, 2004.
  37. General urn models with several types of balls and Gaussian limiting fields (with Michael Drmota and Danièle Gardy). Random Structures and Algorithms 24(1):75-103, 2004.
  38. A note on "State spaces of the snake and its tour - Convergence of the discrete snake" by J.-F. Marckert and A. Mokkadem. Journal of Theoretical Probability 16(4):1063-1067, 2003.
  39. On the profile of random forests. in Mathematics and Computer Science II, B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem eds., Birkhäuser, 2002, pp. 279-293.
  40. A unified presentation of some urn models (with Michael Drmota and Danièle Gardy). Algorithmica 29(1-2):120-147, 2001.
  41. Asymptotic normality of b-additive functions on polynomial sequences in the Gaussian number field (with Jörg M. Thuswaldner). Journal of Number Theory, 84:317-341, 2000.
  42. The number of descendants in simply generated random trees. In Mathematics and Computer Science, D. Gardy and A. Mokkadem (eds.), Birkhäuser, 2000, pp. 65-73.
  43. On the local time density of the reflecting Brownian bridge (with Guy Louchard). Journal of Applied Mathematics and Stochastic Analysis, 13(2):125-136, 2000.
  44. The Brownian excursion multi-dimensional local time density (with Guy Louchard). Journal of Applied Probability, 36(2):350-373, 1999.
  45. A note on a model in ruin theory using derivative securities. Grazer Mathematische Berichte, 338:1-8, 1999.
  46. On the contour of random trees [pdf]. SIAM Journal on Discrete Mathematics, 12(4):434-458, 1999.
  47. Strata of random mappings - a combinatorial approach (with Michael Drmota). Stochastic Processes and their Applications, 82:157-171, 1999.
  48. The distribution of nodes of given degree in random trees (with Michael Drmota). Journal of Graph Theory, 31:227-253, 1999.
  49. The moments of the sum-of-digits function in number fields [pdf] (with Jörg M. Thuswaldner). Canadian Mathematical Bulletin, 42:68-77, 1999.
  50. Convergence of branching processes to the local time of a Bessel process [pdf]. Random Structures and Algorithms, 13:423-438, 1998.
  51. The dying Fibonacci tree [pdf]. In Applications of Fibonacci Numbers, G. E. Bergum et al. (eds.), Volume 7, 145-152, Kluwer 1998.
  52. On the number of predecessors in constrained random mappings [pdf]. Statistics and Probability Letters, 36:29-34, 1997.
  53. On the profile of random trees [pdf] (with Michael Drmota). Random Structures and Algorithms 10:421-451, 1997.
Back to homepage