Ofer Neiman - RankMe

107 papers A* 29A 5B 4Journal 61Unranked 6

Year	Rank	Type	Title / Venue / Authors
2024	A*	`conf`	Light, Reliable Spanners. SoCG Arnold Filtser, Yuval Gitlitz, Ofer Neiman
2024	B	`conf`	Lightweight Near-Additive Spanners. WG Yuval Gitlitz, Ofer Neiman, Richard Spence
2024	J	`jnl`	Lightweight Near-Additive Spanners. CoRR Yuval Gitlitz, Ofer Neiman, Richard Spence
2024	A	`conf`	On the Size Overhead of Pairwise Spanners. ITCS Ofer Neiman, Idan Shabat
2024	—	`conf`	Path-Reporting Distance Oracles with Linear Size. SWAT Ofer Neiman, Idan Shabat
2024	J	`jnl`	Path-Reporting Distance Oracles with Linear Size. CoRR Ofer Neiman, Idan Shabat
2023	J	`jnl`	Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2023	J	`jnl`	Improved weighted additive spanners. Distributed Comput. Michael Elkin, Yuval Gitlitz, Ofer Neiman
2023	J	`jnl`	Light, Reliable Spanners. CoRR Arnold Filtser, Yuval Gitlitz, Ofer Neiman
2023	J	`jnl`	On the Size Overhead of Pairwise Spanners. CoRR Ofer Neiman, Idan Shabat
2022	A	`conf`	A Unified Framework for Hopsets. ESA Ofer Neiman, Idan Shabat
2022	—	`conf`	Almost Shortest Paths with Near-Additive Error in Weighted Graphs. SWAT Michael Elkin, Yuval Gitlitz, Ofer Neiman
2022	A	`conf`	Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. STACS Michael Elkin, Ofer Neiman
2022	J	`jnl`	Covering metric spaces by few trees. J. Comput. Syst. Sci. Yair Bartal, Ora Nova Fandina, Ofer Neiman
2022	J	`jnl`	Distributed strong diameter network decomposition. Theor. Comput. Sci. Michael Elkin, Ofer Neiman
2022	J	`jnl`	Light Spanners for High Dimensional Norms via Stochastic Decompositions. Algorithmica Arnold Filtser, Ofer Neiman
2022	J	`jnl`	Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC. Distributed Comput. Michael Elkin, Ofer Neiman
2022	J	`jnl`	Lossless Prioritized Embeddings. SIAM J. Discret. Math. Michael Elkin, Ofer Neiman
2022	J	`jnl`	Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2021	J	`jnl`	A Unified Framework for Hopsets and Spanners. CoRR Idan Shabat, Ofer Neiman
2021	A	`conf`	Improved Weighted Additive Spanners. DISC Michael Elkin, Yuval Gitlitz, Ofer Neiman
2021	J	`jnl`	Near Isometric Terminal Embeddings for Doubling Metrics. Algorithmica Michael Elkin, Ofer Neiman
2020	J	`jnl`	Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication. CoRR Michael Elkin, Ofer Neiman
2020	A*	`conf`	Distributed Construction of Light Networks. PODC Michael Elkin, Arnold Filtser, Ofer Neiman
2020	J	`jnl`	Improved Weighted Additive Spanners. CoRR Michael Elkin, Yuval Gitlitz, Ofer Neiman
2020	A*	`conf`	Lossless Prioritized Embeddings. SODA Michael Elkin, Ofer Neiman
2020	J	`jnl`	Near-Additive Spanners and Near-Exact Hopsets, A Unified View. CoRR Michael Elkin, Ofer Neiman
2020	J	`jnl`	Near-Additive Spanners and Near-Exact Hopsets, A Unified View. Bull. EATCS Michael Elkin, Ofer Neiman
2020	J	`jnl`	Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2019	J	`jnl`	Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs. CoRR Michael Elkin, Yuval Gitlitz, Ofer Neiman
2019	J	`jnl`	Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2019	A*	`conf`	Covering Metric Spaces by Few Trees. ICALP Yair Bartal, Nova Fandina, Ofer Neiman
2019	J	`jnl`	Covering Metric Spaces by Few Trees. CoRR Yair Bartal, Nova Fandina, Ofer Neiman
2019	A*	`conf`	Dimensionality reduction: theoretical perspective on practical measures. NeurIPS Yair Bartal, Nova Fandina, Ofer Neiman
2019	J	`jnl`	Distributed Construction of Light Networks. CoRR Michael Elkin, Arnold Filtser, Ofer Neiman
2019	J	`jnl`	Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. ACM Trans. Algorithms Michael Elkin, Ofer Neiman
2019	J	`jnl`	Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. SIAM J. Comput. Michael Elkin, Ofer Neiman
2019	B	`conf`	Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC. SPAA Michael Elkin, Ofer Neiman
2019	J	`jnl`	Lossless Prioritized Embeddings. CoRR Michael Elkin, Ofer Neiman
2019	J	`jnl`	On notions of distortion and an almost minimum spanning tree with constant average distortion. J. Comput. Syst. Sci. Yair Bartal, Arnold Filtser, Ofer Neiman
2019	J	`jnl`	Using Petal-Decompositions to Build a Low Stretch Spanning Tree. SIAM J. Comput. Ittai Abraham, Ofer Neiman
2018	A	`conf`	Light Spanners for High Dimensional Norms via Stochastic Decompositions. ESA Arnold Filtser, Ofer Neiman
2018	J	`jnl`	Light Spanners for High Dimensional Norms via Stochastic Decompositions. CoRR Arnold Filtser, Ofer Neiman
2018	A*	`conf`	Metric embedding via shortest path decompositions. STOC Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2018	A*	`conf`	Near Isometric Terminal Embeddings for Doubling Metrics. SoCG Michael Elkin, Ofer Neiman
2018	J	`jnl`	Near Isometric Terminal Embeddings for Doubling Metrics. CoRR Michael Elkin, Ofer Neiman
2018	A*	`conf`	Near-Optimal Distributed Routing with Low Memory. PODC Michael Elkin, Ofer Neiman
2018	J	`jnl`	On efficient distributed construction of near optimal routing schemes. Distributed Comput. Michael Elkin, Ofer Neiman
2018	J	`jnl`	Prioritized Metric Structures and Embedding. SIAM J. Comput. Michael Elkin, Arnold Filtser, Ofer Neiman
2018	A*	`conf`	Ramsey Spanning Trees and their Applications. SODA Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2017	A*	`conf`	Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. SODA Michael Elkin, Ofer Neiman
2017	J	`jnl`	Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory. CoRR Michael Elkin, Ofer Neiman
2017	J	`jnl`	Metric Embedding via Shortest Path Decompositions. CoRR Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2017	J	`jnl`	Ramsey Spanning Trees and their Applications. CoRR Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2017	J	`jnl`	Terminal embeddings. Theor. Comput. Sci. Michael Elkin, Arnold Filtser, Ofer Neiman
2016	J	`jnl`	Distributed Strong Diameter Network Decomposition. CoRR Michael Elkin, Ofer Neiman
2016	A*	`conf`	Distributed Strong Diameter Network Decomposition: Extended Abstract. PODC Michael Elkin, Ofer Neiman
2016	J	`jnl`	Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. CoRR Michael Elkin, Ofer Neiman
2016	A*	`conf`	Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. FOCS Michael Elkin, Ofer Neiman
2016	J	`jnl`	Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. CoRR Michael Elkin, Ofer Neiman
2016	A*	`conf`	Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost. ICALP Alexandr Andoni, Assaf Naor, Ofer Neiman
2016	J	`jnl`	Low Dimensional Embeddings of Doubling Metrics. Theory Comput. Syst. Ofer Neiman
2016	J	`jnl`	On Efficient Distributed Construction of Near Optimal Routing Schemes. CoRR Michael Elkin, Ofer Neiman
2016	A*	`conf`	On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract. PODC Michael Elkin, Ofer Neiman
2016	A*	`conf`	On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. SODA Yair Bartal, Arnold Filtser, Ofer Neiman
2016	J	`jnl`	On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. CoRR Yair Bartal, Arnold Filtser, Ofer Neiman
2016	J	`jnl`	On Vertex Rankings of Graphs and its Relatives. CoRR Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
2016	J	`jnl`	Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms Ofer Neiman, Shay Solomon
2016	J	`jnl`	Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci. Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen
2016	—	`ch.`	Spanning Trees with Low Average Stretch. Encyclopedia of Algorithms Ittai Abraham, Ofer Neiman
2016	J	`jnl`	Terminal Embeddings. CoRR Michael Elkin, Arnold Filtser, Ofer Neiman
2015	J	`jnl`	Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. SIAM J. Comput. Ittai Abraham, Yair Bartal, Ofer Neiman
2015	J	`jnl`	Light Spanners. SIAM J. Discret. Math. Michael Elkin, Ofer Neiman, Shay Solomon
2015	J	`jnl`	Local Embeddings of Metric Spaces. Algorithmica Ittai Abraham, Yair Bartal, Ofer Neiman
2015	J	`jnl`	On the Impossibility of Dimension Reduction for Doubling Subsets of ℓ SIAM J. Discret. Math. Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman
2015	J	`jnl`	On vertex rankings of graphs and its relatives. Discret. Math. Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
2015	A*	`conf`	Prioritized Metric Structures and Embedding. STOC Michael Elkin, Arnold Filtser, Ofer Neiman
2015	J	`jnl`	Prioritized Metric Structures and Embedding. CoRR Michael Elkin, Arnold Filtser, Ofer Neiman
2015	—	`conf`	Terminal Embeddings. APPROX-RANDOM Michael Elkin, Arnold Filtser, Ofer Neiman
2014	A*	`conf`	Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2014	—	`conf`	Light Spanners. ICALP (1) Michael Elkin, Ofer Neiman, Shay Solomon
2014	J	`jnl`	Light Spanners. CoRR Michael Elkin, Ofer Neiman, Shay Solomon
2014	A*	`conf`	On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SoCG Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman
2014	J	`jnl`	Space-Efficient Path-Reporting Approximate Distance Oracles. CoRR Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen
2014	J	`jnl`	Volume in General Metric Spaces. Discret. Comput. Geom. Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
2013	J	`jnl`	Bandwidth and low dimensional embedding. Theor. Comput. Sci. Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman
2013	J	`jnl`	Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2013	B	`conf`	Low Dimensional Embeddings of Doubling Metrics. WAOA Ofer Neiman
2013	J	`jnl`	On the Impossibility of Dimension Reduction for Doubling Subsets of ℓ CoRR Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman
2013	A*	`conf`	Simple deterministic algorithms for fully dynamic maximal matching. STOC Ofer Neiman, Shay Solomon
2012	A*	`conf`	Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS Alantha Newman, Ofer Neiman, Aleksandar Nikolov
2012	J	`jnl`	Deterministic Algorithms for Fully Dynamic Maximal Matching CoRR Ofer Neiman, Shay Solomon
2012	A*	`conf`	Using petal-decompositions to build a low stretch spanning tree. STOC Ittai Abraham, Ofer Neiman
2011	—	`conf`	Bandwidth and Low Dimensional Embedding. APPROX-RANDOM Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman
2011	B	`conf`	Dynamic Inefficiency: Anarchy without Stability. SAGT Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal
2011	A*	`conf`	Near Linear Lower Bound for Dimension Reduction in L1. FOCS Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen
2010	—	`conf`	Volume in General Metric Spaces. ESA (2) Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
2009	—	`—`	A novel approach to embedding of metric spaces (גישה חדשה לשיכונים של מרחבים מטריים.). Ofer Neiman
2009	A*	`conf`	On low dimensional local embeddings. SODA Ittai Abraham, Yair Bartal, Ofer Neiman
2008	A*	`conf`	Embedding metric spaces in their intrinsic dimension. SODA Ittai Abraham, Yair Bartal, Ofer Neiman
2008	J	`jnl`	Nearly Tight Low Stretch Spanning Trees CoRR Ittai Abraham, Yair Bartal, Ofer Neiman
2008	A*	`conf`	Nearly Tight Low Stretch Spanning Trees. FOCS Ittai Abraham, Yair Bartal, Ofer Neiman
2007	A*	`conf`	Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA Ittai Abraham, Yair Bartal, Ofer Neiman
2007	A*	`conf`	Local embeddings of metric spaces. STOC Ittai Abraham, Yair Bartal, Ofer Neiman
2006	A*	`conf`	Advances in metric embedding theory. STOC Ittai Abraham, Yair Bartal, Ofer Neiman
2006	J	`jnl`	Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion CoRR Ittai Abraham, Yair Bartal, Ofer Neiman
2005	A*	`conf`	Metric Embeddings with Relaxed Guarantees. FOCS Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins