The following pages link to Manor Mendel (Q610753):
Displaying 27 items.
- Improved bounds in the metric cotype inequality for Banach spaces (Q610754) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Low dimensional embeddings of ultrametrics. (Q1422397) (← links)
- Euclidean quotients of finite metric spaces (Q1763640) (← links)
- Some low distortion metric Ramsey problems (Q1764172) (← links)
- (Q1887083) (redirect page) (← links)
- Online companion caching (Q1887084) (← links)
- Markov convexity and local rigidity of distorted metrics (Q1932211) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Ultrametric subsets with large Hausdorff dimension (Q1949226) (← links)
- A simple proof of Dvoretzky-type theorem for Hausdorff dimension in doubling spaces (Q2143363) (← links)
- Nonlinear spectral calculus and super-expanders (Q2249432) (← links)
- Nonpositive curvature is not coarsely universal (Q2316827) (← links)
- Limitations to Fréchet's metric embedding method (Q2382346) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- On metric Ramsey-type phenomena (Q2496968) (← links)
- Metric structures in \(L_1\): dimension, snowflakes, and average distortion (Q2567204) (← links)
- Measured descent: A new embedding method for finite metrics (Q2571745) (← links)
- Spectral calculus and Lipschitz extension for barycentric metric spaces (Q2851032) (← links)
- On the Hausdorff dimension of ultrametric subsets in R<sup>n</sup> (Q2915373) (← links)
- Randomized k-server algorithms for growth-rate bounded graphs (Q3022753) (← links)
- Better algorithms for unfair metrical task systems and applications (Q3192047) (← links)
- Dvoretzky-type theorem for Ahlfors regular spaces (Q5056301) (← links)
- Ultrametric skeletons (Q5170988) (← links)
- Scaled Enflo type is equivalent to Rademacher type (Q5297594) (← links)
- (Q5414573) (← links)
