The following pages link to Ofer Neiman (Q260268):
Displaying 29 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)
- On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion (Q4575641) (← links)
- Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost (Q4598223) (← links)
- (Q5009588) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
- (Q5351905) (← links)
- Corrigendum: Metric Embedding via Shortest Path Decompositions (Q6069414) (← links)
- (Q6083385) (← links)
- Improved weighted additive spanners (Q6096039) (← links)
- Centralized, parallel, and distributed multi-source shortest paths via hopsets and rectangular matrix multiplication (Q6490974) (← links)
