Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ofer Neiman
@inproceedings{DBLP:conf/innovations/NeimanS24,
author = {Ofer Neiman and
Idan Shabat},
editor = {Venkatesan Guruswami},
title = {On the Size Overhead of Pairwise Spanners},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {83:1--83:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.83},
doi = {10.4230/LIPICS.ITCS.2024.83},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/NeimanS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ElkinGN23,
author = {Michael Elkin and
Yuval Gitlitz and
Ofer Neiman},
title = {Improved weighted additive spanners},
journal = {Distributed Comput.},
volume = {36},
number = {3},
pages = {385--394},
year = {2023},
url = {https://doi.org/10.1007/s00446-022-00433-x},
doi = {10.1007/S00446-022-00433-X},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/ElkinGN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamFGN23,
author = {Ittai Abraham and
Arnold Filtser and
Anupam Gupta and
Ofer Neiman},
title = {Corrigendum: Metric Embedding via Shortest Path Decompositions},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {5},
pages = {1319--1320},
year = {2023},
url = {https://doi.org/10.1137/23m1546245},
doi = {10.1137/23M1546245},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamFGN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-16612,
author = {Arnold Filtser and
Yuval Gitlitz and
Ofer Neiman},
title = {Light, Reliable Spanners},
journal = {CoRR},
volume = {abs/2307.16612},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.16612},
doi = {10.48550/ARXIV.2307.16612},
eprinttype = {arXiv},
eprint = {2307.16612},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-16612.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-13673,
author = {Ofer Neiman and
Idan Shabat},
title = {On the Size Overhead of Pairwise Spanners},
journal = {CoRR},
volume = {abs/2311.13673},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.13673},
doi = {10.48550/ARXIV.2311.13673},
eprinttype = {arXiv},
eprint = {2311.13673},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-13673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FiltserN22,
author = {Arnold Filtser and
Ofer Neiman},
title = {Light Spanners for High Dimensional Norms via Stochastic Decompositions},
journal = {Algorithmica},
volume = {84},
number = {10},
pages = {2987--3007},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00994-0},
doi = {10.1007/S00453-022-00994-0},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FiltserN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ElkinN22,
author = {Michael Elkin and
Ofer Neiman},
title = {Linear-Size hopsets with small hopbound, and constant-hopbound hopsets
in {RNC}},
journal = {Distributed Comput.},
volume = {35},
number = {5},
pages = {419--437},
year = {2022},
url = {https://doi.org/10.1007/s00446-022-00431-z},
doi = {10.1007/S00446-022-00431-Z},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/ElkinN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BartalFN22,
author = {Yair Bartal and
Ora Nova Fandina and
Ofer Neiman},
title = {Covering metric spaces by few trees},
journal = {J. Comput. Syst. Sci.},
volume = {130},
pages = {26--42},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.06.001},
doi = {10.1016/J.JCSS.2022.06.001},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BartalFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamFGN22,
author = {Ittai Abraham and
Arnold Filtser and
Anupam Gupta and
Ofer Neiman},
title = {Metric Embedding via Shortest Path Decompositions},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {2},
pages = {290--314},
year = {2022},
url = {https://doi.org/10.1137/19m1296021},
doi = {10.1137/19M1296021},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamFGN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ElkinN22,
author = {Michael Elkin and
Ofer Neiman},
title = {Lossless Prioritized Embeddings},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1529--1550},
year = {2022},
url = {https://doi.org/10.1137/21m1436221},
doi = {10.1137/21M1436221},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ElkinN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElkinN22,
author = {Michael Elkin and
Ofer Neiman},
title = {Distributed strong diameter network decomposition},
journal = {Theor. Comput. Sci.},
volume = {922},
pages = {150--157},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.019},
doi = {10.1016/J.TCS.2022.04.019},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ElkinN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/NeimanS22,
author = {Ofer Neiman and
Idan Shabat},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {A Unified Framework for Hopsets},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {81:1--81:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.81},
doi = {10.4230/LIPICS.ESA.2022.81},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/NeimanS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ElkinN22,
author = {Michael Elkin and
Ofer Neiman},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Centralized, Parallel, and Distributed Multi-Source Shortest Paths
via Hopsets and Rectangular Matrix Multiplication},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {27:1--27:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.27},
doi = {10.4230/LIPICS.STACS.2022.27},
timestamp = {Sat, 12 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ElkinN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ElkinGN22,
author = {Michael Elkin and
Yuval Gitlitz and
Ofer Neiman},
editor = {Artur Czumaj and
Qin Xin},
title = {Almost Shortest Paths with Near-Additive Error in Weighted Graphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.23},
doi = {10.4230/LIPICS.SWAT.2022.23},
timestamp = {Thu, 23 Jun 2022 13:34:22 +0200},
biburl = {https://dblp.org/rec/conf/swat/ElkinGN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElkinN21,
author = {Michael Elkin and
Ofer Neiman},
title = {Near Isometric Terminal Embeddings for Doubling Metrics},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3319--3337},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00843-6},
doi = {10.1007/S00453-021-00843-6},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ElkinN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/ElkinGN21,
author = {Michael Elkin and
Yuval Gitlitz and
Ofer Neiman},
editor = {Seth Gilbert},
title = {Improved Weighted Additive Spanners},
booktitle = {35th International Symposium on Distributed Computing, {DISC} 2021,
October 4-8, 2021, Freiburg, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {209},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.DISC.2021.21},
doi = {10.4230/LIPICS.DISC.2021.21},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/ElkinGN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-09673,
author = {Idan Shabat and
Ofer Neiman},
title = {A Unified Framework for Hopsets and Spanners},
journal = {CoRR},
volume = {abs/2108.09673},
year = {2021},
url = {https://arxiv.org/abs/2108.09673},
eprinttype = {arXiv},
eprint = {2108.09673},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-09673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/ElkinN20,
author = {Michael Elkin and
Ofer Neiman},
title = {Near-Additive Spanners and Near-Exact Hopsets, {A} Unified View},
journal = {Bull. {EATCS}},
volume = {130},
year = {2020},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/608/624},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/ElkinN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbrahamCEFN20,
author = {Ittai Abraham and
Shiri Chechik and
Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Ramsey Spanning Trees and Their Applications},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {2},
pages = {19:1--19:21},
year = {2020},
url = {https://doi.org/10.1145/3371039},
doi = {10.1145/3371039},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AbrahamCEFN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ElkinFN20,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
editor = {Yuval Emek and
Christian Cachin},
title = {Distributed Construction of Light Networks},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {483--492},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405701},
doi = {10.1145/3382734.3405701},
timestamp = {Tue, 04 Aug 2020 16:04:51 +0200},
biburl = {https://dblp.org/rec/conf/podc/ElkinFN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ElkinN20,
author = {Michael Elkin and
Ofer Neiman},
editor = {Shuchi Chawla},
title = {Lossless Prioritized Embeddings},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1049--1062},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.64},
doi = {10.1137/1.9781611975994.64},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/ElkinN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-07477,
author = {Michael Elkin and
Ofer Neiman},
title = {Near-Additive Spanners and Near-Exact Hopsets, {A} Unified View},
journal = {CoRR},
volume = {abs/2001.07477},
year = {2020},
url = {https://arxiv.org/abs/2001.07477},
eprinttype = {arXiv},
eprint = {2001.07477},
timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-07477.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07572,
author = {Michael Elkin and
Ofer Neiman},
title = {Centralized and Parallel Multi-Source Shortest Paths via Hopsets and
Fast Matrix Multiplication},
journal = {CoRR},
volume = {abs/2004.07572},
year = {2020},
url = {https://arxiv.org/abs/2004.07572},
eprinttype = {arXiv},
eprint = {2004.07572},
timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07572.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-09877,
author = {Michael Elkin and
Yuval Gitlitz and
Ofer Neiman},
title = {Improved Weighted Additive Spanners},
journal = {CoRR},
volume = {abs/2008.09877},
year = {2020},
url = {https://arxiv.org/abs/2008.09877},
eprinttype = {arXiv},
eprint = {2008.09877},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-09877.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BartalFN19,
author = {Yair Bartal and
Arnold Filtser and
Ofer Neiman},
title = {On notions of distortion and an almost minimum spanning tree with
constant average distortion},
journal = {J. Comput. Syst. Sci.},
volume = {105},
pages = {116--129},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.04.006},
doi = {10.1016/J.JCSS.2019.04.006},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BartalFN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamN19,
author = {Ittai Abraham and
Ofer Neiman},
title = {Using Petal-Decompositions to Build a Low Stretch Spanning Tree},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {2},
pages = {227--248},
year = {2019},
url = {https://doi.org/10.1137/17M1115575},
doi = {10.1137/17M1115575},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamGGNT19,
author = {Ittai Abraham and
Cyril Gavoille and
Anupam Gupta and
Ofer Neiman and
Kunal Talwar},
title = {Cops, Robbers, and Threatening Skeletons: Padded Decomposition for
Minor-Free Graphs},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {3},
pages = {1120--1145},
year = {2019},
url = {https://doi.org/10.1137/17M1112406},
doi = {10.1137/17M1112406},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamGGNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinN19,
author = {Michael Elkin and
Ofer Neiman},
title = {Hopsets with Constant Hopbound, and Applications to Approximate Shortest
Paths},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {4},
pages = {1436--1480},
year = {2019},
url = {https://doi.org/10.1137/18M1166791},
doi = {10.1137/18M1166791},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ElkinN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElkinN19,
author = {Michael Elkin and
Ofer Neiman},
title = {Efficient Algorithms for Constructing Very Sparse Spanners and Emulators},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {1},
pages = {4:1--4:29},
year = {2019},
url = {https://doi.org/10.1145/3274651},
doi = {10.1145/3274651},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ElkinN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BartalFN19,
author = {Yair Bartal and
Nova Fandina and
Ofer Neiman},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Covering Metric Spaces by Few Trees},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {20:1--20:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.20},
doi = {10.4230/LIPICS.ICALP.2019.20},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BartalFN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BartalFN19,
author = {Yair Bartal and
Nova Fandina and
Ofer Neiman},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {Dimensionality reduction: theoretical perspective on practical measures},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {10576--10588},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/94f4ede62112b790c91d5e64fdb09cb8-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/BartalFN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ElkinN19,
author = {Michael Elkin and
Ofer Neiman},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets
in {RNC}},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {333--341},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323177},
doi = {10.1145/3323165.3323177},
timestamp = {Wed, 19 Jun 2019 08:07:06 +0200},
biburl = {https://dblp.org/rec/conf/spaa/ElkinN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-02592,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Distributed Construction of Light Networks},
journal = {CoRR},
volume = {abs/1905.02592},
year = {2019},
url = {http://arxiv.org/abs/1905.02592},
eprinttype = {arXiv},
eprint = {1905.02592},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-02592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-07559,
author = {Yair Bartal and
Nova Fandina and
Ofer Neiman},
title = {Covering Metric Spaces by Few Trees},
journal = {CoRR},
volume = {abs/1905.07559},
year = {2019},
url = {http://arxiv.org/abs/1905.07559},
eprinttype = {arXiv},
eprint = {1905.07559},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-07559.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-06983,
author = {Michael Elkin and
Ofer Neiman},
title = {Lossless Prioritized Embeddings},
journal = {CoRR},
volume = {abs/1907.06983},
year = {2019},
url = {http://arxiv.org/abs/1907.06983},
eprinttype = {arXiv},
eprint = {1907.06983},
timestamp = {Tue, 23 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-06983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-11422,
author = {Michael Elkin and
Yuval Gitlitz and
Ofer Neiman},
title = {Almost Shortest Paths and {PRAM} Distance Oracles in Weighted Graphs},
journal = {CoRR},
volume = {abs/1907.11422},
year = {2019},
url = {http://arxiv.org/abs/1907.11422},
eprinttype = {arXiv},
eprint = {1907.11422},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-11422.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ElkinN18,
author = {Michael Elkin and
Ofer Neiman},
title = {On efficient distributed construction of near optimal routing schemes},
journal = {Distributed Comput.},
volume = {31},
number = {2},
pages = {119--137},
year = {2018},
url = {https://doi.org/10.1007/s00446-017-0304-4},
doi = {10.1007/S00446-017-0304-4},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/ElkinN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinFN18,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Prioritized Metric Structures and Embedding},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {829--858},
year = {2018},
url = {https://doi.org/10.1137/17M1118749},
doi = {10.1137/17M1118749},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ElkinFN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ElkinN18,
author = {Michael Elkin and
Ofer Neiman},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Near Isometric Terminal Embeddings for Doubling Metrics},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {36:1--36:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.36},
doi = {10.4230/LIPICS.SOCG.2018.36},
timestamp = {Wed, 16 Jun 2021 12:03:35 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ElkinN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FiltserN18,
author = {Arnold Filtser and
Ofer Neiman},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Light Spanners for High Dimensional Norms via Stochastic Decompositions},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {29:1--29:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.29},
doi = {10.4230/LIPICS.ESA.2018.29},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/FiltserN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ElkinN18,
author = {Michael Elkin and
Ofer Neiman},
editor = {Calvin Newport and
Idit Keidar},
title = {Near-Optimal Distributed Routing with Low Memory},
booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018},
pages = {207--216},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3212734.3212761},
doi = {10.1145/3212734.3212761},
timestamp = {Wed, 21 Nov 2018 12:44:03 +0100},
biburl = {https://dblp.org/rec/conf/podc/ElkinN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbrahamCEFN18,
author = {Ittai Abraham and
Shiri Chechik and
Michael Elkin and
Arnold Filtser and
Ofer Neiman},
editor = {Artur Czumaj},
title = {Ramsey Spanning Trees and their Applications},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1650--1664},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.108},
doi = {10.1137/1.9781611975031.108},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/AbrahamCEFN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamFGN18,
author = {Ittai Abraham and
Arnold Filtser and
Anupam Gupta and
Ofer Neiman},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Metric embedding via shortest path decompositions},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {952--963},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188808},
doi = {10.1145/3188745.3188808},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamFGN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07967,
author = {Michael Elkin and
Ofer Neiman},
title = {Near Isometric Terminal Embeddings for Doubling Metrics},
journal = {CoRR},
volume = {abs/1802.07967},
year = {2018},
url = {http://arxiv.org/abs/1802.07967},
eprinttype = {arXiv},
eprint = {1802.07967},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07967.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07456,
author = {Arnold Filtser and
Ofer Neiman},
title = {Light Spanners for High Dimensional Norms via Stochastic Decompositions},
journal = {CoRR},
volume = {abs/1804.07456},
year = {2018},
url = {http://arxiv.org/abs/1804.07456},
eprinttype = {arXiv},
eprint = {1804.07456},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElkinFN17,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Terminal embeddings},
journal = {Theor. Comput. Sci.},
volume = {697},
pages = {1--36},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.06.021},
doi = {10.1016/J.TCS.2017.06.021},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElkinFN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ElkinN17,
author = {Michael Elkin and
Ofer Neiman},
editor = {Philip N. Klein},
title = {Efficient Algorithms for Constructing Very Sparse Spanners and Emulators},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {652--669},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.41},
doi = {10.1137/1.9781611974782.41},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/ElkinN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinN17,
author = {Michael Elkin and
Ofer Neiman},
title = {Linear-Size Hopsets with Small Hopbound, and Distributed Routing with
Low Memory},
journal = {CoRR},
volume = {abs/1704.08468},
year = {2017},
url = {http://arxiv.org/abs/1704.08468},
eprinttype = {arXiv},
eprint = {1704.08468},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbrahamCEFN17,
author = {Ittai Abraham and
Shiri Chechik and
Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Ramsey Spanning Trees and their Applications},
journal = {CoRR},
volume = {abs/1707.08769},
year = {2017},
url = {http://arxiv.org/abs/1707.08769},
eprinttype = {arXiv},
eprint = {1707.08769},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbrahamCEFN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04073,
author = {Ittai Abraham and
Arnold Filtser and
Anupam Gupta and
Ofer Neiman},
title = {Metric Embedding via Shortest Path Decompositions},
journal = {CoRR},
volume = {abs/1708.04073},
year = {2017},
url = {http://arxiv.org/abs/1708.04073},
eprinttype = {arXiv},
eprint = {1708.04073},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Neiman16,
author = {Ofer Neiman},
title = {Low Dimensional Embeddings of Doubling Metrics},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {133--152},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9567-3},
doi = {10.1007/S00224-014-9567-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Neiman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NeimanS16,
author = {Ofer Neiman and
Shay Solomon},
title = {Simple Deterministic Algorithms for Fully Dynamic Maximal Matching},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {1},
pages = {7:1--7:15},
year = {2016},
url = {https://doi.org/10.1145/2700206},
doi = {10.1145/2700206},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/NeimanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElkinNW16,
author = {Michael Elkin and
Ofer Neiman and
Christian Wulff{-}Nilsen},
title = {Space-efficient path-reporting approximate distance oracles},
journal = {Theor. Comput. Sci.},
volume = {651},
pages = {1--10},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.07.038},
doi = {10.1016/J.TCS.2016.07.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElkinNW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ElkinN16,
author = {Michael Elkin and
Ofer Neiman},
editor = {Irit Dinur},
title = {Hopsets with Constant Hopbound, and Applications to Approximate Shortest
Paths},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {128--137},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.22},
doi = {10.1109/FOCS.2016.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ElkinN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AndoniNN16,
author = {Alexandr Andoni and
Assaf Naor and
Ofer Neiman},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Impossibility of Sketching of the 3D Transportation Metric with Quadratic
Cost},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {83:1--83:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.83},
doi = {10.4230/LIPICS.ICALP.2016.83},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AndoniNN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ElkinN16,
author = {Michael Elkin and
Ofer Neiman},
editor = {George Giakkoupis},
title = {Distributed Strong Diameter Network Decomposition: Extended Abstract},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {211--216},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933094},
doi = {10.1145/2933057.2933094},
timestamp = {Tue, 06 Nov 2018 11:07:19 +0100},
biburl = {https://dblp.org/rec/conf/podc/ElkinN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ElkinN16a,
author = {Michael Elkin and
Ofer Neiman},
editor = {George Giakkoupis},
title = {On Efficient Distributed Construction of Near Optimal Routing Schemes:
Extended Abstract},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {235--244},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933098},
doi = {10.1145/2933057.2933098},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/ElkinN16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BartalFN16,
author = {Yair Bartal and
Arnold Filtser and
Ofer Neiman},
editor = {Robert Krauthgamer},
title = {On Notions of Distortion and an Almost Minimum Spanning Tree with
Constant Average Distortion},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {873--882},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch62},
doi = {10.1137/1.9781611974331.CH62},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/BartalFN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/AbrahamN16,
author = {Ittai Abraham and
Ofer Neiman},
title = {Spanning Trees with Low Average Stretch},
booktitle = {Encyclopedia of Algorithms},
pages = {2032--2035},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_804},
doi = {10.1007/978-1-4939-2864-4\_804},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/AbrahamN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinN16,
author = {Michael Elkin and
Ofer Neiman},
title = {On Efficient Distributed Construction of Near Optimal Routing Schemes},
journal = {CoRR},
volume = {abs/1602.02293},
year = {2016},
url = {http://arxiv.org/abs/1602.02293},
eprinttype = {arXiv},
eprint = {1602.02293},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinN16a,
author = {Michael Elkin and
Ofer Neiman},
title = {Distributed Strong Diameter Network Decomposition},
journal = {CoRR},
volume = {abs/1602.05437},
year = {2016},
url = {http://arxiv.org/abs/1602.05437},
eprinttype = {arXiv},
eprint = {1602.05437},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinN16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinFN16,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Terminal Embeddings},
journal = {CoRR},
volume = {abs/1603.02321},
year = {2016},
url = {http://arxiv.org/abs/1603.02321},
eprinttype = {arXiv},
eprint = {1603.02321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinFN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinN16b,
author = {Michael Elkin and
Ofer Neiman},
title = {Hopsets with Constant Hopbound, and Applications to Approximate Shortest
Paths},
journal = {CoRR},
volume = {abs/1605.04538},
year = {2016},
url = {http://arxiv.org/abs/1605.04538},
eprinttype = {arXiv},
eprint = {1605.04538},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinN16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinN16c,
author = {Michael Elkin and
Ofer Neiman},
title = {Efficient Algorithms for Constructing Very Sparse Spanners and Emulators},
journal = {CoRR},
volume = {abs/1607.08337},
year = {2016},
url = {http://arxiv.org/abs/1607.08337},
eprinttype = {arXiv},
eprint = {1607.08337},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinN16c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KarpasNS16,
author = {Ilan Karpas and
Ofer Neiman and
Shakhar Smorodinsky},
title = {On Vertex Rankings of Graphs and its Relatives},
journal = {CoRR},
volume = {abs/1609.06111},
year = {2016},
url = {http://arxiv.org/abs/1609.06111},
eprinttype = {arXiv},
eprint = {1609.06111},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KarpasNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BartalFN16,
author = {Yair Bartal and
Arnold Filtser and
Ofer Neiman},
title = {On Notions of Distortion and an Almost Minimum Spanning Tree with
Constant Average Distortion},
journal = {CoRR},
volume = {abs/1609.08801},
year = {2016},
url = {http://arxiv.org/abs/1609.08801},
eprinttype = {arXiv},
eprint = {1609.08801},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BartalFN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbrahamBN15,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
title = {Local Embeddings of Metric Spaces},
journal = {Algorithmica},
volume = {72},
number = {2},
pages = {539--606},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9864-2},
doi = {10.1007/S00453-013-9864-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbrahamBN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KarpasNS15,
author = {Ilan Karpas and
Ofer Neiman and
Shakhar Smorodinsky},
title = {On vertex rankings of graphs and its relatives},
journal = {Discret. Math.},
volume = {338},
number = {8},
pages = {1460--1467},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.03.008},
doi = {10.1016/J.DISC.2015.03.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KarpasNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamBN15,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
title = {Embedding Metrics into Ultrametrics and Graphs into Spanning Trees
with Constant Average Distortion},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {1},
pages = {160--192},
year = {2015},
url = {https://doi.org/10.1137/120884390},
doi = {10.1137/120884390},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamBN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BartalGN15,
author = {Yair Bartal and
Lee{-}Ad Gottlieb and
Ofer Neiman},
title = {On the Impossibility of Dimension Reduction for Doubling Subsets of
{\(\mathscr{l}\)}\({}_{\mbox{p}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {3},
pages = {1207--1222},
year = {2015},
url = {https://doi.org/10.1137/140977655},
doi = {10.1137/140977655},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BartalGN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ElkinNS15,
author = {Michael Elkin and
Ofer Neiman and
Shay Solomon},
title = {Light Spanners},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {3},
pages = {1312--1321},
year = {2015},
url = {https://doi.org/10.1137/140979538},
doi = {10.1137/140979538},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ElkinNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ElkinFN15,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Terminal Embeddings},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {242--264},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.242},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.242},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ElkinFN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ElkinFN15,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Prioritized Metric Structures and Embedding},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {489--498},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746623},
doi = {10.1145/2746539.2746623},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ElkinFN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinFN15,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Prioritized Metric Structures and Embedding},
journal = {CoRR},
volume = {abs/1502.05543},
year = {2015},
url = {http://arxiv.org/abs/1502.05543},
eprinttype = {arXiv},
eprint = {1502.05543},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinFN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AbrahamBNS14,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman and
Leonard J. Schulman},
title = {Volume in General Metric Spaces},
journal = {Discret. Comput. Geom.},
volume = {52},
number = {2},
pages = {366--389},
year = {2014},
url = {https://doi.org/10.1007/s00454-014-9615-4},
doi = {10.1007/S00454-014-9615-4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AbrahamBNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BartalGN14,
author = {Yair Bartal and
Lee{-}Ad Gottlieb and
Ofer Neiman},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {On the Impossibility of Dimension Reduction for Doubling Subsets of
{\(\mathscr{l}\)}p},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {60},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582170},
doi = {10.1145/2582112.2582170},
timestamp = {Mon, 14 Jun 2021 16:39:30 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BartalGN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ElkinNS14,
author = {Michael Elkin and
Ofer Neiman and
Shay Solomon},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Light Spanners},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {442--452},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_37},
doi = {10.1007/978-3-662-43948-7\_37},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ElkinNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamGGNT14,
author = {Ittai Abraham and
Cyril Gavoille and
Anupam Gupta and
Ofer Neiman and
Kunal Talwar},
editor = {David B. Shmoys},
title = {Cops, robbers, and threatening skeletons: padded decomposition for
minor-free graphs},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {79--88},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591849},
doi = {10.1145/2591796.2591849},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamGGNT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinNS14,
author = {Michael Elkin and
Ofer Neiman and
Shay Solomon},
title = {Light Spanners},
journal = {CoRR},
volume = {abs/1404.7703},
year = {2014},
url = {http://arxiv.org/abs/1404.7703},
eprinttype = {arXiv},
eprint = {1404.7703},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElkinNW14,
author = {Michael Elkin and
Ofer Neiman and
Christian Wulff{-}Nilsen},
title = {Space-Efficient Path-Reporting Approximate Distance Oracles},
journal = {CoRR},
volume = {abs/1410.0768},
year = {2014},
url = {http://arxiv.org/abs/1410.0768},
eprinttype = {arXiv},
eprint = {1410.0768},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElkinNW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BartalCMN13,
author = {Yair Bartal and
Douglas E. Carroll and
Adam Meyerson and
Ofer Neiman},
title = {Bandwidth and low dimensional embedding},
journal = {Theor. Comput. Sci.},
volume = {500},
pages = {44--56},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.05.038},
doi = {10.1016/J.TCS.2013.05.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BartalCMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NeimanS13,
author = {Ofer Neiman and
Shay Solomon},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Simple deterministic algorithms for fully dynamic maximal matching},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {745--754},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488703},
doi = {10.1145/2488608.2488703},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NeimanS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Neiman13,
author = {Ofer Neiman},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {Low Dimensional Embeddings of Doubling Metrics},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {12--23},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_2},
doi = {10.1007/978-3-319-08001-7\_2},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Neiman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BartalGN13,
author = {Yair Bartal and
Lee{-}Ad Gottlieb and
Ofer Neiman},
title = {On the Impossibility of Dimension Reduction for Doubling Subsets of
{\(\mathscr{l}\)}\({}_{\mbox{p}}\), p{\textgreater}2},
journal = {CoRR},
volume = {abs/1308.4996},
year = {2013},
url = {http://arxiv.org/abs/1308.4996},
eprinttype = {arXiv},
eprint = {1308.4996},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BartalGN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbrahamGGNT13,
author = {Ittai Abraham and
Cyril Gavoille and
Anupam Gupta and
Ofer Neiman and
Kunal Talwar},
title = {Cops, Robbers, and Threatening Skeletons: Padded Decomposition for
Minor-Free Graphs},
journal = {CoRR},
volume = {abs/1311.3048},
year = {2013},
url = {http://arxiv.org/abs/1311.3048},
eprinttype = {arXiv},
eprint = {1311.3048},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbrahamGGNT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NewmanNN12,
author = {Alantha Newman and
Ofer Neiman and
Aleksandar Nikolov},
title = {Beck's Three Permutations Conjecture: {A} Counterexample and Some
Consequences},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {253--262},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.84},
doi = {10.1109/FOCS.2012.84},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NewmanNN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamN12,
author = {Ittai Abraham and
Ofer Neiman},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Using petal-decompositions to build a low stretch spanning tree},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {395--406},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214015},
doi = {10.1145/2213977.2214015},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-1277,
author = {Ofer Neiman and
Shay Solomon},
title = {Deterministic Algorithms for Fully Dynamic Maximal Matching},
journal = {CoRR},
volume = {abs/1207.1277},
year = {2012},
url = {http://arxiv.org/abs/1207.1277},
eprinttype = {arXiv},
eprint = {1207.1277},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-1277.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BartalCMN11,
author = {Yair Bartal and
Douglas E. Carroll and
Adam Meyerson and
Ofer Neiman},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Bandwidth and Low Dimensional Embedding},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {50--61},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_5},
doi = {10.1007/978-3-642-22935-0\_5},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BartalCMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniCNN11,
author = {Alexandr Andoni and
Moses Charikar and
Ofer Neiman and
Huy L. Nguyen},
editor = {Rafail Ostrovsky},
title = {Near Linear Lower Bound for Dimension Reduction in {L1}},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {315--323},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.87},
doi = {10.1109/FOCS.2011.87},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AndoniCNN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BergerFNR11,
author = {Noam Berger and
Michal Feldman and
Ofer Neiman and
Mishael Rosenthal},
editor = {Giuseppe Persiano},
title = {Dynamic Inefficiency: Anarchy without Stability},
booktitle = {Algorithmic Game Theory, 4th International Symposium, {SAGT} 2011,
Amalfi, Italy, October 17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6982},
pages = {57--68},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24829-0\_7},
doi = {10.1007/978-3-642-24829-0\_7},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/BergerFNR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AbrahamBNS10,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman and
Leonard J. Schulman},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Volume in General Metric Spaces},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6347},
pages = {87--99},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15781-3\_8},
doi = {10.1007/978-3-642-15781-3\_8},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AbrahamBNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Neiman09,
author = {Ofer Neiman},
title = {A novel approach to embedding of metric spaces ({\unicode{1490}}{\unicode{1497}}{\unicode{1513}}{\unicode{1492}}
{\unicode{1495}}{\unicode{1491}}{\unicode{1513}}{\unicode{1492}} {\unicode{1500}}{\unicode{1513}}{\unicode{1497}}{\unicode{1499}}{\unicode{1493}}{\unicode{1504}}{\unicode{1497}}{\unicode{1501}}
{\unicode{1513}}{\unicode{1500}} {\unicode{1502}}{\unicode{1512}}{\unicode{1495}}{\unicode{1489}}{\unicode{1497}}{\unicode{1501}}
{\unicode{1502}}{\unicode{1496}}{\unicode{1512}}{\unicode{1497}}{\unicode{1497}}{\unicode{1501}}.)},
school = {Hebrew University of Jerusalem, Israel},
year = {2009},
url = {https://huji-primo.hosted.exlibrisgroup.com/permalink/f/13ns5ae/972HUJI\_ALMA21167806220003701},
timestamp = {Wed, 14 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Neiman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbrahamBN09,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
editor = {Claire Mathieu},
title = {On low dimensional local embeddings},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {875--884},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.95},
doi = {10.1137/1.9781611973068.95},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbrahamBN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbrahamBN08,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
title = {Nearly Tight Low Stretch Spanning Trees},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {781--790},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.62},
doi = {10.1109/FOCS.2008.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbrahamBN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbrahamBN08,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
editor = {Shang{-}Hua Teng},
title = {Embedding metric spaces in their intrinsic dimension},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {363--372},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347122},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AbrahamBN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0808-2017,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
title = {Nearly Tight Low Stretch Spanning Trees},
journal = {CoRR},
volume = {abs/0808.2017},
year = {2008},
url = {http://arxiv.org/abs/0808.2017},
eprinttype = {arXiv},
eprint = {0808.2017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0808-2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbrahamBN07,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Embedding metrics into ultrametrics and graphs into spanning trees
with constant average distortion},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {502--511},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283437},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/AbrahamBN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamBN07,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
editor = {David S. Johnson and
Uriel Feige},
title = {Local embeddings of metric spaces},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {631--640},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250883},
doi = {10.1145/1250790.1250883},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamBN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamBN06,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
editor = {Jon M. Kleinberg},
title = {Advances in metric embedding theory},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {271--286},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132557},
doi = {10.1145/1132516.1132557},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamBN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0610003,
author = {Ittai Abraham and
Yair Bartal and
Ofer Neiman},
title = {Embedding Metrics into Ultrametrics and Graphs into Spanning Trees
with Constant Average Distortion},
journal = {CoRR},
volume = {abs/cs/0610003},
year = {2006},
url = {http://arxiv.org/abs/cs/0610003},
eprinttype = {arXiv},
eprint = {cs/0610003},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0610003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbrahamBCDGKNS05,
author = {Ittai Abraham and
Yair Bartal and
T.{-}H. Hubert Chan and
Kedar Dhamdhere and
Anupam Gupta and
Jon M. Kleinberg and
Ofer Neiman and
Aleksandrs Slivkins},
title = {Metric Embeddings with Relaxed Guarantees},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {83--100},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.51},
doi = {10.1109/SFCS.2005.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbrahamBCDGKNS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-01-25 19:54 CET 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:
