265 citations
- Institut national de recherche en sciences et technologies du numériqueFR20 papers
- Geometric (India)IN8 papers
- Institut de Mathématiques de BordeauxFR8 papers
- Centre Inria de l'université de BordeauxFR7 papers
- Centre Inria de l'Université de LorraineFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR4 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR4 papers
- Nantes UniversitéFR4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- École PolytechniqueFR3 papers
- Graz University of TechnologyAT3 papers
- Institut de Recherche en Informatique FondamentaleFR3 papers
6 papers · 1 filter
Towards application-specific query processing systems
Dimitrios Vasilas, Marc Shapiro, Bradley King +1
Database systems use query processing subsystems for enabling efficient query-based data retrieval. An essential aspect of designing any query-intensive application is tuning the q…
Generating Distributed Programs from Event-B Models
Horatiu Cirstea, Alexis Grall, Dominique Méry
Distributed algorithms offer challenges in checking that they meet their specifications. Verification techniques can be extended to deal with the verification of safety properties…
Tackling scalability issues in mining path patterns from knowledge graphs: a preliminary study
Pierre Monnin, Emmanuel Bresso, Miguel Couceiro +3
Features mined from knowledge graphs are widely used within multiple knowledge discovery tasks such as classification or fact-checking. Here, we consider a given set of vertices, c…
Parallel Load Balancing on Constrained Client-Server Topologies
Andrea Clementi, Emanuele Natale, Isabella Ziccardi
We study parallel \emph{Load Balancing} protocols for a client-server distributed model defined as follows. There is a set $\sC$ of clients and a set $\sS$ of servers where…
A method for eternally dominating strong grids
Alizée Gagnon, Alexander Hassler, Jerry Huang +5
In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to ad…
Simple and Fast Distributed Computation of Betweenness Centrality
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, r…