Yair Bartal

From MaRDI portal
(Redirected from Person:388454)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimality of the Johnson-Lindenstrauss dimensionality reduction for practical measures2024-05-14Paper
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
Covering metric spaces by few trees
Journal of Computer and System Sciences
2022-08-26Paper
Covering Metric Spaces by Few Trees
(available as arXiv preprint)
2022-07-21Paper
Advances in Metric Ramsey Theory and its Applications2021-04-07Paper
Approximate nearest neighbor search for \(\ell_p\)-spaces \((2<p<\infty)\) via embeddings2020-02-12Paper
On notions of distortion and an almost minimum spanning tree with constant average distortion
Journal of Computer and System Sciences
2019-08-07Paper
On low dimensional local embeddings2019-05-06Paper
Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
Theoretical Computer Science
2019-01-18Paper
On notions of distortion and an almost minimum spanning tree with constant average distortion
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
On-line routing in all-optical networks
Automata, Languages and Programming
2018-07-04Paper
On the impossibility of dimension reduction for doubling subsets of \(\ell_p\)
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
Dimension reduction techniques for \(\ell_p\) \((1<p<2)\), with applications
(available as arXiv preprint)
2018-01-30Paper
Dimensionality reduction: beyond the Johnson-Lindenstrauss bound2017-09-29Paper
Fast, precise and dynamic distance queries2017-09-29Paper
Fast, precise and dynamic distance queries
(available as arXiv preprint)
2017-09-29Paper
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
SIAM Journal on Computing
2016-09-02Paper
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
SIAM Journal on Computing
2016-09-02Paper
scientific article; zbMATH DE number 6472577 (Why is no real title available?)2015-08-14Paper
Dimension reduction for ultrametrics2015-08-03Paper
scientific article; zbMATH DE number 6469207 (Why is no real title available?)2015-08-03Paper
On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
SIAM Journal on Discrete Mathematics
2015-07-31Paper
Local embeddings of metric spaces
Algorithmica
2015-07-10Paper
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SIAM Journal on Computing
2015-06-02Paper
Competitive distributed file allocation
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93
2015-05-07Paper
Approximating min-sum k -clustering in metric spaces
Proceedings of the thirty-third annual ACM symposium on Theory of computing
2015-02-27Paper
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion2014-12-18Paper
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
2014-11-25Paper
Volume in general metric spaces
Discrete & Computational Geometry
2014-10-29Paper
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
Proceedings of the forty-fourth annual ACM symposium on Theory of computing
2014-05-13Paper
Bandwidth and low dimensional embedding
Theoretical Computer Science
2013-12-19Paper
Advances in metric embedding theory
Advances in Mathematics
2011-12-02Paper
Bandwidth and low dimensional embedding
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2011-08-17Paper
Volume in general metric spaces
Algorithms – ESA 2010
2010-09-06Paper
On metric Ramsey-type phenomena
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
2010-08-16Paper
scientific article; zbMATH DE number 5764811 (Why is no real title available?)2010-08-06Paper
Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics
SIAM Journal on Discrete Mathematics
2010-06-01Paper
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
2009-01-05Paper
New algorithms for an ancient scheduling problem.
Journal of Computer and System Sciences
2008-12-21Paper
Competitive algorithms for distributed data management.
Journal of Computer and System Sciences
2008-12-21Paper
Limitations to Fréchet's metric embedding method
Israel Journal of Mathematics
2007-10-09Paper
STACS 2004
Lecture Notes in Computer Science
2007-10-01Paper
On the Value of Preemption in Scheduling
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2007-08-28Paper
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
SIAM Journal on Computing
2007-05-03Paper
The harmonic k -server algorithm is competitive
Journal of the ACM
2006-09-12Paper
On metric Ramsey-type phenomena
Annals of Mathematics. Second Series
2006-07-26Paper
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences
2006-07-12Paper
Algorithms – ESA 2004
Lecture Notes in Computer Science
2005-08-18Paper
Randomized k-server algorithms for growth-rate bounded graphs
Journal of Algorithms
2005-06-30Paper
ON METRIC RAMSEY-TYPE DICHOTOMIES
Journal of the London Mathematical Society
2005-05-23Paper
Some low distortion metric Ramsey problems
Discrete & Computational Geometry
2005-02-23Paper
Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
SIAM Journal on Computing
2005-02-21Paper
Multiembedding of Metric Spaces
SIAM Journal on Computing
2005-02-21Paper
On the competitive ratio of the work function algorithm for the \(k\)-server problem
Theoretical Computer Science
2004-11-23Paper
On-line generalized Steiner problem
Theoretical Computer Science
2004-11-23Paper
scientific article; zbMATH DE number 2102767 (Why is no real title available?)2004-09-24Paper
scientific article; zbMATH DE number 2079366 (Why is no real title available?)2004-07-28Paper
Competitive distributed file allocation.
Information and Computation
2004-03-14Paper
Low dimensional embeddings of ultrametrics.
European Journal of Combinatorics
2004-02-14Paper
More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
Information Processing Letters
2003-01-21Paper
A randomized algorithm for two servers on the line.
Information and Computation
2003-01-14Paper
scientific article; zbMATH DE number 1775400 (Why is no real title available?)2002-08-01Paper
Fast, fair and frugal bandwidth allocation in ATM networks
Algorithmica
2002-06-17Paper
On page migration and other relaxed task systems
Theoretical Computer Science
2002-03-03Paper
scientific article; zbMATH DE number 1500547 (Why is no real title available?)2001-06-13Paper
scientific article; zbMATH DE number 1559591 (Why is no real title available?)2001-03-01Paper
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics
2000-03-19Paper
On-line routing in all-optical networks
Theoretical Computer Science
2000-01-12Paper
On capital investment.
Algorithmica
2000-01-04Paper
scientific article; zbMATH DE number 1305396 (Why is no real title available?)1999-06-17Paper
scientific article; zbMATH DE number 1256671 (Why is no real title available?)1999-04-22Paper
scientific article; zbMATH DE number 1256772 (Why is no real title available?)1999-03-01Paper
Distributed Paging for General Networks
Journal of Algorithms
1998-01-01Paper
The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
Journal of Algorithms
1997-11-18Paper
scientific article; zbMATH DE number 1003262 (Why is no real title available?)1997-04-23Paper
scientific article; zbMATH DE number 873153 (Why is no real title available?)1996-10-07Paper
scientific article; zbMATH DE number 871904 (Why is no real title available?)1996-09-15Paper
scientific article; zbMATH DE number 871901 (Why is no real title available?)1996-04-28Paper
A better lower bound for on-line scheduling
Information Processing Letters
1994-06-15Paper


Research outcomes over time


This page was built for person: Yair Bartal