activity
20152023
most citedApproximately Counting Triangles in Sublinear Time

25 citations · 53 across the 12 of their papers we have counts for

collaborators

16 papers

cs.DS2023

Support Testing in the Huge Object Model

Tomer Adar, Eldar Fischer, Amit Levi

The Huge Object model is a distribution testing model in which we are given access to independent samples from an unknown distribution over the set of strings , but are…

cs.DS2022

Streaming Euclidean MST to a Constant Factor

Vincent Cohen-Addad, Xi Chen, Rajesh Jayaram +2

We study streaming algorithms for the fundamental geometric problem of computing the cost of the Euclidean Minimum Spanning Tree (MST) on an -point set .…

cs.LG2022★ 6 cited

Learnable Graph Convolutional Attention Networks

Adrián Javaloy, Pablo Sanchez-Martin, Amit Levi +1

Existing Graph Neural Networks (GNNs) compute the message exchange between nodes by either aggregating uniformly (convolving) the features of all the neighboring nodes, or by apply…

cs.LG2022★ 13 cited

Graph Attention Retrospective

Kimon Fountoulakis, Amit Levi, Shenghao Yang +2

Graph-based learning is a rapidly growing sub-field of machine learning with applications in social networks, citation networks, and bioinformatics. One of the most popular models…

cs.DS2021

New Streaming Algorithms for High Dimensional EMD and MST

Xi Chen, Rajesh Jayaram, Amit Levi +1

We study streaming algorithms for two fundamental geometric problems: computing the cost of a Minimum Spanning Tree (MST) of an -point set , and com…

cs.DS2020

Erasure-Resilient Sublinear-Time Graph Algorithms

Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova +1

We investigate sublinear-time algorithms that take partially erased graphs represented by adjacency lists as input. Our algorithms make degree and neighbor queries to the input gra…