Остановите войну!
for scientists:
default search action
Ofer Neiman
- > Home > Persons > Ofer Neiman
Publications
- 2023
- [j29]Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Improved weighted additive spanners. Distributed Comput. 36(3): 385-394 (2023) - 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) - [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) - [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 - 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) - 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) - [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) - [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 - [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 - [i20]Michael Elkin, Ofer Neiman:
Near Isometric Terminal Embeddings for Doubling Metrics. CoRR abs/1802.07967 (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) - 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 - [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 - [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) - 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
- [c17]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. ICALP (1) 2014: 442-452 - [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)
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-01-25 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint