Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Probabilistic approximation of metric spaces and its algorithmic applications

- Y. Bartal
- Computer Science
- Proceedings of 37th Conference on Foundations of…
- 14 October 1996

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… Expand

703 85

On approximating arbitrary metrices by tree metrics

- Y. Bartal
- Computer Science
- STOC '98
- 23 May 1998

We design a generation algorithm for a problem which a&es in computational chemistry: the random generation of models of amorphous strutures. Such structures can be modeled as graphs which see… Expand

479 31

Multiprocessor scheduling with rejection

- Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, L. Stougie
- Computer Science, Economics
- SODA '96
- 28 January 1996

We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. An instance of the problem is given by m identical parallel machines and a… Expand

246 22- PDF

Incentive compatible multi unit combinatorial auctions

- Y. Bartal, Rica Gonen, N. Nisan
- Economics, Computer Science
- TARK '03
- 20 June 2003

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… Expand

215 19- PDF

Firmato: a novel firewall management toolkit

- Y. Bartal, A. Mayer, Kobbi Nissim, A. Wool
- Computer Science
- Proceedings of the IEEE Symposium on Security…
- 9 May 1999

In recent years, packet filtering firewalls have seen some impressive technological advances (e.g., stateful inspection, transparency, performance, etc.) and widespread deployment. In contrast,… Expand

193 18

Firmato: a novel firewall management toolkit

- Y. Bartal, A. Mayer, Kobbi Nissim, A. Wool
- Computer Science
- Proceedings of the IEEE Symposium on Security…
- 9 May 1999

In recent years, packet filtering firewalls have seen some impressive technological advances (e.g., stateful inspection, transparency, performance, etc.) and widespread deployment. In contrast,… Expand

191 18

New algorithms for an ancient scheduling problem

- Y. Bartal, A. Fiat, H. Karloff, R. Vohra
- Computer Science
- STOC '92
- 1 July 1992

We consider the on-line version of the original <italic>m</italic>-machine scheduling problem: given <italic>m</italic> machines and <italic>n</italic> positive real jobs, schedule the… Expand

239 14

A generic scheme for building overlay networks in adversarial scenarios

- I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, E. Pavlov
- Computer Science
- Proceedings International Parallel and…
- 22 April 2003

This paper presents a generic scheme for a central, yet untackled issue in overlay dynamic networks: maintaining stability over long life and against malicious adversaries. The generic scheme… Expand

97 13- PDF

On-line generalized Steiner problem

- B. Awerbuch, Y. Azar, Y. Bartal
- Mathematics, Computer Science
- SODA '96
- 28 January 1996

The generalized Steiner problem (GSP) is defined as follows. We are given a graph with non-negative edge weights and a set of pairs of vertices. The algorithm has to construct minimum weight subgraph… Expand

98 12- PDF

Competitive non-preemptive call control

- B. Awerbuch, Y. Bartal, A. Fiat, A. Rosén
- Mathematics, Computer Science
- SODA '94
- 23 January 1994

We deal with randomized competitive algorithms for non-preemptive call control on tree-like switching networks. We give an optimal O(logn) competitive algorithm for non-preemptive call scheduling on… Expand

172 11