Filtrer vos résultats
- 12
- 12
- 11
- 7
- 3
- 3
- 1
- 17
- 14
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 3
- 5
- 1
- 3
- 2
- 1
- 24
- 18
- 10
- 9
- 5
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 24
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
24 résultats
|
|
triés par
|
|
The height of the Lyndon tree[Research Report] non spécifié. 2013
Rapport
hal-00879354v2
|
||
|
Asymptotic behavior of some factorizations of random wordsRandom Structures and Algorithms, In press, ⟨10.1002/rsa.21073⟩
Article dans une revue
hal-00475379v2
|
||
|
Pascal's formulas and vector fields2022
Pré-publication, Document de travail
hal-03821769v3
|
||
Optimal Sequencing of Contract AlgorithmsBar-Ilan Symposium on the Foundation of Artificial Intelligence, 1999, Ramat Gan, Israel
Communication dans un congrès
inria-00108057v1
|
|||
Real-Time Problem-Solving with Contract Algorithms16th International Joint Conference on Artificial Intelligence, 1999, Stockholm, Sweden, pp.1008-1013
Communication dans un congrès
inria-00098864v1
|
|||
|
Asynchronous Cellular Automata and Brownian Motion2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.423-442, ⟨10.46298/dmtcs.3527⟩
Communication dans un congrès
hal-00133721v3
|
||
|
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms2004
Pré-publication, Document de travail
hal-00001664v1
|
||
|
The center of mass of the ISE and the Wiener index of treesElectronic Communications in Probability, 2004, 9
Article dans une revue
hal-00005089v1
|
||
|
Efficient estimation of the cardinality of large data setsFourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.419-422, ⟨10.46298/dmtcs.3492⟩
Communication dans un congrès
hal-00095370v5
|
||
|
Local limit of labeled trees and expected volume growth in a random quadrangulationAnnals of Probability, 2006, 34 numéro 3, pp.879-917. ⟨10.1214/009117905000000774⟩
Article dans une revue
hal-00137910v1
|
||
Average-Case Analysis of the Chip ProblemInternational Journal of Mathematics and Computer Science, 2006, 1 (1), pp.37-61
Article dans une revue
hal-00091632v1
|
|||
|
The impatient collector2019
Pré-publication, Document de travail
hal-02164935v1
|
||
|
The Chip Problem[Intern report] 98-R-372 || alonso98a, 1998, 28 p
Rapport
inria-00098739v1
|
||
|
Quicksort with unreliable comparisons: a probabilistic analysisCombinatorics, Probability and Computing, 2004, 13 (4-5), pp.419-449. ⟨10.1017/S0963548304006297⟩
Article dans une revue
hal-00005087v1
|
||
|
The height of the Lyndon tree25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.957-968, ⟨10.46298/dmtcs.2357⟩
Communication dans un congrès
hal-01229697v1
|
||
|
Phase transition for parking blocks, Brownian excursion and coalescenceRandom Structures and Algorithms, 2002, 21, pp.76-119
Article dans une revue
hal-00003777v1
|
||
|
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
|
||
|
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
|
||
On the Convergence of a Population Protocol When Population Goes to InfinityPhysics and Computations, Worshop of Unconventional Computation - UC 2008, Aug 2008, Vienne, Austria
Communication dans un congrès
inria-00308018v1
|
|||
The worst-case chip problemInformation Processing Letters, 2004, 89 (6), pp.303-308
Article dans une revue
inria-00100040v1
|
|||
Random Planar Lattices and Integrated SuperBrownian Excursion[Intern report] A02-R-215 || chassaing02a, 2002, 44 p
Rapport
inria-00101065v1
|
|||
|
On the convergence of population protocols when population goes to infinityApplied Mathematics and Computation, 2009, Applied Mathematics and Computation, 215, pp.1340-1350. ⟨10.1016/j.amc.2009.04.056⟩
Article dans une revue
inria-00432318v1
|
||
|
A non-ergodic probabilistic cellular automaton with a unique invariant measureStochastic Processes and their Applications, 2011, 121 (11), pp.2474-2487. ⟨10.1016/j.spa.2011.06.009⟩
Article dans une revue
hal-00512864v3
|
||
Optimal Sequencing of Contract AlgorithmsAnnals of Mathematics and Artificial Intelligence, 2003, 39 (1), pp.1-18. ⟨10.1023/A:1024412831598⟩
Article dans une revue
istex
inria-00099720v1
|