Sotabase

Career

· Professor, The Hebrew University of Jerusalem (Current)1995–1997
· Postgraduate Degree, Computer Science, University of California, Berkeley1995–1997
· Doctor of Philosophy - PhD, Computer Science, Tel Aviv University1992–1995

Publications (99)

Probabilistic approximation of metric spaces and its algorithmic applications
Proceedings of 37th Conference on Foundations of Computer Science · 1996
771
cited
On approximating arbitrary metrices by tree metrics
Symposium on the Theory of Computing · 1998
499
cited
Firmato: a novel firewall management toolkit
Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · 1999
439
cited
Multiprocessor scheduling with rejection
ACM-SIAM Symposium on Discrete Algorithms · 1996
294
cited
New algorithms for an ancient scheduling problem
Symposium on the Theory of Computing · 1992
233
cited
Incentive compatible multi unit combinatorial auctions
Theoretical Aspects of Rationality and Knowledge · 2003
227
cited
Competitive Algorithms for Distributed Data Management
Journal of computer and system sciences (Print) · 1995
192
cited
On metric ramsey-type phenomena
Symposium on the Theory of Computing · 2003
177
cited
Competitive non-preemptive call control
ACM-SIAM Symposium on Discrete Algorithms · 1994
154
cited
Advances in metric embedding theory
Symposium on the Theory of Computing · 2006
146
cited
Global optimization using local information with applications to flow control
Proceedings 38th Annual Symposium on Foundations of Computer Science · 1997
124
cited
On-line generalized Steiner problem
ACM-SIAM Symposium on Discrete Algorithms · 1996
124
cited
Nearly Tight Low Stretch Spanning Trees
2008 49th Annual IEEE Symposium on Foundations of Computer Science · 2008
118
cited
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
Symposium on Theoretical Aspects of Computer Science · 2004
115
cited
Approximating min-sum k-clustering in metric spaces
Symposium on the Theory of Computing · 2001
112
cited
Competitive distributed file allocation
Information and Computation · 1993
104
cited
A polylog(n)-competitive algorithm for metrical task systems
Symposium on the Theory of Computing · 1997
98
cited
A Better Lower Bound for On-Line Scheduling
Information Processing Letters · 1994
95
cited
A generic scheme for building overlay networks in adversarial scenarios
Proceedings International Parallel and Distributed Processing Symposium · 2003
95
cited
Nuclear power plant transient diagnostics using artificial neural networks that allow 'don't-know' classifications
1995
90
cited
Sotabase
Yair Bartal | Researcher Profile | Sotabase | Sotabase