default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnold Filtser
Person information
- affiliation: Bar Ilan University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Arnold Filtser
, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. Discret. Comput. Geom. 71(3): 849-871 (2024)- [j15]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. SIAM J. Discret. Math. 38(1): 1030-1056 (2024) - [c33]Arnold Filtser, Yuval Gitlitz, Ofer Neiman:
Light, Reliable Spanners. SoCG 2024: 56:1-56:15 - [c32]Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. SODA 2024: 4564-4579 - [i36]Arnold Filtser:
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications. CoRR abs/2401.14060 (2024) - [i35]Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif:
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR abs/2407.12230 (2024) - 2023
- [j14]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. Algorithmica 85(5): 1490-1519 (2023) - [j13]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52(5): 1319-1320 (2023) - [j12]Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. ACM Trans. Algorithms 19(4): 39:1-39:36 (2023) - [c31]Arnold Filtser:
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. SoCG 2023: 33:1-33:18 - [c30]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: 60-76 - [c29]Alexandr Andoni, Jaroslaw Blasiok, Arnold Filtser:
Communication Complexity of Inner Product in Symmetric Normed Spaces. ITCS 2023: 4:1-4:22 - [c28]Arnold Filtser, Michael Kapralov, Mikhail Makarov:
Expander Decomposition in Dynamic Streams. ITCS 2023: 50:1-50:13 - [i34]Arnold Filtser, Yuval Gitlitz, Ofer Neiman:
Light, Reliable Spanners. CoRR abs/2307.16612 (2023) - [i33]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 abs/2308.01199 (2023) - [i32]Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. CoRR abs/2310.14078 (2023) - 2022
- [j11]Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. Algorithmica 84(10): 2987-3007 (2022) - [j10]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 51(2): 290-314 (2022) - [j9]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: 82-112 (2022) - [c27]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. ESA 2022: 18:1-18:20 - [c26]Arnold Filtser, Hung Le:
Low Treewidth Embeddings of Planar and Minor-Free Metrics. FOCS 2022: 1081-1092 - [c25]Arnold Filtser, Hung Le:
Locality-sensitive orderings and applications to reliable spanners. STOC 2022: 1066-1079 - [i31]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. CoRR abs/2202.09991 (2022) - [i30]Arnold Filtser, Hung Le:
Low Treewidth Embeddings of Planar and Minor-Free Metrics. CoRR abs/2203.15627 (2022) - [i29]Arnold Filtser, Michael Kapralov, Mikhail Makarov:
Expander Decomposition in Dynamic Streams. CoRR abs/2211.11384 (2022) - [i28]Arnold Filtser:
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings. CoRR abs/2211.11846 (2022) - [i27]Alexandr Andoni, Jaroslaw Blasiok, Arnold Filtser:
Communication Complexity of Inner Product in Symmetric Normed Spaces. CoRR abs/2211.13473 (2022) - 2021
- [c24]Arnold Filtser, Omrit Filtser:
Condorcet Relaxation In Spatial Voting. AAAI 2021: 5407-5414 - [c23]Arnold Filtser:
Hop-Constrained Metric Embeddings and their Applications. FOCS 2021: 492-503 - [c22]Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. SODA 2021: 1150-1170 - [c21]Arnold Filtser, Michael Kapralov, Navid Nouri:
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. SODA 2021: 1894-1913 - [c20]Arnold Filtser, Hung Le:
Clan embeddings into trees, and low treewidth graphs. STOC 2021: 342-355 - [i26]Arnold Filtser, Hung Le:
Clan Embeddings into Trees, and Low Treewidth Graphs. CoRR abs/2101.01146 (2021) - [i25]Arnold Filtser, Hung Le:
Reliable Spanners: Locality-Sensitive Orderings Strike Back. CoRR abs/2101.07428 (2021) - [i24]Arnold Filtser:
Hop-Constrained Metric Embeddings and their Applications. CoRR abs/2106.14969 (2021) - 2020
- [j8]Arnold Filtser, Shay Solomon:
The Greedy Spanner Is Existentially Optimal. SIAM J. Comput. 49(2): 429-447 (2020) - [j7]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms 16(2): 19:1-19:21 (2020) - [c19]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: 589-600 - [c18]Arnold Filtser:
Scattering and Sparse Partitions, and Their Applications. ICALP 2020: 47:1-47:20 - [c17]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. ICALP 2020: 48:1-48:19 - [c16]Michael Elkin, Arnold Filtser, Ofer Neiman:
Distributed Construction of Light Networks. PODC 2020: 483-492 - [c15]Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed Representations of Distances. SODA 2020: 1063-1075 - [c14]Arnold Filtser:
A face cover perspective to ℓ1 embeddings of planar graphs. SODA 2020: 1945-1954 - [i23]Arnold Filtser:
Scattering and Sparse Partitions, and their Applications. CoRR abs/2001.04447 (2020) - [i22]Arnold Filtser, Omrit Filtser:
Plurality in Spatial Voting Games with constant $β$. CoRR abs/2005.04799 (2020) - [i21]Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. CoRR abs/2007.10898 (2020) - [i20]Arnold Filtser, Michael Kapralov, Navid Nouri:
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model. CoRR abs/2007.14204 (2020) - [i19]Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le:
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. CoRR abs/2009.05039 (2020)
2010 – 2019
- 2019
- [j6]Arnold Filtser, Nimrod Talmon:
Distributed monitoring of election winners. Artif. Intell. 276: 79-104 (2019) - [j5]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: 116-129 (2019) - [j4]Arnold Filtser:
Steiner Point Removal with Distortion O(log k) using the Relaxed-Voronoi Algorithm. SIAM J. Comput. 48(2): 249-278 (2019) - [c13]Arnold Filtser:
On Strong Diameter Padded Decompositions. APPROX-RANDOM 2019: 6:1-6:21 - [c12]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. ESA 2019: 4:1-4:15 - [c11]Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi:
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. SOSA 2019: 10:1-10:14 - [i18]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. CoRR abs/1902.07562 (2019) - [i17]Arnold Filtser:
A face cover perspective to 𝓁1 embeddings of planar graphs. CoRR abs/1903.02758 (2019) - [i16]Michael Elkin, Arnold Filtser, Ofer Neiman:
Distributed Construction of Light Networks. CoRR abs/1905.02592 (2019) - [i15]Arnold Filtser:
On Strong Diameter Padded Decompositions. CoRR abs/1906.09783 (2019) - [i14]Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed Representations of Distances. CoRR abs/1907.06857 (2019) - 2018
- [j3]Michael Elkin, Arnold Filtser, Ofer Neiman:
Prioritized Metric Structures and Embedding. SIAM J. Comput. 47(3): 829-858 (2018) - [c10]Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. ESA 2018: 29:1-29:15 - [c9]Arnold Filtser:
Steiner Point Removal with Distortion O(log k). SODA 2018: 1361-1373 - [c8]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. SODA 2018: 1650-1664 - [c7]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric embedding via shortest path decompositions. STOC 2018: 952-963 - [i13]Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. CoRR abs/1804.07456 (2018) - [i12]Arnold Filtser, Nimrod Talmon:
Distributed Monitoring of Election Winners. CoRR abs/1805.02206 (2018) - [i11]Arnold Filtser:
Steiner Point Removal with distortion O(log k), using the Noisy-Voronoi algorithm. CoRR abs/1808.02800 (2018) - [i10]Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi:
Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems. CoRR abs/1809.00942 (2018) - 2017
- [j2]Arnold Filtser, Robert Krauthgamer:
Sparsification of Two-Variable Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. 31(2): 1263-1276 (2017) - [j1]Michael Elkin, Arnold Filtser, Ofer Neiman:
Terminal embeddings. Theor. Comput. Sci. 697: 1-36 (2017) - [c6]Arnold Filtser, Nimrod Talmon:
Distributed Monitoring of Election Winners. AAMAS 2017: 1160-1168 - [i9]Arnold Filtser:
Steiner Point Removal with Distortion O(log k). CoRR abs/1706.08115 (2017) - [i8]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. CoRR abs/1707.08769 (2017) - [i7]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric Embedding via Shortest Path Decompositions. CoRR abs/1708.04073 (2017) - [i6]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR abs/1709.01960 (2017) - 2016
- [c5]Arnold Filtser, Shay Solomon:
The Greedy Spanner is Existentially Optimal. PODC 2016: 9-17 - [c4]Yair Bartal, Arnold Filtser, Ofer Neiman:
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. SODA 2016: 873-882 - [i5]Michael Elkin, Arnold Filtser, Ofer Neiman:
Terminal Embeddings. CoRR abs/1603.02321 (2016) - [i4]Arnold Filtser, Shay Solomon:
The Greedy Spanner is Existentially Optimal. CoRR abs/1605.06852 (2016) - [i3]Yair Bartal, Arnold Filtser, Ofer Neiman:
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. CoRR abs/1609.08801 (2016) - 2015
- [c3]Michael Elkin, Arnold Filtser, Ofer Neiman:
Terminal Embeddings. APPROX-RANDOM 2015: 242-264 - [c2]Michael Elkin, Arnold Filtser, Ofer Neiman:
Prioritized Metric Structures and Embedding. STOC 2015: 489-498 - [i2]Michael Elkin, Arnold Filtser, Ofer Neiman:
Prioritized Metric Structures and Embedding. CoRR abs/1502.05543 (2015) - [i1]Arnold Filtser, Robert Krauthgamer:
Sparsification of Two-Variable Valued CSPs. CoRR abs/1509.01844 (2015) - 2013
- [c1]Arnold Filtser, Jiaxi Jin, Aryeh Kontorovich, Ari Trachtenberg:
Efficient determination of the unique decodability of a string. ISIT 2013: 1411-1415
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
