Filtrer vos résultats
- 46
- 27
- 32
- 25
- 12
- 2
- 1
- 1
- 4
- 53
- 32
- 2
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 3
- 9
- 6
- 7
- 4
- 12
- 7
- 6
- 2
- 71
- 2
- 47
- 26
- 25
- 16
- 14
- 7
- 5
- 5
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 73
- 9
- 8
- 7
- 7
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
73 résultats
|
|
Description trees and Tutte FormulasTheoretical Computer Science, 2003, 292 (1), pp.165-183. ⟨10.1016/S0304-3975(01)00221-3⟩
Article dans une revue
inria-00099504v1
|
||
|
|
Enumeration of planar constellationsAdvances in Applied Mathematics, 2000, 24 (4), pp.337-368. ⟨10.1006/aama.1999.0673⟩
Article dans une revue
inria-00099358v1
|
||
Random Triangulations and Planar MapsSéminaire du groupe Theory de Microsoft Research, 2001, Seattle, USA
Communication dans un congrès
inria-00100681v1
|
|||
Central Characters and Conjugacy Classes in the Symmetric Group12th International Conference on Formal Power Series and Algebraic Combinatorics - FPSAC'00, 2000, Moscou/Russia, pp.238-249
Communication dans un congrès
inria-00099194v1
|
|||
Counting, coding and sampling with wordsJean Berstel, Dominique Perrin. Applied combinatorics on words, Cambridge University Press, pp.478-519, 2005, M. Lothaire, volume 3. Encyclopedia of Mathematics and its Applications, volume 105
Chapitre d'ouvrage
hal-00159488v1
|
|||
|
|
A combinatorial approach to jumping particles: the parallel TASEP2007
Pré-publication, Document de travail
hal-00159647v1
|
||
Planar Graphs, via Well-Orderly Maps and Trees$30^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2004, Germany. pp.270-284
Communication dans un congrès
hal-00307603v1
|
|||
Airy Phenomena and Analytic Combinatorics of Connected Graphs[Intern report] A02-R-216 || flajolet02a, 2002, 25 p
Rapport
inria-00101063v1
|
|||
|
|
A bijection for triangulations of a polygon with interior points and multiple edgesTheoretical Computer Science, 2003, 307 (2), pp.385-401. ⟨10.1016/S0304-3975(03)00226-3⟩
Article dans une revue
hal-00159307v1
|
||
|
|
A combinatorial approach to jumping particles I: maximal flow regime2004, pp.12
Communication dans un congrès
hal-00159614v1
|
||
|
|
A combinatorial approach to jumping particles: the parallel TASEP2005, pp.12
Communication dans un congrès
hal-00159636v1
|
||
A bijection for triangulations of a polygon with interior points and multiple edges[Intern report] A02-R-362 || poulalhon02c, 2002, 21 p
Rapport
inria-00101067v1
|
|||
|
|
Partitioned Cacti: a Bijective Approach to the Cycle Factorization Problem20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.641-652, ⟨10.46298/dmtcs.3614⟩
Communication dans un congrès
hal-01185148v1
|
||
|
|
Optimal succinct representation of planar maps[Research Report] RR-5803, INRIA. 2006, pp.26
Rapport
inria-00070221v1
|
||
|
|
Dynamic updates of succinct triangulations[Research Report] RR-5709, INRIA. 2006, pp.23
Rapport
inria-00070308v1
|
||
Une bijection simple pour les cartes orientables[Interne] A01-R-366 || marcus_01a, 2001, 10 p
Rapport
inria-00100704v1
|
|||
|
|
The distribution of the number of small cuts in a random planar triangulation21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.277-288, ⟨10.46298/dmtcs.2797⟩
Communication dans un congrès
hal-01185596v1
|
||
The asymptotic number of prime alternating links[Intern report] A00-R-424 || kunz-jacques00a, 2000, 12 p
Rapport
inria-00099311v1
|
|||
|
|
A bijection for rooted maps on orientable surfacesSIAM Journal on Discrete Mathematics, 2009, 33 (3), pp.1587--1611. ⟨10.1137/080720097⟩
Article dans une revue
hal-00713482v1
|
||
|
|
Dissections, orientations, and trees, with applications to optimal mesh encoding and to random samplingACM Transactions on Algorithms, 2008, 4 (2), pp.Art.19
Article dans une revue
hal-00330580v2
|
||
|
|
A Bijection for Unicellular Partitioned Bicolored MapsFPSAC'06, Jun 2006, San Diego, USA
Communication dans un congrès
inria-00129357v1
|
||
Dissections and trees, with applications to optimal mesh encoding and to random samplingACM Transactions on Algorithms, 2007, à paraître
Article dans une revue
hal-00159309v1
|
|||
Approximation of a Direction of ${N}^{d}$ in Bounded CoordinatesMobile Networks and Applications, 2001, 6 (6), pp.547-550
Article dans une revue
hal-00622672v1
|
|||
Permutations with few internal pointsElectron. Notes Discret. Math., 2011, 38, pp.291--296. ⟨10.1016/J.ENDM.2011.09.048⟩
Article dans une revue
istex
hal-04316399v1
|
|||
Random Maps, Coalescing Saddles, Singularity Analysis, and Airy PhenomenaRandom Structures and Algorithms, 2001, 19 (3-4), pp.194-246
Article dans une revue
inria-00108014v1
|
|||
Optimal Coding and Sampling of triangulationsAlgorithmica, 2006, 46 (3-4), pp.505-527
Article dans une revue
hal-00159287v1
|
|||
Planar graphs, via well-orderly maps and treesGraphs and Combinatorics, 2006, 22 (2), pp.185-202
Article dans une revue
hal-00159296v1
|
|||
|
|
The number of Z-convex polyominoes2006
Pré-publication, Document de travail
hal-00019885v1
|
||
|
|
Random Planar Lattices and Integrated SuperBrownian ExcursionProbability Theory and Related Fields, 2004, 128(2), pp.161-212. ⟨10.1007/s00440-003-0297-8⟩
Article dans une revue
hal-00005090v1
|
||
|
|
Random Planar Lattices and Integrated SuperBrownian ExcursionColloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Gardy, D. and Mokkadem, A., Sep 2002, Versailles, France, pp.123--141
Communication dans un congrès
inria-00099448v1
|