The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |