Hebrew University
pcrsoaal or chssroom IISC is grmlcd willloo Tee provided lhnt copies arc 1101 mdc or dislribulcd for prolil or commcrci;ll advant;lge and lhal topics bear Ihis iiolicc and lhc hll cilalion 011 Ille first page. To cop! ollicrwise. lo rcpitblisli. IO ...
FOCS 1996: Burlington, 1996 – FOCS
This paper provides a novel technique for the analysis of randomized algorithms for optimization problems on metric spaces, by relating the randomized performance ratio for any, metric space to the randomized performance ratio for a set of ...
Yair Bartal, Amos Fiat, Yuval Rabani
Proceedings of the twenty-fourth annual ACM Symposium on Theory of Computing, STOC 1992, 1992 – STOC
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([C], [DF], [ML]), where copies of a file may be stored in the local storage of some subset of processors, ...
Baruch Awerbuch, Yair Bartal, Amos Fiat
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993 – STOC
This paper deals with the file allocation problem [BFR92] concerning the dynamic optimization of communication costs to access data in a distributed environment. We develop a dynamic file re-allocation strategy that adapts on-line to a sequence of ...
Yair Bartal, Rica Gonen, Noam Nisan
Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), 2003 – TARK
This paper deals with multi-unit combinatorial auctions where there are n types of goods for sale, and for each good there is some fixed number of units. We focus on the case where each bidder desires a relatively small number of units of each good. ...
Yair Bartal, Avrim Blum, Carl Burch, Andrew Tomkins
We present a randomized on-line algorithm for the Metrical Tti System problem that achieves a competitive ratio of O(log6 n) for arbitrary metric spaces, against art oblivious adversary. This is the first algorithm to achieve a sublinear competitive ...
Yair Bartal, John W. Byers, Danny Raz
FOCS 1997: Miami Beach, 1997 – FOCS
Flow control in high speed networks requires distributed routers to make fast decisions based only on local information in allocating bandwidth to connections. While most previous work on this problem focuses on achieving local objective functions, ...
Yair Bartal, Moses Charikar, Danny Raz
The min-sum k-clustering problem in a metric space is to find a partition of the space into k clusters as to minimize the total sum of distances between pairs of points assigned to the same cluster. We give the first polynomial time non-trivial ...
Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool
IEEE Symposium on Security and Privacy 1999, 1999 – SP
In recent years packet-filtering firewalls have seen some impressive technological advances (e.g., stateful inspection, transparency, performance, etc.) and wide-spread deployment. In contrast, firewall and security management technology is lacking. ...
Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005 – FOCS
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by ...