Competitive Algorithms for Distributed Data Management (Extended Abstract) - Yair Bartal; Amos Fiat; Yuval Rabani (STOC, 1992)

Heat & Dump: Competitive Distributed Paging - Baruch Awerbuch; Yair Bartal; Amos Fiat (FOCS, 1993)

Competitive Non-Preemptive Call Control. - Baruch Awerbuch; Yair Bartal; Amos Fiat; Adi Rosén (SODA, 1994)

A Better Lower Bound for On-Line Scheduling. - Yair Bartal; Howard J. Karloff; Yuval Rabani (Inf. Process. Lett., 1994)

Competitive analysis of distributed on-line problems - distributed paging - Yair Bartal (1994)

New Algorithms for an Ancient Scheduling Problem. - Yair Bartal; Amos Fiat; Howard J. Karloff; Rakesh Vohra (J. Comput. Syst. Sci., 1995)

Competitive Algorithms for Distributed Data Management. - Yair Bartal; Amos Fiat; Yuval Rabani (J. Comput. Syst. Sci., 1995)

Distributed Paging. - Yair Bartal (Online Algorithms, 1996)

Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications. - Yair Bartal (FOCS, 1996)

Global Optimization Using Local Information with Applications to Flow Control. - Yair Bartal; John W. Byers; Danny Raz (FOCS, 1997)

A Modular Analysis of Network Transmission Protocols. - Micah Adler; Yair Bartal; John W. Byers; Michael Luby; Danny Raz (ISTCS, 1997)

A polylog(n)-Competitive Algorithm for Metrical Task Systems. - Yair Bartal; Avrim Blum; Carl Burch; Andrew Tomkins (STOC, 1997)

The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms. - Yair Bartal; Adi Rosén (J. Algorithms, 1997)

A Randomized Algorithm for Two Servers on the Line (Extended Abstract). - Yair Bartal; Marek Chrobak; Lawrence L. Larmore (ESA, 1998)

Feedback-free multicast prefix protocols. - Yair Bartal; John W. Byers; Michael Luby; Danny Raz (ISCC, 1998)

On Approximating Arbitrary Metrices by Tree Metrics. - Yair Bartal (STOC, 1998)

Distributed Paging for General Networks. - Baruch Awerbuch; Yair Bartal; Amos Fiat (J. Algorithms, 1998)

Firmato: A Novel Firewall Management Toolkit. - Yair Bartal; Alain J. Mayer; Kobbi Nissim; Avishai Wool (S&P, 1999)

On Capital Investment. - Yossi Azar; Yair Bartal; Esteban Feuerstein; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 1999)

On-Line Routing in All-Optical Networks. - Yair Bartal; Stefano Leonardi 001 (Theor. Comput. Sci., 1999)

Minimizing maximum response time in scheduling broadcasts. - Yair Bartal; S. Muthukrishnan 001 (SODA, 2000)

A Randomized Algorithm for Two Servers on the Line. - Yair Bartal; Marek Chrobak; Lawrence L. Larmore (Inf. Comput., 2000)

The harmonic k-server algorithm is competitive. - Yair Bartal; Eddie Grove (J. ACM, 2000)

Multiprocessor Scheduling with Rejection. - Yair Bartal; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Jirí Sgall; Leen Stougie (SIAM J. Discret. Math., 2000)

A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems. - Yair Bartal; Béla Bollobás; Manor Mendel (FOCS, 2001)

Approximating min-sum k-clustering in metric spaces. - Yair Bartal; Moses Charikar; Danny Raz (STOC, 2001)

On page migration and other relaxed task systems. - Yair Bartal; Moses Charikar; Piotr Indyk (Theor. Comput. Sci., 2001)

Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. - Yair Bartal; Martin Farach-Colton; Shibu Yooseph; Lisa Zhang (Algorithmica, 2002)

More on random walks, electrical networks, and the harmonic k-server algorithm. - Yair Bartal; Marek Chrobak; John Noga; Prabhakar Raghavan (Inf. Process. Lett., 2002)

A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. - Ittai Abraham; Baruch Awerbuch; Yossi Azar; Yair Bartal; Dahlia Malkhi; Elan Pavlov (IPDPS, 2003)

Multi-embedding and path approximation of metric spaces. - Yair Bartal; Manor Mendel (SODA, 2003)

On metric ramsey-type phenomena. - Yair Bartal; Nathan Linial; Manor Mendel; Assaf Naor (STOC, 2003)

Incentive compatible multi unit combinatorial auctions. - Yair Bartal; Rica Gonen; Noam Nisan (TARK, 2003)

Competitive distributed file allocation. - Baruch Awerbuch; Yair Bartal; Amos Fiat (Inf. Comput., 2003)

Graph Decomposition Lemmas and Their Role in Metric Embedding Methods. - Yair Bartal (ESA, 2004)

Negotiation-range mechanisms: exploring the limits of truthful efficient markets. - Yair Bartal; Rica Gonen; Pierfrancesco La Mura (EC, 2004)

Dimension reduction for ultrametrics. - Yair Bartal; Manor Mendel (SODA, 2004)

Randomized k-server algorithms for growth-rate bounded graphs. - Yair Bartal; Manor Mendel (SODA, 2004)

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. - Yair Bartal; Francis Y. L. Chin; Marek Chrobak; Stanley P. Y. Fung; Wojciech Jawor; Ron Lavi; Jirí Sgall; Tomás Tichý (STACS, 2004)

Multi-Embedding of Metric Spaces - Yair Bartal; Manor Mendel (CoRR, 2004)

Low dimensional embeddings of ultrametrics. - Yair Bartal; Nathan Linial; Manor Mendel; Assaf Naor (Eur. J. Comb., 2004)

Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control. - Yair Bartal; John W. Byers; Danny Raz (SIAM J. Comput., 2004)

Multiembedding of Metric Spaces. - Yair Bartal; Manor Mendel (SIAM J. Comput., 2004)

On-line generalized Steiner problem. - Baruch Awerbuch; Yossi Azar; Yair Bartal (Theor. Comput. Sci., 2004)

On the competitive ratio of the work function algorithm for the k-server problem. - Yair Bartal; Elias Koutsoupias (Theor. Comput. Sci., 2004)

Firmato: A novel firewall management toolkit. - Yair Bartal; Alain J. Mayer; Kobbi Nissim; Avishai Wool (ACM Trans. Comput. Syst., 2004)

Metric Embeddings with Relaxed Guarantees. - Ittai Abraham; Yair Bartal; T.-H. Hubert Chan; Kedar Dhamdhere; Anupam Gupta 001; Jon M. Kleinberg; Ofer Neiman; Aleksandrs Slivkins (FOCS, 2005)

Some Low Distortion Metric Ramsey Problems. - Yair Bartal; Nathan Linial; Manor Mendel; Assaf Naor (Discret. Comput. Geom., 2005)

Randomized k-server algorithms for growth-rate bounded graphs. - Yair Bartal; Manor Mendel (J. Algorithms, 2005)

On the Value of Preemption in Scheduling. - Yair Bartal; Stefano Leonardi 001; Gil Shallom; René Sitters (APPROX-RANDOM, 2006)

Advances in metric embedding theory. - Ittai Abraham; Yair Bartal; Ofer Neiman (STOC, 2006)

Ramsey-type theorems for metric spaces with applications to online problems. - Yair Bartal; Béla Bollobás; Manor Mendel (J. Comput. Syst. Sci., 2006)

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. - Yair Bartal; Amos Fiat; Stefano Leonardi 001 (SIAM J. Comput., 2006)

Nearly Tight Low Stretch Spanning Trees. - Ittai Abraham; Yair Bartal; Ofer Neiman (FOCS, 2008)

Embedding metric spaces in their intrinsic dimension. - Ittai Abraham; Yair Bartal; Ofer Neiman (SODA, 2008)

On low dimensional local embeddings. - Ittai Abraham; Yair Bartal; Ofer Neiman (SODA, 2009)

Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics. - Yair Bartal; Leonard J. Schulman (SIAM J. Discret. Math., 2009)

Fast, precise and dynamic distance queries. - Yair Bartal; Lee-Ad Gottlieb; Tsvi Kopelowitz; Moshe Lewenstein; Liam Roditty (SODA, 2011)

Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound. - Yair Bartal; Ben Recht; Leonard J. Schulman (SODA, 2011)

A Linear Time Approximation Scheme for Euclidean TSP. - Yair Bartal; Lee-Ad Gottlieb (FOCS, 2013)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (CoRR, 2013)

Bandwidth and low dimensional embedding. - Yair Bartal; Douglas E. Carroll; Adam Meyerson; Ofer Neiman (Theor. Comput. Sci., 2013)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (SoCG, 2014)

Dimension reduction techniques for ℓp, 1 ≤ p < ∞, with applications. - Yair Bartal; Lee-Ad Gottlieb (CoRR, 2014)

Volume in General Metric Spaces. - Ittai Abraham; Yair Bartal; Ofer Neiman; Leonard J. Schulman (Discret. Comput. Geom., 2014)

Local Embeddings of Metric Spaces. - Ittai Abraham; Yair Bartal; Ofer Neiman (Algorithmica, 2015)

Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings. - Yair Bartal; Lee-Ad Gottlieb (CoRR, 2015)

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. - Ittai Abraham; Yair Bartal; Ofer Neiman (SIAM J. Comput., 2015)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (SIAM J. Discret. Math., 2015)

Dimension Reduction Techniques for ℓp (1<p<2), with Applications. - Yair Bartal; Lee-Ad Gottlieb (SoCG, 2016)

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. - Yair Bartal; Lee-Ad Gottlieb; Robert Krauthgamer (SIAM J. Comput., 2016)

Approximate Nearest Neighbor Search for ell _p -Spaces (2 via Embeddings. - Yair Bartal; Lee-Ad Gottlieb (LATIN, 2018)

Dimensionality reduction: theoretical perspective on practical measures. - Yair Bartal; Nova Fandina; Ofer Neiman (NeurIPS, 2019)

On notions of distortion and an almost minimum spanning tree with constant average distortion. - Yair Bartal; Arnold Filtser; Ofer Neiman (J. Comput. Syst. Sci., 2019)

Approximate nearest neighbor search for ℓp-spaces (2<p<∞). - Yair Bartal; Lee-Ad Gottlieb (Theor. Comput. Sci., 2019)

Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. - Yair Bartal; Nova Fandina; Seeun William Umboh (SODA, 2020)

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. - Yair Bartal; Lee-Ad Gottlieb (STOC, 2021)

Advances in Metric Ramsey Theory and its Applications. - Yair Bartal (CoRR, 2021)

Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. - Yair Bartal; Ora Nova Fandina; Kasper Green Larsen (SoCG, 2022)

Covering metric spaces by few trees. - Yair Bartal; Ora Nova Fandina; Ofer Neiman (J. Comput. Syst. Sci., 2022)

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications. - Sandip Banerjee; Yair Bartal; Lee-Ad Gottlieb; Alon Hovav (FOCS, 2024)

Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants. - Sandip Banerjee; Yair Bartal; Lee-Ad Gottlieb; Alon Hovav (AAAI, 2025)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters k-clustering and their fair variants. - Sandip Banerjee; Yair Bartal; Lee-Ad Gottlieb; Alon Hovav (CoRR, 2025)