Skip to Main content Skip to Navigation


ensl-01892447v1  Conference papers
Pierre LescanneMaciej BendkowskiKatarzyna GrygielMarek Zaionc. A Natural Counting of Lambda Terms
SOFSEM 2016, Jan 2016, Harrachov, Czech Republic
ensl-01892455v1  Journal articles
Katarzyna GrygielPierre Lescanne. Counting and generating terms in the binary lambda calculus
Journal of Functional Programming, Cambridge University Press (CUP), 2015, 25, ⟨10.1017/S0956796815000271⟩
ensl-00879067v1  Journal articles
Pierre LescanneKatarzyna Grygiel. Counting and generating lambda terms
Journal of Functional Programming, Cambridge University Press (CUP), 2013, 23 (05), pp.594-628. ⟨10.1017/S0956796813000178⟩
...
tel-00905137v1  Theses
Laurent Lyaudet. Graphes et hypergraphes : complexités algorithmique et algébrique
Complexité [cs.CC]. Ecole normale supérieure de lyon - ENS LYON, 2007. Français
hal-01433822v1  Conference papers
Louis EsperetRémi de Joannis de VerclosTien-Nam LeStéphan Thomassé. Additive bases and flows in graphs
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), 2017, Vienne, Austria. pp.399-405, ⟨10.1016/j.endm.2017.06.066⟩
hal-01709239v1  Journal articles
Louis EsperetRémi de Joannis de VerclosTien-Nam LeStéphan Thomassé. Additive bases and flows in graphs
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (1), pp.534-542. ⟨10.1137/17M1113758⟩
...
hal-01561528v1  Journal articles
Maria ChudnovskyAurélie LagouttePaul SeymourSophie Spirkl. Colouring perfect graphs with bounded clique number
Journal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.757-775. ⟨10.1016/j.jctb.2016.09.006⟩
...
hal-00583742v1  Journal articles
Pierre Lescanne. Est-ce que ça s'arrête ?
Images des Mathématiques, CNRS, 2009, http://images.math.cnrs.fr/Est-ce-que-ca-s-arrete.html
...
hal-01184356v1  Conference papers
Eric Rémila. Structure of spaces of rhombus tilings in the lexicograhic case
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.145-150
ensl-01892440v1  Conference papers
Pierre LescanneDragisa Zunic. A Congruence Relation for Restructuring Classical Terms
18th Italian Conference on Theoretical Computer Science, Oct 2018, Naples, Italy. pp.186-197
hal-02275202v1  Journal articles
Louis EsperetRoss KangStéphan Thomassé. Separation Choosability and Dense Bipartite Induced Subgraphs
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2019, 28 (5), pp.720-732. ⟨10.1017/S0963548319000026⟩
ensl-01892358v1  Journal articles
Pierre Lescanne. Quantitative Aspects of Linear and Affine Closed Lambda Terms
ACM Transactions on Computational Logic, Association for Computing Machinery, 2018, 19 (2), pp.1 - 18. ⟨10.1145/3173547⟩
...
tel-02967024v1  Theses
Etienne Moutot. Around the Domino Problem - Combinatorial Structures and Algebraic Tools
Discrete Mathematics [cs.DM]. Université de Lyon; Turun yliopisto, 2020. English. ⟨NNT : 2020LYSEN027⟩
...
hal-01183311v1  Conference papers
Nazim Fatès. Experimental study of Elementary Cellular Automata dynamics using the density parameter
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.155-166
ensl-01892386v1  Journal articles
Pierre Lescanne. Dependent Types for Extensive Games
J. Formalized Reasoning, 2018
...
ensl-00578527v9  Journal articles
Pierre Lescanne. On counting untyped lambda terms
Theoretical Computer Science, Elsevier, 2013, 474, pp.80-97. ⟨10.1016/j.tcs.2012.11.019⟩
...
hal-02158330v2  Journal articles
Nicolas BousquetWilliam LochetStéphan Thomassé. A proof of the Erdős–Sands–Sauer–Woodrow conjecture
Journal of Combinatorial Theory, Series B, Elsevier, 2019, Elsevier Journal of Combinatorial Theory, Series B, 137, pp.316-319. ⟨10.1016/j.jctb.2018.11.005⟩
hal-00479037v1  Journal articles
Loic FoissyJeremie Unterberger. Ordered forests, permutations and iterated integrals
International Mathematics Research Notices, Oxford University Press (OUP), 2012
...
lirmm-01349277v1  Conference papers
Jarosław BłasiokMarcin KamińskiJean-Florent RaymondThéophile Trunck. Induced minors and well-quasi-ordering
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩