853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
5 papers · 1 filter
Study of conditions of use of E-services accessible to visually disabled persons
Marc-Eric Bobiller-Chaumon, Michel Dubois, Françoise Sandoz-Guermond
The aim of this paper is to determine the expectations that French-speaking disabled persons have for electronic administrative sites (utility). At the same time, it is a matter of…
Local Leaders in Random Networks
V. D. Blondel, J. -L. Guillaume, J. M. Hendrickx +2
We consider local leaders in random uncorrelated networks, i.e. nodes whose degree is higher or equal than the degree of all of their neighbors. An analytical expression is found f…
A New Self-Stabilizing Maximal Matching Algorithm
Fredrik Manne, Morten Mjelde, Laurence Pilard +1
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the pr…
On the implementation of construction functions for non-free concrete data types
Frédéric Blanqui, Thérèse Hardin, Pierre Weis
Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence classes o…
A version of the Glimm method based on generalized Riemann problems
John M. Hong, Philippe G. LeFloch
We introduce a generalization of Glimm's random choice method, which provides us with an approximation of entropy solutions to quasilinear hyperbolic system of balance laws. The fl…