The following pages link to Brigitte Chauvin (Q627228):
Displaying 33 items.
- Limit distributions for large Pólya urns (Q627230) (← links)
- Trees for algorithmics (Q723893) (← links)
- The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees (Q866959) (← links)
- Smoothing equations for large Pólya urns (Q895897) (← links)
- (Q1079302) (redirect page) (← links)
- Arbres et processus de Bellman-Harris. (Trees and Bellman-Harris processes) (Q1079303) (← links)
- Sur la propriété de branchement. (On the property of branching) (Q1079304) (← links)
- KPP equation and supercritical branching Brownian motion in the subcritical speed area. Application to spatial trees (Q1107907) (← links)
- Product martingales and stopping lines for branching Brownian motion (Q1176366) (← links)
- Growing conditioned trees (Q1180178) (← links)
- The profile of binary search trees (Q1872435) (← links)
- Branching processes, trees and the Boltzmann equation (Q1897667) (← links)
- Variable length memory chains: characterization of stationary probability measures (Q2040105) (← links)
- Limit distributions for multitype branching processes of \(m\)-ary search trees (Q2451114) (← links)
- A Propagation of Chaos Related to the Continuity Laws (Q2720997) (← links)
- (Q2834328) (← links)
- Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes (Q2860794) (← links)
- (Q2900352) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- Support and density of the limit $m$-ary search trees distribution (Q2920855) (← links)
- A geometric rate of convergence to the equilibrium for Boltzmann processes with multiple particle interactions (Q3203825) (← links)
- Supercritical Branching Brownian Motion and K-P-P Equation In the Critical Speed-Area (Q3212093) (← links)
- A sprouting tree model for random boolean functions (Q3460511) (← links)
- (Q3738360) (← links)
- (Q3774654) (← links)
- <i>m</i>‐ary Search trees when <i>m</i> ≥ 27: A strong asymptotics for the space requirements (Q4459586) (← links)
- And/Or Trees Revisited (Q4670353) (← links)
- A stochastic simulation for solving scalar reaction–diffusion equations (Q4712625) (← links)
- Uncommon suffix tries (Q5175232) (← links)
- The growing tree distribution on Boolean functions. (Q5194690) (← links)
- (Q5284179) (← links)
- B-urns (Q5739568) (← links)
- Digital search trees and chaos game representation (Q5851009) (← links)
