Ultimamente añadido

Mostrando ítems 501-520 de 1776

Las cookies de este sitio web no contienen ninguna clase de información personal específica, solo permiten recoger datos sobre su navegación. Más información…

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800: envíos recientes

Dynamic Task and Data Placement over NUMA Architectures: an OpenMP Runtime Perspective

Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch

Compact Name-Independent Routing with Minimum Stretch

Construction locale de sous-graphes couvrants peu denses

La structure des graphes sans mineur K 2,4

Fast Deterministic Distributed Algorithms for Sparse Spanners

Efficient shared memory message passing for inter-VM communications

Localized and Compact Data-Structure for Comparability Graphs

Schéma relationnel distribué pour les arbres

A Distributed Algorithm for Resource Clustering in Large Scale Platforms

Brief Announcement: On Local Representation of Distances in Trees

Distributed Relationship Schemes for Trees

Brief Announcement: On the Complexity of Distributed Greedy Coloring

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

Short Labels by Traversal and Jumping

Sin título

Spanners for Bounded Tree-Length Graphs

Localized Data Structures (Keynote Talk)

Strong-Diameter Decompositions of Minor Free Graphs

Average Stretch Analysis of Compact Routing Schemes

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800: envíos recientes

Dynamic Task and Data Placement over NUMA Architectures: an OpenMP Runtime Perspective ﻿

Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch ﻿

Compact Name-Independent Routing with Minimum Stretch ﻿

Construction locale de sous-graphes couvrants peu denses ﻿

La structure des graphes sans mineur K 2,4 ﻿

Fast Deterministic Distributed Algorithms for Sparse Spanners ﻿

Efficient shared memory message passing for inter-VM communications ﻿

Localized and Compact Data-Structure for Comparability Graphs ﻿

Schéma relationnel distribué pour les arbres ﻿

A Distributed Algorithm for Resource Clustering in Large Scale Platforms ﻿

Brief Announcement: On Local Representation of Distances in Trees ﻿

Distributed Relationship Schemes for Trees ﻿

Brief Announcement: On the Complexity of Distributed Greedy Coloring ﻿

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs ﻿

Short Labels by Traversal and Jumping ﻿

Sin título ﻿

Spanners for Bounded Tree-Length Graphs ﻿

Localized Data Structures (Keynote Talk) ﻿

Strong-Diameter Decompositions of Minor Free Graphs ﻿

Average Stretch Analysis of Compact Routing Schemes ﻿

Dynamic Task and Data Placement over NUMA Architectures: an OpenMP Runtime Perspective

Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch

Compact Name-Independent Routing with Minimum Stretch

Construction locale de sous-graphes couvrants peu denses

La structure des graphes sans mineur K 2,4

Fast Deterministic Distributed Algorithms for Sparse Spanners

Efficient shared memory message passing for inter-VM communications

Localized and Compact Data-Structure for Comparability Graphs

Schéma relationnel distribué pour les arbres

A Distributed Algorithm for Resource Clustering in Large Scale Platforms

Brief Announcement: On Local Representation of Distances in Trees

Distributed Relationship Schemes for Trees

Brief Announcement: On the Complexity of Distributed Greedy Coloring

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

Short Labels by Traversal and Jumping

Sin título

Spanners for Bounded Tree-Length Graphs

Localized Data Structures (Keynote Talk)

Strong-Diameter Decompositions of Minor Free Graphs

Average Stretch Analysis of Compact Routing Schemes