What graph neural networks cannot learn: depth vs width
A Loukas - arxiv preprint arxiv:1907.03199, 2019 - arxiv.org
This paper studies the expressive power of graph neural networks falling within the
message-passing framework (GNNmp). Two results are presented. First, GNNmp are shown …
message-passing framework (GNNmp). Two results are presented. First, GNNmp are shown …
Undirected (1+𝜀)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
This paper presents near-optimal deterministic parallel and distributed algorithms for
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …
On the power of the congested clique model
We study the computation power of the congested clique, a model of distributed computation
where n players communicate with each other over a complete network in order to compute …
where n players communicate with each other over a complete network in order to compute …
Distributed approximation algorithms for weighted shortest paths
D Nanongkai - Proceedings of the forty-sixth annual ACM symposium …, 2014 - dl.acm.org
A distributed network is modeled by a graph having n nodes (processors) and diameter D.
We study the time complexity of approximating weighted (undirected) shortest paths on …
We study the time complexity of approximating weighted (undirected) shortest paths on …
Local computation: Lower and upper bounds
The question of what can be computed, and how efficiently, is at the core of computer
science. Not surprisingly, in distributed systems and networking research, an equally …
science. Not surprisingly, in distributed systems and networking research, an equally …
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …
We prove the existence of compact routing tables that store in each network-node few …
Algebraic methods in the congested clique
In this work, we use algebraic methods for studying distance computation and subgraph
detection tasks in the congested clique model. Specifically, we adapt parallel matrix …
detection tasks in the congested clique model. Specifically, we adapt parallel matrix …
Optimal deterministic routing and sorting on the congested clique
C Lenzen - Proceedings of the 2013 ACM symposium on …, 2013 - dl.acm.org
Consider a clique of n nodes, where in each synchronous round each pair of nodes can
exchange O (log n) bits. We provide deterministic constant-time solutions for two problems in …
exchange O (log n) bits. We provide deterministic constant-time solutions for two problems in …
Optimal distributed all pairs shortest paths and applications
We present an algorithm to compute All Pairs Shortest Paths (APSP) of a network in a
distributed way. The model of distributed computation we consider is the message passing …
distributed way. The model of distributed computation we consider is the message passing …
Networks cannot compute their diameter in sublinear time
We study the problem of computing the diameter of a network in a distributed way. The
model of distributed computation we consider is: in each synchronous round, each node can …
model of distributed computation we consider is: in each synchronous round, each node can …