Ofer Neiman

Richard Spence

CoRR, 2024

Path-Reporting Distance Oracles with Linear Size.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

On the Size Overhead of Pairwise Spanners.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Light, Reliable Spanners.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Corrigendum: Metric Embedding via Shortest Path Decompositions.

[BibT_eX]

[DOI]

SIAM J. Comput., October, 2023

Improved weighted additive spanners.

[BibT_eX]

[DOI]

Distributed Comput., September, 2023

2022

Distributed strong diameter network decomposition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Lossless Prioritized Embeddings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Metric Embedding via Shortest Path Decompositions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Covering metric spaces by few trees.

[BibT_eX]

[DOI]

Ora Nova Fandina

J. Comput. Syst. Sci., 2022

Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Light Spanners for High Dimensional Norms via Stochastic Decompositions.

[BibT_eX]

[DOI]

Algorithmica, 2022

Almost Shortest Paths with Near-Additive Error in Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

A Unified Framework for Hopsets.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A Unified Framework for Hopsets and Spanners.

[BibT_eX]

[DOI]

CoRR, 2021

Near Isometric Terminal Embeddings for Doubling Metrics.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Ramsey Spanning Trees and Their Applications.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Near-Additive Spanners and Near-Exact Hopsets, A Unified View.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication.

[BibT_eX]

[DOI]

CoRR, 2020

Distributed Construction of Light Networks.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Efficient Algorithms for Constructing Very Sparse Spanners and Emulators.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

On notions of distortion and an almost minimum spanning tree with constant average distortion.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Dimensionality reduction: theoretical perspective on practical measures.

[BibT_eX]

[DOI]

Nova Fandina

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Prioritized Metric Structures and Embedding.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

On efficient distributed construction of near optimal routing schemes.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Near-Optimal Distributed Routing with Low Memory.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Terminal embeddings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Spanning Trees with Low Average Stretch.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Space-efficient path-reporting approximate distance oracles.

[BibT_eX]

[DOI]

Christian Wulff-Nilsen

Theor. Comput. Sci., 2016

Simple Deterministic Algorithms for Fully Dynamic Maximal Matching.

[BibT_eX]

[DOI]

Shay Solomon

ACM Trans. Algorithms, 2016

Low Dimensional Embeddings of Doubling Metrics.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Distributed Strong Diameter Network Decomposition: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost.

[BibT_eX]

[DOI]

Alexandr Andoni

Assaf Naor

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Light Spanners.

[BibT_eX]

[DOI]

Shay Solomon

SIAM J. Discret. Math., 2015

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓ<sub>p</sub>.

[BibT_eX]

[DOI]

Lee-Ad Gottlieb

SIAM J. Discret. Math., 2015

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

On vertex rankings of graphs and its relatives.

[BibT_eX]

[DOI]

Ilan Karpas

Shakhar Smorodinsky

Discret. Math., 2015

Local Embeddings of Metric Spaces.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

Volume in General Metric Spaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp.

[BibT_eX]

[DOI]

Lee-Ad Gottlieb

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Bandwidth and low dimensional embedding.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓ<sub>p</sub>, p>2.

[BibT_eX]

[DOI]

Lee-Ad Gottlieb

CoRR, 2013

2012

Deterministic Algorithms for Fully Dynamic Maximal Matching

[BibT_eX]

[DOI]

Shay Solomon

CoRR, 2012

Beck's Three Permutations Conjecture: A Counterexample and Some Consequences.

[BibT_eX]

[DOI]

Alantha Newman

Aleksandar Nikolov

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Dynamic Inefficiency: Anarchy without Stability.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Near Linear Lower Bound for Dimension Reduction in L1.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2009

A novel approach to embedding of metric spaces (גישה חדשה לשיכונים של מרחבים מטריים.).

[BibT_eX]

[DOI]

PhD thesis, 2009

On low dimensional local embeddings.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Embedding metric spaces in their intrinsic dimension.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Nearly Tight Low Stretch Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006

Advances in metric embedding theory.

[BibT_eX]

[DOI]