The following pages link to Yuval Rabani (Q222776):
Displaying 50 items.
- (Q588998) (redirect page) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Competitive algorithms for distributed data management. (Q960500) (← links)
- On the space complexity of some algorithms for sequence comparison (Q1184980) (← links)
- A better lower bound for on-line scheduling (Q1327292) (← links)
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- The invisible hand of Laplace: the role of market structure in price convergence and oscillation (Q2050989) (← links)
- A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
- Convergence of incentive-driven dynamics in Fisher markets (Q2155906) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- On Lipschitz extension from finite subsets (Q2357002) (← links)
- On the hardness of approximating Multicut and Sparsest-Cut (Q2458939) (← links)
- Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs (Q2573422) (← links)
- A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems (Q2706128) (← links)
- (Q2768266) (← links)
- (Q2768268) (← links)
- (Q2768354) (← links)
- Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) (Q2817637) (← links)
- Lower bounds for high dimensional nearest neighbor search and related problems (Q2819560) (← links)
- Explicit Dimension Reduction and Its Applications (Q2884581) (← links)
- Local Versus Global Properties of Metric Spaces (Q2884582) (← links)
- Unconditionally-Secure Robust Secret Sharing with Compact Shares (Q2894408) (← links)
- (Q2921763) (← links)
- On earthmover distance, metric labeling, and 0-extension (Q2931417) (← links)
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (Q2941569) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- (Q3113698) (← links)
- An improved approximation algorithm for resource allocation (Q3189033) (← links)
- Tighter bounds for nearest neighbor search and related problems in the cell probe model (Q3192006) (← links)
- Polynomial-time approximation schemes for geometric min-sum median clustering (Q3196638) (← links)
- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (Q3448775) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- On Earthmover Distance, Metric Labeling, and 0-Extension (Q3558006) (← links)
- (Q3579377) (← links)
- Low distortion maps between point sets (Q3580974) (← links)
- Approximation schemes for clustering problems (Q3581243) (← links)
- Local versus global properties of metric spaces (Q3581570) (← links)
- Improved lower bounds for embeddings into <i>L</i><sub>1</sub> (Q3583421) (← links)
- Low Distortion Maps Between Point Sets (Q3586193) (← links)
- Approximation Algorithms for Graph Homomorphism Problems (Q3595371) (← links)
- Improved Lower Bounds for Embeddings into $L_1$ (Q3654385) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Q4216135) (← links)
- Fairness in Scheduling (Q4225867) (← links)
- (Q4228490) (← links)
- (Q4230341) (← links)
- (Q4234054) (← links)
- Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms (Q4291558) (← links)
