| 2009 |
|---|
| 72 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
On low dimensional local embeddings.
SODA 2009: 875-884 |
| 2008 |
|---|
| 71 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Nearly Tight Low Stretch Spanning Trees.
FOCS 2008: 781-790 |
| 70 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Embedding metric spaces in their intrinsic dimension.
SODA 2008: 363-372 |
| 69 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Nearly Tight Low Stretch Spanning Trees
CoRR abs/0808.2017: (2008) |
| 2007 |
|---|
| 68 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion.
SODA 2007: 502-511 |
| 67 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Local embeddings of metric spaces.
STOC 2007: 631-640 |
| 2006 |
|---|
| 66 | EE | Yair Bartal,
Stefano Leonardi,
Gil Shallom,
René Sitters:
On the Value of Preemption in Scheduling.
APPROX-RANDOM 2006: 39-48 |
| 65 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Advances in metric embedding theory.
STOC 2006: 271-286 |
| 64 | EE | Ittai Abraham,
Yair Bartal,
Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion
CoRR abs/cs/0610003: (2006) |
| 63 | EE | Yair Bartal,
Béla Bollobás,
Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems.
J. Comput. Syst. Sci. 72(5): 890-921 (2006) |
| 62 | EE | Yair Bartal,
Amos Fiat,
Stefano Leonardi:
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.
SIAM J. Comput. 36(2): 354-393 (2006) |
| 2005 |
|---|
| 61 | EE | Ittai Abraham,
Yair Bartal,
Hubert T.-H. Chan,
Kedar Dhamdhere,
Anupam Gupta,
Jon M. Kleinberg,
Ofer Neiman,
Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees.
FOCS 2005: 83-100 |
| 60 | EE | Yair Bartal,
Nathan Linial,
Manor Mendel,
Assaf Naor:
Some Low Distortion Metric Ramsey Problems.
Discrete & Computational Geometry 33(1): 27-41 (2005) |
| 59 | EE | Yair Bartal,
Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs.
J. Algorithms 55(2): 192-202 (2005) |
| 2004 |
|---|
| 58 | EE | Yair Bartal,
Rica Gonen,
Pierfrancesco La Mura:
Negotiation-range mechanisms: exploring the limits of truthful efficient markets.
ACM Conference on Electronic Commerce 2004: 1-8 |
| 57 | EE | Yair Bartal:
Graph Decomposition Lemmas and Their Role in Metric Embedding Methods.
ESA 2004: 89-97 |
| 56 | EE | Yair Bartal,
Manor Mendel:
Dimension reduction for ultrametrics.
SODA 2004: 664-665 |
| 55 | EE | Yair Bartal,
Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs.
SODA 2004: 666-671 |
| 54 | EE | Yair Bartal,
Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Ron Lavi,
Jiri Sgall,
Tomás Tichý:
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
STACS 2004: 187-198 |
| 53 | EE | Yair Bartal,
Alain J. Mayer,
Kobbi Nissim,
Avishai Wool:
Firmato: A novel firewall management toolkit.
ACM Trans. Comput. Syst. 22(4): 381-420 (2004) |
| 52 | EE | Yair Bartal,
Béla Bollobás,
Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems
CoRR cs.DS/0406028: (2004) |
| 51 | EE | Yair Bartal,
Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs
CoRR cs.DS/0406033: (2004) |
| 50 | EE | Yair Bartal,
Manor Mendel:
Multi-Embedding of Metric Spaces
CoRR cs.DS/0408003: (2004) |
| 49 | EE | Yair Bartal,
Nathan Linial,
Manor Mendel,
Assaf Naor:
Low dimensional embeddings of ultrametrics.
Eur. J. Comb. 25(1): 87-92 (2004) |
| 48 | EE | Yair Bartal,
John W. Byers,
Danny Raz:
Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control.
SIAM J. Comput. 33(6): 1261-1279 (2004) |
| 47 | EE | Yair Bartal,
Manor Mendel:
Multiembedding of Metric Spaces.
SIAM J. Comput. 34(1): 248-259 (2004) |
| 46 | EE | Baruch Awerbuch,
Yossi Azar,
Yair Bartal:
On-line generalized Steiner problem.
Theor. Comput. Sci. 324(2-3): 313-324 (2004) |
| 45 | EE | Yair Bartal,
Elias Koutsoupias:
On the competitive ratio of the work function algorithm for the k-server problem.
Theor. Comput. Sci. 324(2-3): 337-345 (2004) |
| 2003 |
|---|
| 44 | EE | Ittai Abraham,
Baruch Awerbuch,
Yossi Azar,
Yair Bartal,
Dahlia Malkhi,
Elan Pavlov:
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios.
IPDPS 2003: 40 |
| 43 | EE | Yair Bartal,
Manor Mendel:
Multi-embedding and path approximation of metric spaces.
SODA 2003: 424-433 |
| 42 | EE | Yair Bartal,
Nathan Linial,
Manor Mendel,
Assaf Naor:
On metric ramsey-type phenomena.
STOC 2003: 463-472 |
| 41 | EE | Yair Bartal,
Rica Gonen,
Noam Nisan:
Incentive compatible multi unit combinatorial auctions.
TARK 2003: 72-87 |
| 40 | EE | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Competitive distributed file allocation.
Inf. Comput. 185(1): 1-40 (2003) |
| 2002 |
|---|
| 39 | EE | Yair Bartal,
Martin Farach-Colton,
Shibu Yooseph,
Lisa Zhang:
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks.
Algorithmica 33(3): 272-286 (2002) |
| 38 | EE | Yair Bartal,
Marek Chrobak,
John Noga,
Prabhakar Raghavan:
More on random walks, electrical networks, and the harmonic k-server algorithm.
Inf. Process. Lett. 84(5): 271-276 (2002) |
| 2001 |
|---|
| 37 | | Yair Bartal,
Béla Bollobás,
Manor Mendel:
A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems.
FOCS 2001: 396-405 |
| 36 | EE | Yair Bartal,
Moses Charikar,
Danny Raz:
Approximating min-sum k-clustering in metric spaces.
STOC 2001: 11-20 |
| 35 | EE | Yair Bartal,
Moses Charikar,
Piotr Indyk:
On page migration and other relaxed task systems.
Theor. Comput. Sci. 268(1): 43-66 (2001) |
| 2000 |
|---|
| 34 | EE | Yair Bartal,
S. Muthukrishnan:
Minimizing maximum response time in scheduling broadcasts.
SODA 2000: 558-559 |
| 33 | EE | Yair Bartal,
Elias Koutsoupias:
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.
STACS 2000: 605-613 |
| 32 | | Yair Bartal,
Marek Chrobak,
Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line.
Inf. Comput. 158(1): 53-69 (2000) |
| 31 | EE | Yair Bartal,
Eddie Grove:
The harmonic k-server algorithm is competitive.
J. ACM 47(1): 1-15 (2000) |
| 30 | EE | Yair Bartal,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Jiri Sgall,
Leen Stougie:
Multiprocessor Scheduling with Rejection.
SIAM J. Discrete Math. 13(1): 64-78 (2000) |
| 1999 |
|---|
| 29 | EE | Yair Bartal,
Alain J. Mayer,
Kobbi Nissim,
Avishai Wool:
Firmato: A Novel Firewall Management Toolkit.
IEEE Symposium on Security and Privacy 1999: 17-31 |
| 28 | EE | Yair Bartal,
Martin Farach-Colton,
Shibu Yooseph,
Lisa Zhang:
Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks.
SODA 1999: 92-101 |
| 27 | EE | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
Algorithmica 25(1): 22-36 (1999) |
| 26 | EE | Yair Bartal,
Stefano Leonardi:
On-Line Routing in All-Optical Networks.
Theor. Comput. Sci. 221(1-2): 19-39 (1999) |
| 1998 |
|---|
| 25 | EE | Yair Bartal,
Marek Chrobak,
Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line (Extended Abstract).
ESA 1998: 247-258 |
| 24 | EE | Yair Bartal:
On Approximating Arbitrary Metrices by Tree Metrics.
STOC 1998: 161-168 |
| 23 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Distributed Paging for General Networks.
J. Algorithms 28(1): 67-104 (1998) |
| 1997 |
|---|
| 22 | EE | Yair Bartal,
John W. Byers,
Danny Raz:
Global Optimization Using Local Information with Applications to Flow Control.
FOCS 1997: 303-312 |
| 21 | | Yair Bartal,
Stefano Leonardi:
On-Line Routing in All-Optical Networks.
ICALP 1997: 516-526 |
| 20 | EE | Micah Adler,
Yair Bartal,
John W. Byers,
Michael Luby,
Danny Raz:
A Modular Analysis of Network Transmission Protocols.
ISTCS 1997: 54-62 |
| 19 | | Yair Bartal,
Moses Charikar,
Piotr Indyk:
On Page Migration and Other Related Task Systems.
SODA 1997: 43-52 |
| 18 | EE | Yair Bartal,
Avrim Blum,
Carl Burch,
Andrew Tomkins:
A polylog(n)-Competitive Algorithm for Metrical Task Systems.
STOC 1997: 711-719 |
| 17 | | Yair Bartal,
Adi Rosén:
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms.
J. Algorithms 23(2): 241-264 (1997) |
| 1996 |
|---|
| 16 | | Yair Bartal:
Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications.
FOCS 1996: 184-193 |
| 15 | | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
ICALP 1996: 429-441 |
| 14 | | Yair Bartal:
Distributed Paging.
Online Algorithms 1996: 97-117 |
| 13 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Distributed Paging for General Networks.
SODA 1996: 574-583 |
| 12 | | Baruch Awerbuch,
Yossi Azar,
Yair Bartal:
On-line Generalized Steiner Problem.
SODA 1996: 68-74 |
| 11 | | Yair Bartal,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Jiri Sgall,
Leen Stougie:
Multiprocessor Scheduling with Rejection.
SODA 1996: 95-103 |
| 10 | EE | Yair Bartal,
Amos Fiat,
Stefano Leonardi:
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.
STOC 1996: 531-540 |
| 1995 |
|---|
| 9 | | Yair Bartal,
Amos Fiat,
Yuval Rabani:
Competitive Algorithms for Distributed Data Management.
J. Comput. Syst. Sci. 51(3): 341-358 (1995) |
| 8 | | Yair Bartal,
Amos Fiat,
Howard J. Karloff,
Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem.
J. Comput. Syst. Sci. 51(3): 359-366 (1995) |
| 1994 |
|---|
| 7 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat,
Adi Rosén:
Competitive Non-Preemptive Call Control.
SODA 1994: 312-320 |
| 6 | | Yair Bartal,
Howard J. Karloff,
Yuval Rabani:
A Better Lower Bound for On-Line Scheduling.
Inf. Process. Lett. 50(3): 113-116 (1994) |
| 1993 |
|---|
| 5 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Heat & Dump: Competitive Distributed Paging
FOCS 1993: 22-31 |
| 4 | EE | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Competitive distributed file allocation.
STOC 1993: 164-173 |
| 1992 |
|---|
| 3 | | Yair Bartal,
Adi Rosén:
The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms
FOCS 1992: 344-353 |
| 2 | | Yair Bartal,
Amos Fiat,
Yuval Rabani:
Competitive Algorithms for Distributed Data Management (Extended Abstract)
STOC 1992: 39-50 |
| 1 | | Yair Bartal,
Amos Fiat,
Howard J. Karloff,
Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem
STOC 1992: 51-58 |
