default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOfer Neiman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c43]Arnold Filtser, Yuval Gitlitz, Ofer Neiman:
Light, Reliable Spanners. SoCG 2024: 56:1-56:15- [c42]Ofer Neiman, Idan Shabat:
On the Size Overhead of Pairwise Spanners. ITCS 2024: 83:1-83:22 - [c41]Ofer Neiman, Idan Shabat:
Path-Reporting Distance Oracles with Linear Size. SWAT 2024: 36:1-36:16 - [i31]Ofer Neiman, Idan Shabat:
Path-Reporting Distance Oracles with Linear Size. CoRR abs/2405.14254 (2024) - 2023
- [j29]Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Improved weighted additive spanners. Distributed Comput. 36(3): 385-394 (2023) - [j28]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52(5): 1319-1320 (2023) - [i30]Arnold Filtser, Yuval Gitlitz, Ofer Neiman:
Light, Reliable Spanners. CoRR abs/2307.16612 (2023) - [i29]Ofer Neiman, Idan Shabat:
On the Size Overhead of Pairwise Spanners. CoRR abs/2311.13673 (2023) - 2022
- [j27]Arnold Filtser
, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. Algorithmica 84(10): 2987-3007 (2022) - [j26]Michael Elkin, Ofer Neiman:
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC. Distributed Comput. 35(5): 419-437 (2022) - [j25]Yair Bartal, Ora Nova Fandina, Ofer Neiman:
Covering metric spaces by few trees. J. Comput. Syst. Sci. 130: 26-42 (2022) - [j24]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 51(2): 290-314 (2022) - [j23]Michael Elkin, Ofer Neiman:
Lossless Prioritized Embeddings. SIAM J. Discret. Math. 36(3): 1529-1550 (2022) - [j22]Michael Elkin, Ofer Neiman:
Distributed strong diameter network decomposition. Theor. Comput. Sci. 922: 150-157 (2022) - [c40]Ofer Neiman, Idan Shabat:
A Unified Framework for Hopsets. ESA 2022: 81:1-81:13 - [c39]Michael Elkin, Ofer Neiman:
Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. STACS 2022: 27:1-27:22 - [c38]Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Almost Shortest Paths with Near-Additive Error in Weighted Graphs. SWAT 2022: 23:1-23:22 - 2021
- [j21]Michael Elkin, Ofer Neiman:
Near Isometric Terminal Embeddings for Doubling Metrics. Algorithmica 83(11): 3319-3337 (2021) - [c37]Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Improved Weighted Additive Spanners. DISC 2021: 21:1-21:15 - [i28]Idan Shabat, Ofer Neiman:
A Unified Framework for Hopsets and Spanners. CoRR abs/2108.09673 (2021) - 2020
- [j20]Michael Elkin, Ofer Neiman:
Near-Additive Spanners and Near-Exact Hopsets, A Unified View. Bull. EATCS 130 (2020) - [j19]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) - [c36]Michael Elkin, Arnold Filtser, Ofer Neiman:
Distributed Construction of Light Networks. PODC 2020: 483-492 - [c35]Michael Elkin, Ofer Neiman:
Lossless Prioritized Embeddings. SODA 2020: 1049-1062 - [i27]Michael Elkin, Ofer Neiman:
Near-Additive Spanners and Near-Exact Hopsets, A Unified View. CoRR abs/2001.07477 (2020) - [i26]Michael Elkin, Ofer Neiman:
Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication. CoRR abs/2004.07572 (2020) - [i25]Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Improved Weighted Additive Spanners. CoRR abs/2008.09877 (2020)
2010 – 2019
- 2019
- [j18]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) - [j17]Ittai Abraham, Ofer Neiman:
Using Petal-Decompositions to Build a Low Stretch Spanning Tree. SIAM J. Comput. 48(2): 227-248 (2019) - [j16]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. 48(3): 1120-1145 (2019) - [j15]Michael Elkin, Ofer Neiman:
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. SIAM J. Comput. 48(4): 1436-1480 (2019) - [j14]Michael Elkin, Ofer Neiman:
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. ACM Trans. Algorithms 15(1): 4:1-4:29 (2019) - [c34]Yair Bartal, Nova Fandina, Ofer Neiman:
Covering Metric Spaces by Few Trees. ICALP 2019: 20:1-20:16 - [c33]Yair Bartal, Nova Fandina, Ofer Neiman:
Dimensionality reduction: theoretical perspective on practical measures. NeurIPS 2019: 10576-10588 - [c32]Michael Elkin, Ofer Neiman:
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC. SPAA 2019: 333-341 - [i24]Michael Elkin, Arnold Filtser, Ofer Neiman:
Distributed Construction of Light Networks. CoRR abs/1905.02592 (2019) - [i23]Yair Bartal, Nova Fandina, Ofer Neiman:
Covering Metric Spaces by Few Trees. CoRR abs/1905.07559 (2019) - [i22]Michael Elkin, Ofer Neiman:
Lossless Prioritized Embeddings. CoRR abs/1907.06983 (2019) - [i21]Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs. CoRR abs/1907.11422 (2019) - 2018
- [j13]Michael Elkin, Ofer Neiman:
On efficient distributed construction of near optimal routing schemes. Distributed Comput. 31(2): 119-137 (2018) - [j12]Michael Elkin, Arnold Filtser, Ofer Neiman:
Prioritized Metric Structures and Embedding. SIAM J. Comput. 47(3): 829-858 (2018) - [c31]Michael Elkin, Ofer Neiman:
Near Isometric Terminal Embeddings for Doubling Metrics. SoCG 2018: 36:1-36:15 - [c30]Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. ESA 2018: 29:1-29:15 - [c29]Michael Elkin, Ofer Neiman:
Near-Optimal Distributed Routing with Low Memory. PODC 2018: 207-216 - [c28]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. SODA 2018: 1650-1664 - [c27]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric embedding via shortest path decompositions. STOC 2018: 952-963 - [i20]Michael Elkin, Ofer Neiman:
Near Isometric Terminal Embeddings for Doubling Metrics. CoRR abs/1802.07967 (2018) - [i19]Arnold Filtser, Ofer Neiman:
Light Spanners for High Dimensional Norms via Stochastic Decompositions. CoRR abs/1804.07456 (2018) - 2017
- [j11]Michael Elkin, Arnold Filtser, Ofer Neiman:
Terminal embeddings. Theor. Comput. Sci. 697: 1-36 (2017) - [c26]Michael Elkin, Ofer Neiman:
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. SODA 2017: 652-669 - [i18]Michael Elkin, Ofer Neiman:
Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory. CoRR abs/1704.08468 (2017) - [i17]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. CoRR abs/1707.08769 (2017) - [i16]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric Embedding via Shortest Path Decompositions. CoRR abs/1708.04073 (2017) - 2016
- [j10]Ofer Neiman:
Low Dimensional Embeddings of Doubling Metrics. Theory Comput. Syst. 58(1): 133-152 (2016) - [j9]Ofer Neiman, Shay Solomon:
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms 12(1): 7:1-7:15 (2016) - [j8]Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen:
Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci. 651: 1-10 (2016) - [c25]Michael Elkin, Ofer Neiman:
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. FOCS 2016: 128-137 - [c24]Alexandr Andoni, Assaf Naor, Ofer Neiman:
Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost. ICALP 2016: 83:1-83:14 - [c23]Michael Elkin, Ofer Neiman:
Distributed Strong Diameter Network Decomposition: Extended Abstract. PODC 2016: 211-216 - [c22]Michael Elkin, Ofer Neiman:
On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract. PODC 2016: 235-244 - [c21]Yair Bartal, Arnold Filtser, Ofer Neiman:
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. SODA 2016: 873-882 - [r1]Ittai Abraham, Ofer Neiman:
Spanning Trees with Low Average Stretch. Encyclopedia of Algorithms 2016: 2032-2035 - [i15]Michael Elkin, Ofer Neiman:
On Efficient Distributed Construction of Near Optimal Routing Schemes. CoRR abs/1602.02293 (2016) - [i14]Michael Elkin, Ofer Neiman:
Distributed Strong Diameter Network Decomposition. CoRR abs/1602.05437 (2016) - [i13]Michael Elkin, Arnold Filtser, Ofer Neiman:
Terminal Embeddings. CoRR abs/1603.02321 (2016) - [i12]Michael Elkin, Ofer Neiman:
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. CoRR abs/1605.04538 (2016) - [i11]Michael Elkin, Ofer Neiman:
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. CoRR abs/1607.08337 (2016) - [i10]Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky:
On Vertex Rankings of Graphs and its Relatives. CoRR abs/1609.06111 (2016) - [i9]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
- [j7]Ittai Abraham, Yair Bartal, Ofer Neiman:
Local Embeddings of Metric Spaces. Algorithmica 72(2): 539-606 (2015) - [j6]Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky:
On vertex rankings of graphs and its relatives. Discret. Math. 338(8): 1460-1467 (2015) - [j5]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. SIAM J. Comput. 44(1): 160-192 (2015) - [j4]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SIAM J. Discret. Math. 29(3): 1207-1222 (2015) - [j3]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. SIAM J. Discret. Math. 29(3): 1312-1321 (2015) - [c20]Michael Elkin, Arnold Filtser, Ofer Neiman:
Terminal Embeddings. APPROX-RANDOM 2015: 242-264 - [c19]Michael Elkin, Arnold Filtser, Ofer Neiman:
Prioritized Metric Structures and Embedding. STOC 2015: 489-498 - [i8]Michael Elkin, Arnold Filtser, Ofer Neiman:
Prioritized Metric Structures and Embedding. CoRR abs/1502.05543 (2015) - 2014
- [j2]Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. Discret. Comput. Geom. 52(2): 366-389 (2014) - [c18]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SoCG 2014: 60 - [c17]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. ICALP (1) 2014: 442-452 - [c16]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC 2014: 79-88 - [i7]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. CoRR abs/1404.7703 (2014) - [i6]Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen:
Space-Efficient Path-Reporting Approximate Distance Oracles. CoRR abs/1410.0768 (2014) - 2013
- [j1]Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and low dimensional embedding. Theor. Comput. Sci. 500: 44-56 (2013) - [c15]Ofer Neiman, Shay Solomon:
Simple deterministic algorithms for fully dynamic maximal matching. STOC 2013: 745-754 - [c14]Ofer Neiman:
Low Dimensional Embeddings of Doubling Metrics. WAOA 2013: 12-23 - [i5]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2. CoRR abs/1308.4996 (2013) - [i4]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR abs/1311.3048 (2013) - 2012
- [c13]Alantha Newman, Ofer Neiman, Aleksandar Nikolov:
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS 2012: 253-262 - [c12]Ittai Abraham, Ofer Neiman:
Using petal-decompositions to build a low stretch spanning tree. STOC 2012: 395-406 - [i3]Ofer Neiman, Shay Solomon:
Deterministic Algorithms for Fully Dynamic Maximal Matching. CoRR abs/1207.1277 (2012) - 2011
- [c11]Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and Low Dimensional Embedding. APPROX-RANDOM 2011: 50-61 - [c10]Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen:
Near Linear Lower Bound for Dimension Reduction in L1. FOCS 2011: 315-323 - [c9]Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal:
Dynamic Inefficiency: Anarchy without Stability. SAGT 2011: 57-68 - 2010
- [c8]Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. ESA (2) 2010: 87-99
2000 – 2009
- 2009
- [b1]Ofer Neiman:
A novel approach to embedding of metric spaces (גישה חדשה לשיכונים של מרחבים מטריים.). Hebrew University of Jerusalem, Israel, 2009 - [c7]Ittai Abraham, Yair Bartal, Ofer Neiman:
On low dimensional local embeddings. SODA 2009: 875-884 - 2008
- [c6]Ittai Abraham, Yair Bartal, Ofer Neiman:
Nearly Tight Low Stretch Spanning Trees. FOCS 2008: 781-790 - [c5]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metric spaces in their intrinsic dimension. SODA 2008: 363-372 - [i2]Ittai Abraham, Yair Bartal, Ofer Neiman:
Nearly Tight Low Stretch Spanning Trees. CoRR abs/0808.2017 (2008) - 2007
- [c4]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA 2007: 502-511 - [c3]Ittai Abraham, Yair Bartal, Ofer Neiman:
Local embeddings of metric spaces. STOC 2007: 631-640 - 2006
- [c2]Ittai Abraham, Yair Bartal, Ofer Neiman:
Advances in metric embedding theory. STOC 2006: 271-286 - [i1]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. CoRR abs/cs/0610003 (2006) - 2005
- [c1]Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100
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-06-20 21:31 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:
