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 …
[ΒΙΒΛΙΟ][B] Communication Complexity: and Applications
A Rao, A Yehudayoff - 2020 - books.google.com
Communication complexity is the mathematical study of scenarios where several parties
need to communicate to achieve a common goal, a situation that naturally appears during …
need to communicate to achieve a common goal, a situation that naturally appears during …
Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given
an nxn matrix M and will receive n column-vectors of size n, denoted by v1,..., vn, one by …
an nxn matrix M and will receive n column-vectors of size n, denoted by v1,..., vn, one by …
Distributed verification and hardness of distributed approximation
We study the verification problem in distributed networks, stated as follows. Let H be a
subgraph of a network G where each vertex of G knows which edges incident on it are in H …
subgraph of a network G where each vertex of G knows which edges incident on it are in H …
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
The radius and diameter are fundamental graph parameters, with several natural definitions
for directed graphs. Each definition is well-motivated in a variety of applications. All versions …
for directed graphs. Each definition is well-motivated in a variety of applications. All versions …
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 …
Recent advances in multi-pass graph streaming lower bounds
S Assadi - ACM SIGACT News, 2023 - dl.acm.org
Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …
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 …
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 …