The following pages link to Yair Bartal (Q388454):
Displaying 50 items.
- (Q236648) (redirect page) (← links)
- Bandwidth and low dimensional embedding (Q388456) (← links)
- Volume in general metric spaces (Q464741) (← links)
- Competitive algorithms for distributed data management. (Q960500) (← links)
- New algorithms for an ancient scheduling problem. (Q960514) (← links)
- A better lower bound for on-line scheduling (Q1327292) (← links)
- Low dimensional embeddings of ultrametrics. (Q1422397) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- Fast, fair and frugal bandwidth allocation in ATM networks (Q1601032) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Some low distortion metric Ramsey problems (Q1764172) (← links)
- On capital investment. (Q1818269) (← links)
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. (Q1853151) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Approximate nearest neighbor search for \(\ell_p\)-spaces \((2<p<\infty)\) via embeddings (Q2294683) (← links)
- On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← 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)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- (Q2934632) (← links)
- Randomized k-server algorithms for growth-rate bounded graphs (Q3022753) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- (Q3128890) (← links)
- Dimension Reduction Techniques for l_p (1<p<2), with Applications (Q3132849) (← links)
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (Q3434990) (← links)
- Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics (Q3563963) (← links)
- (Q3579400) (← links)
- Volume in General Metric Spaces (Q3586386) (← links)
- On the Value of Preemption in Scheduling (Q3595388) (← links)
- Distributed Paging for General Networks (Q4216146) (← links)
- (Q4228508) (← links)
- (Q4230358) (← links)
- (Q4252277) (← links)
- The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms (Q4339003) (← links)
- (Q4471325) (← links)
- (Q4501566) (← links)
- (Q4527040) (← links)
- (Q4542533) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion (Q4575641) (← links)
- (Q4633900) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp (Q4635528) (← links)
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control (Q4651514) (← links)
- Multiembedding of Metric Spaces (Q4651533) (← links)
- ON METRIC RAMSEY-TYPE DICHOTOMIES (Q4677842) (← links)
