Arnold Filtser

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 81

Top Topics

Bounded Treewidth

Locality Sensitive

High Dimensional

Nearest Neighbor

Top Venues

SIAM J. Comput.

Publications

Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth
Online Spanners in Metric Spaces. SIAM J. Discret. Math. 38 (1) (2024)
Arnold Filtser
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications. CoRR (2024)
Sujoy Bhore, Arnold Filtser, Csaba D. Tóth
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. SODA (2024)
Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer
Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. Discret. Comput. Geom. 71 (3) (2024)
Arnold Filtser, Yuval Gitlitz, Ofer Neiman
Light, Reliable Spanners. SoCG (2024)
Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR (2024)
Arnold Filtser, Omrit Filtser
Static and Streaming Data Structures for Fréchet Distance Queries. ACM Trans. Algorithms 19 (4) (2023)
Arnold Filtser
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. SoCG (2023)
Arnold Filtser, Michael Kapralov, Mikhail Makarov
Expander Decomposition in Dynamic Streams. ITCS (2023)
Alexandr Andoni, Jaroslaw Blasiok, Arnold Filtser
Communication Complexity of Inner Product in Symmetric Normed Spaces. ITCS (2023)
Arnold Filtser, Omrit Filtser, Matthew J. Katz
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. Algorithmica 85 (5) (2023)
Sujoy Bhore, Arnold Filtser, Csaba D. Tóth
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. CoRR (2023)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52 (5) (2023)
Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. CoRR (2023)
Arnold Filtser, Yuval Gitlitz, Ofer Neiman
Light, Reliable Spanners. CoRR (2023)
Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. FOCS (2023)
Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen
Constructing light spanners deterministically in near-linear time. Theor. Comput. Sci. 907 (2022)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 51 (2) (2022)
Arnold Filtser, Hung Le
Low Treewidth Embeddings of Planar and Minor-Free Metrics. CoRR (2022)
Arnold Filtser
Hop-Constrained Metric Embeddings and their Applications. FOCS (2022)
Alexandr Andoni, Jaroslaw Blasiok, Arnold Filtser
Communication Complexity of Inner Product in Symmetric Normed Spaces. CoRR (2022)
Arnold Filtser, Hung Le
Low Treewidth Embeddings of Planar and Minor-Free Metrics. FOCS (2022)
Arnold Filtser, Ofer Neiman
Light Spanners for High Dimensional Norms via Stochastic Decompositions. Algorithmica 84 (10) (2022)
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth
Online Spanners in Metric Spaces. CoRR (2022)
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth
Online Spanners in Metric Spaces. ESA (2022)
Arnold Filtser, Michael Kapralov, Mikhail Makarov
Expander Decomposition in Dynamic Streams. CoRR (2022)
Arnold Filtser, Hung Le
Locality-sensitive orderings and applications to reliable spanners. STOC (2022)
Arnold Filtser
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. CoRR (2022)
Arnold Filtser
Hop-Constrained Metric Embeddings and their Applications. CoRR (2021)
Arnold Filtser, Hung Le
Clan embeddings into trees, and low treewidth graphs. STOC (2021)
Arnold Filtser, Hung Le
Reliable Spanners: Locality-Sensitive Orderings Strike Back. CoRR (2021)
Arnold Filtser
Hop-Constrained Metric Embeddings and their Applications. FOCS (2021)
Arnold Filtser, Michael Kapralov, Navid Nouri
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. SODA (2021)
Arnold Filtser, Omrit Filtser
Static and Streaming Data Structures for Fréchet Distance Queries. SODA (2021)
Arnold Filtser, Omrit Filtser
Condorcet Relaxation In Spatial Voting. AAAI (2021)
Arnold Filtser, Hung Le
Clan Embeddings into Trees, and Low Treewidth Graphs. CoRR (2021)
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms 16 (2) (2020)
Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. CoRR (2020)
Arnold Filtser, Omrit Filtser
Plurality in Spatial Voting Games with constant $β$. CoRR (2020)
Arnold Filtser
embeddings of planar graphs. SODA (2020)
Arnold Filtser
Scattering and Sparse Partitions, and their Applications. CoRR (2020)
Arnold Filtser, Shay Solomon
The Greedy Spanner Is Existentially Optimal. SIAM J. Comput. 49 (2) (2020)
Arnold Filtser, Omrit Filtser, Matthew J. Katz
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. ICALP (2020)
Michael Elkin, Arnold Filtser, Ofer Neiman
Distributed Construction of Light Networks. PODC (2020)
Arnold Filtser
Scattering and Sparse Partitions, and Their Applications. ICALP (2020)
Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. FOCS (2020)
Arnold Filtser, Michael Kapralov, Navid Nouri
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. CoRR (2020)
Arnold Filtser, Omrit Filtser
Static and Streaming Data Structures for Fréchet Distance Queries. CoRR (2020)
Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer
Labelings vs. Embeddings: On Distributed Representations of Distances. SODA (2020)
Arnold Filtser
On Strong Diameter Padded Decompositions. CoRR (2019)
Arnold Filtser
embeddings of planar graphs. CoRR (2019)
Arnold Filtser, Omrit Filtser, Matthew J. Katz
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. CoRR (2019)
Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer
Labelings vs. Embeddings: On Distributed Representations of Distances. CoRR (2019)
Michael Elkin, Arnold Filtser, Ofer Neiman
Distributed Construction of Light Networks. CoRR (2019)
Arnold Filtser, Nimrod Talmon
Distributed monitoring of election winners. Artif. Intell. 276 (2019)
Yair Bartal, Arnold Filtser, Ofer Neiman
On notions of distortion and an almost minimum spanning tree with constant average distortion. J. Comput. Syst. Sci. 105 (2019)
Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen
Constructing Light Spanners Deterministically in Near-Linear Time. ESA (2019)
Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. SOSA (2019)
Arnold Filtser
On Strong Diameter Padded Decompositions. APPROX-RANDOM (2019)
Arnold Filtser
Steiner Point Removal with Distortion O(log k) using the Relaxed-Voronoi Algorithm. SIAM J. Comput. 48 (2) (2019)
Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi
Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems. CoRR (2018)
Arnold Filtser, Ofer Neiman
Light Spanners for High Dimensional Norms via Stochastic Decompositions. ESA (2018)
Arnold Filtser
Steiner Point Removal with distortion O(log k), using the Noisy-Voronoi algorithm. CoRR (2018)
Arnold Filtser
). SODA (2018)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric embedding via shortest path decompositions. STOC (2018)
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
Ramsey Spanning Trees and their Applications. SODA (2018)
Michael Elkin, Arnold Filtser, Ofer Neiman
Prioritized Metric Structures and Embedding. SIAM J. Comput. 47 (3) (2018)
Arnold Filtser, Ofer Neiman
Light Spanners for High Dimensional Norms via Stochastic Decompositions. CoRR (2018)
Arnold Filtser, Nimrod Talmon
Distributed Monitoring of Election Winners. CoRR (2018)
Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR (2017)
Michael Elkin, Arnold Filtser, Ofer Neiman
Terminal embeddings. Theor. Comput. Sci. 697 (2017)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric Embedding via Shortest Path Decompositions. CoRR (2017)
Arnold Filtser, Robert Krauthgamer
Sparsification of Two-Variable Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. 31 (2) (2017)
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
Ramsey Spanning Trees and their Applications. CoRR (2017)
Arnold Filtser, Nimrod Talmon
Distributed Monitoring of Election Winners. AAMAS (2017)
Arnold Filtser
Steiner Point Removal with Distortion O(log k). CoRR (2017)
Michael Elkin, Arnold Filtser, Ofer Neiman
Terminal Embeddings. CoRR (2016)
Yair Bartal, Arnold Filtser, Ofer Neiman
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. SODA (2016)
Yair Bartal, Arnold Filtser, Ofer Neiman
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. CoRR (2016)
Arnold Filtser, Shay Solomon
The Greedy Spanner is Existentially Optimal. CoRR (2016)
Arnold Filtser, Shay Solomon
The Greedy Spanner is Existentially Optimal. PODC (2016)
Michael Elkin, Arnold Filtser, Ofer Neiman
Prioritized Metric Structures and Embedding. CoRR (2015)
Arnold Filtser, Robert Krauthgamer
Sparsification of Two-Variable Valued CSPs. CoRR (2015)
Michael Elkin, Arnold Filtser, Ofer Neiman
Terminal Embeddings. APPROX-RANDOM (2015)
Michael Elkin, Arnold Filtser, Ofer Neiman
Prioritized Metric Structures and Embedding. STOC (2015)
Arnold Filtser, Jiaxi Jin, Aryeh Kontorovich, Ari Trachtenberg
Efficient determination of the unique decodability of a string. ISIT (2013)