The following pages link to Ofer Neiman (Q260268):
Displaying 50 items.
- Low dimensional embeddings of doubling metrics (Q260269) (← links)
- Bandwidth and low dimensional embedding (Q388456) (← links)
- Volume in general metric spaces (Q464741) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Assouad's theorem with dimension independent of the snowflaking (Q1759761) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Terminal embeddings (Q2405893) (← links)
- Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- (Q2934632) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- Dynamic Inefficiency: Anarchy without Stability (Q3095259) (← links)
- Low Dimensional Embeddings of Doubling Metrics (Q3188862) (← links)
- (Q3579400) (← links)
- Volume in General Metric Spaces (Q3586386) (← links)
- On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion (Q4575641) (← links)
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4575779) (← links)
- Snowflake universality of Wasserstein spaces (Q4584312) (← links)
- Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost (Q4598223) (← links)
- Ramsey Spanning Trees and Their Applications (Q4607997) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4629974) (← links)
- (Q4633900) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp (Q4635528) (← links)
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (Q4962204) (← links)
- (Q5009588) (← links)
- (Q5011874) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
- Lossless Prioritized Embeddings (Q5146835) (← links)
- Light Spanners (Q5167763) (← links)
- Near-Optimal Distributed Routing with Low Memory (Q5197685) (← links)
- Metric embedding via shortest path decompositions (Q5230353) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Cops, robbers, and threatening skeletons (Q5259541) (← links)
- (Q5351905) (← links)
- Distributed Strong Diameter Network Decomposition (Q5361938) (← links)
- On Efficient Distributed Construction of Near Optimal Routing Schemes (Q5361941) (← links)
- Using petal-decompositions to build a low stretch spanning tree (Q5415490) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
