- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c48 |      | Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. STOC 2012: 663-672 |
| 2011 | ||
| c47 | | Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman: Bandwidth and Low Dimensional Embedding. APPROX-RANDOM 2011: 50-61 |
| c46 | | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries. SODA 2011: 840-853 |
| c45 | | Yair Bartal, Ben Recht, Leonard J. Schulman: Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound. SODA 2011: 868-887 |
| i7 | | Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer: The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. CoRR abs/1112.0699 (2011) |
| 2010 | ||
| c44 | | Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman: Volume in General Metric Spaces. ESA (2) 2010: 87-99 |
| i6 | | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010) |
| 2009 | ||
| j25 | | Yair Bartal, Leonard J. Schulman: Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics. SIAM J. Discrete Math. 23(2): 1110-1115 (2009) |
| c43 | | |
| 2008 | ||
| c42 | | Ittai Abraham, Yair Bartal, Ofer Neiman: Nearly Tight Low Stretch Spanning Trees. FOCS 2008: 781-790 |
| c41 | | Ittai Abraham, Yair Bartal, Ofer Neiman: Embedding metric spaces in their intrinsic dimension. SODA 2008: 363-372 |
| i5 | | Ittai Abraham, Yair Bartal, Ofer Neiman: Nearly Tight Low Stretch Spanning Trees. CoRR abs/0808.2017 (2008) |
| 2007 | ||
| c40 | | Ittai Abraham, Yair Bartal, Ofer Neiman: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA 2007: 502-511 |
| c39 | | |
| 2006 | ||
| j24 | | 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) |
| j23 | | 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) |
| c38 | | Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters: On the Value of Preemption in Scheduling. APPROX-RANDOM 2006: 39-48 |
| c37 | | |
| i4 | | Ittai Abraham, Yair Bartal, Ofer Neiman: Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. CoRR abs/cs/0610003 (2006) |
| 2005 | ||
| j22 | | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor: Some Low Distortion Metric Ramsey Problems. Discrete & Computational Geometry 33(1): 27-41 (2005) |
| j21 | | Yair Bartal, Manor Mendel: Randomized k-server algorithms for growth-rate bounded graphs. J. Algorithms 55(2): 192-202 (2005) |
| c36 | | 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 |
| 2004 | ||
| j20 | | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor: Low dimensional embeddings of ultrametrics. Eur. J. Comb. 25(1): 87-92 (2004) |
| j19 | | 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) |
| j18 | | |
| j17 | | Baruch Awerbuch, Yossi Azar, Yair Bartal: On-line generalized Steiner problem. Theor. Comput. Sci. 324(2-3): 313-324 (2004) |
| j16 | | 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) |
| j15 | | Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool: Firmato: A novel firewall management toolkit. ACM Trans. Comput. Syst. 22(4): 381-420 (2004) |
| c35 | | |
| c34 | | 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 |
| c33 | | |
| c32 | | Yair Bartal, Manor Mendel: Randomized k-server algorithms for growth-rate bounded graphs. SODA 2004: 666-671 |
| c31 | | 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 |
| i3 | | Yair Bartal, Béla Bollobás, Manor Mendel: Ramsey-type theorems for metric spaces with applications to online problems. CoRR cs.DS/0406028 (2004) |
| i2 | | Yair Bartal, Manor Mendel: Randomized k-server algorithms for growth-rate bounded graphs. CoRR cs.DS/0406033 (2004) |
| i1 | | |
| 2003 | ||
| j14 | | Baruch Awerbuch, Yair Bartal, Amos Fiat: Competitive distributed file allocation. Inf. Comput. 185(1): 1-40 (2003) |
| c30 | | 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 |
| c29 | | Yair Bartal, Manor Mendel: Multi-embedding and path approximation of metric spaces. SODA 2003: 424-433 |
| c28 | | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor: On metric ramsey-type phenomena. STOC 2003: 463-472 |
| c27 | | Yair Bartal, Rica Gonen, Noam Nisan: Incentive compatible multi unit combinatorial auctions. TARK 2003: 72-87 |
| 2002 | ||
| j13 | | Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang: Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. Algorithmica 33(3): 272-286 (2002) |
| j12 | | 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 | ||
| j11 | | Yair Bartal, Moses Charikar, Piotr Indyk: On page migration and other relaxed task systems. Theor. Comput. Sci. 268(1): 43-66 (2001) |
| c26 | | 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 |
| c25 | | Yair Bartal, Moses Charikar, Danny Raz: Approximating min-sum k-clustering in metric spaces. STOC 2001: 11-20 |
| 2000 | ||
| j10 | | Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line. Inf. Comput. 158(1): 53-69 (2000) |
| j9 | | |
| j8 | | Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13(1): 64-78 (2000) |
| c24 | | Yair Bartal, S. Muthukrishnan: Minimizing maximum response time in scheduling broadcasts. SODA 2000: 558-559 |
| c23 | | Yair Bartal, Elias Koutsoupias: On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. STACS 2000: 605-613 |
| 1999 | ||
| j7 | | Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. Algorithmica 25(1): 22-36 (1999) |
| j6 | | Yair Bartal, Stefano Leonardi: On-Line Routing in All-Optical Networks. Theor. Comput. Sci. 221(1-2): 19-39 (1999) |
| c22 | | Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang: Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. SODA 1999: 92-101 |
| c21 | | Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool: Firmato: A Novel Firewall Management Toolkit. IEEE Symposium on Security and Privacy 1999: 17-31 |
| 1998 | ||
| j5 | | Baruch Awerbuch, Yair Bartal, Amos Fiat: Distributed Paging for General Networks. J. Algorithms 28(1): 67-104 (1998) |
| c20 | | Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA 1998: 247-258 |
| c19 | | |
| 1997 | ||
| j4 | | 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) |
| c18 | | Yair Bartal, John W. Byers, Danny Raz: Global Optimization Using Local Information with Applications to Flow Control. FOCS 1997: 303-312 |
| c17 | | |
| c16 | | Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz: A Modular Analysis of Network Transmission Protocols. ISTCS 1997: 54-62 |
| c15 | | Yair Bartal, Moses Charikar, Piotr Indyk: On Page Migration and Other Related Task Systems. SODA 1997: 43-52 |
| c14 | | Yair Bartal, Avrim Blum, Carl Burch, Andrew Tomkins: A polylog(n)-Competitive Algorithm for Metrical Task Systems. STOC 1997: 711-719 |
| 1996 | ||
| c13 | | |
| c12 | | Yair Bartal: Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications. FOCS 1996: 184-193 |
| c11 | | Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. ICALP 1996: 429-441 |
| c10 | | |
| c9 | | Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SODA 1996: 95-103 |
| c8 | | Baruch Awerbuch, Yair Bartal, Amos Fiat: Distributed Paging for General Networks. SODA 1996: 574-583 |
| c7 | | 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 | ||
| j3 | | Yair Bartal, Amos Fiat, Yuval Rabani: Competitive Algorithms for Distributed Data Management. J. Comput. Syst. Sci. 51(3): 341-358 (1995) |
| j2 | | 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 | ||
| j1 | | Yair Bartal, Howard J. Karloff, Yuval Rabani: A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994) |
| c6 | | Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén: Competitive Non-Preemptive Call Control. SODA 1994: 312-320 |
| 1993 | ||
| c5 | | Baruch Awerbuch, Yair Bartal, Amos Fiat: Heat & Dump: Competitive Distributed Paging. FOCS 1993: 22-31 |
| c4 | | Baruch Awerbuch, Yair Bartal, Amos Fiat: Competitive distributed file allocation. STOC 1993: 164-173 |
| 1992 | ||
| c3 | | |
| c2 | | Yair Bartal, Amos Fiat, Yuval Rabani: Competitive Algorithms for Distributed Data Management (Extended Abstract). STOC 1992: 39-50 |
| c1 | | Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem. STOC 1992: 51-58 |
Data released under the ODC-BY 1.0 license — See also our legal information page