The following pages link to Christian Lavault (Q290190):
Displayed 22 items.
- Improvements on the accelerated integer GCD algorithm (Q290191) (← links)
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- Overview on Heisenberg-Weyl algebra and subsets of Riordan subgroups (Q888630) (← links)
- Exact average message complexity values for distributed election on bidirectional rings of processors (Q910221) (← links)
- Average number of messages for distributed leader-fitting in rings of processors (Q1117694) (← links)
- Worst-case analysis of Weber's GCD algorithm (Q1607009) (← links)
- Integral representations and asymptotic behaviour of a Mittag-Leffler type function of two variables (Q1704296) (← links)
- A distributed algorithm for constructing a minimum diameter spanning tree (Q1881298) (← links)
- Asymptotic analysis of a leader election algorithm (Q2503299) (← links)
- Convergence of some leader election algorithms (Q3575440) (← links)
- (Q4117882) (← links)
- (Q4250790) (← links)
- On the hierarchy of functioning rules in distributed computing (Q4511604) (← links)
- (Q4764019) (← links)
- (Q4846463) (← links)
- Average number of messages for distributed leader finding in rings of processors (Q5096161) (← links)
- Multiplicate inverse forms of terminating hypergeometric series (Q5168451) (← links)
- A uniform self-stabilizing minimum diameter spanning tree algorithm (Q6084561) (← links)
- A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal (Q6247379) (← links)
- Fractional calculus and generalized Mittag-Leffler type functions (Q6283953) (← links)
- Integral representations and asymptotic behaviours of Mittag-Leffler type functions of two variables (Q6286721) (← links)