| Probabilistic approximation of metric spaces and its algorithmic applications Y Bartal Proceedings of 37th Conference on Foundations of Computer Science, 184-193, 1996 | 937 | 1996 |
| On approximating arbitrary metrices by tree metrics Y Bartal Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 659 | 1998 |
| Firmato A novel firewall management toolkit Y Bartal, A Mayer, K Nissim, A Wool ACM Transactions on Computer Systems (TOCS) 22 (4), 381-420, 2004 | 600 | 2004 |
| Multiprocessor scheduling with rejection Y Bartal, S Leonardi, A Marchetti-Spaccamela, J Sgall, L Stougie SIAM Journal on Discrete Mathematics 13 (1), 64-78, 2000 | 411 | 2000 |
| New algorithms for an ancient scheduling problem Y Bartal, A Fiat, H Karloff, R Vohra Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 321 | 1992 |
| Competitive algorithms for distributed data management Y Bartal, A Fiat, Y Rabani Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 292 | 1992 |
| Incentive compatible multi unit combinatorial auctions Y Bartal, R Gonen, N Nisan Proceedings of the 9th conference on Theoretical aspects of rationality and …, 2003 | 252 | 2003 |
| Competitive distributed file allocation B Awerbuch, Y Bartal, A Fiat Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 224 | 1993 |
| Competitive Non-Preemptive Call Control. B Awerbuch, Y Bartal, A Fiat, A Rosén SODA 94, 312-320, 1994 | 216 | 1994 |
| On metric Ramsey-type phenomena Y Bartal, N Linial, M Mendel, A Naor Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 199 | 2003 |
| Advances in metric embedding theory I Abraham, Y Bartal, O Neimany Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 185 | 2006 |
| Global optimization using local information with applications to flow control Y Bartal, JW Byers, D Raz Proceedings 38th Annual Symposium on Foundations of Computer Science, 303-312, 1997 | 158 | 1997 |
| Nearly tight low stretch spanning trees I Abraham, Y Bartal, O Neiman 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 781-790, 2008 | 147 | 2008 |
| Approximating min-sum k-clustering in metric spaces Y Bartal, M Charikar, D Raz Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 143 | 2001 |
| Distributed paging for general networks B Awerbuch, Y Bartal, A Fiat J. Algorithms 28 (1), 67-104, 1998 | 141 | 1998 |
| On-line generalized Steiner problem B Awerbuch, Y Azar, Y Bartal Theoretical Computer Science 324 (2-3), 313-324, 2004 | 140 | 2004 |
| A polylog(n)-competitive algorithm for metrical task systems Y Bartal, A Blum, C Burch, A Tomkins Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 134 | 1997 |
| Method and apparatus for managing a firewall Y Bartal, AJ Mayer, A Wool US Patent 7,146,639, 2006 | 129 | 2006 |
| A better lower bound for on-line scheduling Y Bartal, H Karloff, Y Rabani Information Processing Letters 50 (3), 113-116, 1994 | 110 | 1994 |
| The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme Y Bartal, LA Gottlieb, R Krauthgamer Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 102 | 2012 |
