Arnold Filtser
Titel
Citeret af
Citeret af
År
The greedy spanner is existentially optimal
A Filtser, S Solomon
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
292016
Terminal embeddings
M Elkin, A Filtser, O Neiman
Theoretical Computer Science 697, 1-36, 2017
172017
On notions of distortion and an almost minimum spanning tree with constant average distortion
Y Bartal, A Filtser, O Neiman
Journal of Computer and System Sciences 105, 116-129, 2019
152019
Prioritized metric structures and embedding
M Elkin, A Filtser, O Neiman
SIAM Journal on Computing 47 (3), 829-858, 2018
152018
Steiner Point Removal with Distortion O(log k)
A Filtser
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
122018
Ramsey spanning trees and their applications
I Abraham, S Chechik, M Elkin, A Filtser, O Neiman
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
122018
Constructing light spanners deterministically in near-linear time
S Alstrup, S Dahlgaard, A Filtser, M Stöckel, C Wulff-Nilsen
arXiv preprint arXiv:1709.01960, 2017
122017
Metric embedding via shortest path decompositions
I Abraham, A Filtser, A Gupta, O Neiman
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
92018
Terminal embeddings
M Elkin, A Filtser, O Neiman
arXiv preprint arXiv:1603.02321, 2016
82016
Relaxed voronoi: A simple framework for terminal-clustering problems
A Filtser, R Krauthgamer, O Trabelsi
arXiv preprint arXiv:1809.00942, 2018
72018
Light spanners for high dimensional norms via stochastic decompositions
A Filtser, O Neiman
arXiv preprint arXiv:1804.07456, 2018
72018
Approximate Nearest Neighbor for Curves---Simple, Efficient, and Deterministic
A Filtser, O Filtser, MJ Katz
arXiv preprint arXiv:1902.07562, 2019
62019
Distributed monitoring of election winners
A Filtser, N Talmon
Artificial Intelligence 276, 79-104, 2019
32019
On Strong Diameter Padded Decompositions
A Filtser
arXiv preprint arXiv:1906.09783, 2019
32019
A face cover perspective to embeddings of planar graphs
A Filtser
arXiv preprint arXiv:1903.02758, 2019
32019
Efficient determination of the unique decodability of a string
A Filtser, J Jin, A Kontorovich, A Trachtenberg
2013 IEEE International Symposium on Information Theory, 1411-1415, 2013
32013
Scattering and Sparse Partitions, and their Applications
A Filtser
arXiv preprint arXiv:2001.04447, 2020
22020
The Greedy Spanner is Existentially Optimal
A Filtser, S Solomon
SIAM Journal on Computing 49 (2), 429-447, 2020
22020
Labelings vs. embeddings: On distributed representations of distances
A Filtser, LA Gottlieb, R Krauthgamer
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
22020
Steiner Point Removal with Distortion using the Relaxed-Voronoi Algorithm
A Filtser
SIAM Journal on Computing 48 (2), 249-278, 2019
22019
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20