I agree that this site is using cookies. You can find further informations here.
X
Neiman, Ofer
105  results:
Search for persons X
?
1

Corrigendum: Metric Embedding via Shortest Path Decompositi..:

Abraham, Ittai ; Filtser, Arnold ; Gupta, Anupam.
SIAM Journal on Computing.  52 (2023)  5 - p. 1319-1320 , 2023
Link: https://doi.org/10.1137/..
 
?
2

Covering metric spaces by few trees:

Bartal, Yair ; Fandina, Ora Nova ; Neiman, Ofer
Journal of Computer and System Sciences.  130 (2022)  - p. 26-42 , 2022
Link: https://doi.org/10.1016/..
 
?
3

Lossless Prioritized Embeddings:

Elkin, Michael ; Neiman, Ofer
SIAM Journal on Discrete Mathematics.  36 (2022)  3 - p. 1529-1550 , 2022
Link: https://doi.org/10.1137/..
 
?
4

Distributed strong diameter network decomposition:

Elkin, Michael ; Neiman, Ofer
Theoretical Computer Science.  922 (2022)  - p. 150-157 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Metric Embedding via Shortest Path Decompositions:

Abraham, Ittai ; Filtser, Arnold ; Gupta, Anupam.
SIAM Journal on Computing.  51 (2022)  2 - p. 290-314 , 2022
Link: https://doi.org/10.1137/..
 
?
6

Linear-Size hopsets with small hopbound, and constant-hopbo..:

Elkin, Michael ; Neiman, Ofer
Distributed Computing.  35 (2022)  5 - p. 419-437 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Improved weighted additive spanners:

Elkin, Michael ; Gitlitz, Yuval ; Neiman, Ofer
Distributed Computing.  36 (2022)  3 - p. 385-394 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Light Spanners for High Dimensional Norms via Stochastic De..:

Filtser, Arnold ; Neiman, Ofer
Algorithmica.  84 (2022)  10 - p. 2987-3007 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Near Isometric Terminal Embeddings for Doubling Metrics:

Elkin, Michael ; Neiman, Ofer
Algorithmica.  83 (2021)  11 - p. 3319-3337 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Ramsey Spanning Trees and Their Applications:

Abraham, Ittai ; Chechik, Shiri ; Elkin, Michael..
ACM Transactions on Algorithms.  16 (2020)  2 - p. 1-21 , 2020
Link: https://doi.org/10.1145/..
 
?
11

Lossless prioritized embeddings:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Elkin, Michael ; Neiman, Ofer - p. 1049-1062 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Ramsey Spanning Trees and Their Applications:

Abraham, Ittai ; Chechik, Shiri ; Elkin, Michael..
ACM Transactions on Algorithms (TALG).  16 (2020)  2 - p. 1-21 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

Distributed Construction of Light Networks:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Elkin, Michael ; Filtser, Arnold ; Neiman, Ofer - p. 483-492 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Linear-Size Hopsets with Small Hopbound, and Constant-Hopbo..:

, In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures,
Elkin, Michael ; Neiman, Ofer - p. 333-341 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

Using Petal-Decompositions to Build a Low Stretch Spanning ..:

Abraham, Ittai ; Neiman, Ofer
SIAM Journal on Computing.  48 (2019)  2 - p. 227-248 , 2019
Link: https://doi.org/10.1137/..
 
1-15