7 citations · 16 across the 30 of their papers we have counts for
6 papers · 1 filter
Communication Complexity of Inner Product in Symmetric Normed Spaces
Alexandr Andoni, Jarosław Błasiok, Arnold Filtser
We introduce and study the communication complexity of computing the inner product of two vectors, where the input is restricted w.r.t. a norm on the space . Here…
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings
Arnold Filtser
Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO) for Euclidean space. A -LSO is a collection of orderings such that for every $x,y\i…
Expander Decomposition in Dynamic Streams
Arnold Filtser, Michael Kapralov, Mikhail Makarov
In this paper we initiate the study of expander decompositions of a graph in the streaming model of computation. The goal is to find a partitioning of vert…
Streaming Facility Location in High Dimension via Geometric Hashing
Artur Czumaj, Arnold Filtser, Shaofeng H. -C. Jiang +3
In Euclidean Uniform Facility Location (UFL), the input is a set of clients in and the goal is to place facilities to serve them, so as to minimize the total cost of…
Low Treewidth Embeddings of Planar and Minor-Free Metrics
Arnold Filtser, Hung Le
Cohen-Addad, Filtser, Klein and Le [FOCS'20] constructed a stochastic embedding of minor-free graphs of diameter into graphs of treewidth with expected additive d…
Online Spanners in Metric Spaces
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh +1
Given a metric space , a weighted graph over is a metric -spanner of if for every , , wh…