Yair Bartal
Yair Bartal
Hebrew University
Нет подтвержденного адреса электронной почты
Название
Процитировано
Процитировано
Год
Probabilistic approximation of metric spaces and its algorithmic applications
Y Bartal
Proceedings of 37th Conference on Foundations of Computer Science, 184-193, 1996
7851996
On approximating arbitrary metrices by tree metrics
Y Bartal
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
5751998
Firmato: A novel firewall management toolkit
Y Bartal, A Mayer, K Nissim, A Wool
Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No …, 1999
3401999
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
3192000
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
2871992
Competitive algorithms for distributed data management
Y Bartal, A Fiat, Y Rabani
Journal of Computer and System Sciences 51 (3), 341-358, 1995
2741995
Competitive Non-Preemptive Call Control.
B Awerbuch, Y Bartal, A Fiat, A Rosén
SODA 94, 312-320, 1994
2181994
Incentive compatible multi unit combinatorial auctions
Y Bartal, R Gonen, N Nisan
Proceedings of the 9th conference on Theoretical aspects of rationality and …, 2003
2152003
Competitive distributed file allocation
B Awerbuch, Y Bartal, A Fiat
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
2141993
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
2002004
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
1612003
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
1481997
Distributed paging for general networks
B Awerbuch, Y Bartal, A Fiat
J. Algorithms 28 (1), 67-104, 1998
1441998
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
1262008
On-line generalized Steiner problem
B Awerbuch, Y Azar, Y Bartal
Theoretical Computer Science 324 (2-3), 313-324, 2004
1242004
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
1242001
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
1131997
A generic scheme for building overlay networks in adversarial scenarios
I Abraham, B Awerbuch, Y Azar, Y Bartal, D Malkhi, E Pavlov
Proceedings International Parallel and Distributed Processing Symposium, 9 pp., 2003
1012003
On-line routing in all-optical networks
Y Bartal, S Leonardi
International Colloquium on Automata, Languages, and Programming, 516-526, 1997
98*1997
A better lower bound for on-line scheduling
Y Bartal, H Karloff, Y Rabani
Information Processing Letters 50 (3), 113-116, 1994
981994
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20