Manor Mendel
According to our database^{1},
Manor Mendel
authored at least 31 papers
between 1997 and 2016.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at zbmath.org
On csauthors.net:
Bibliography
2016
Metrical Task Systems.
Encyclopedia of Algorithms, 2016
2015
A nodecapacitated OkamuraSeymour theorem.
Math. Program., 2015
2014
Expanders with respect to Hadamard spaces and random graphs: extended abstract.
Proceedings of the Innovations in Theoretical Computer Science, 2014
2013
Expanders with respect to Hadamard spaces and random graphs.
CoRR, 2013
2010
Maximum gradient embeddings and monotone clustering.
Combinatorica, 2010
Towards a Calculus for NonLinear Spectral Gaps.
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
2009
Fast CKR Partitions of Sparse Graphs.
Chicago J. Theor. Comput. Sci., 2009
2008
Metrical Task Systems.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
CKR Partitions of Sparse Graphs
CoRR, 2008
Markov convexity and local rigidity of distorted metrics.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2006
Fast Construction of Nets in LowDimensional Metrics and Their Applications.
SIAM J. Comput., 2006
Ramseytype theorems for metric spaces with applications to online problems.
J. Comput. Syst. Sci., 2006
Metric cotype.
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
Ramsey partitions and proximity data structures.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
Randomized kserver algorithms for growthrate bounded graphs.
J. Algorithms, 2005
Metric structures in L_{1}: dimension, snowflakes, and average distortion.
Eur. J. Comb., 2005
Some Low Distortion Metric Ramsey Problems.
Discrete & Computational Geometry, 2005
2004
Online companion caching.
Theor. Comput. Sci., 2004
Multiembedding of Metric Spaces.
SIAM J. Comput., 2004
Low dimensional embeddings of ultrametrics.
Eur. J. Comb., 2004
MultiEmbedding of Metric Spaces
CoRR, 2004
Randomized kserver algorithms for growthrate bounded graphs.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Dimension reduction for ultrametrics.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Measured Descent: A New Embedding Method for Finite Metrics.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Better Algorithms for Unfair Metrical Task Systems and Applications.
SIAM J. Comput., 2003
On metric ramseytype phenomena.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Multiembedding and path approximation of metric spaces.
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
2002
Online Companion Caching.
Proceedings of the Algorithms, 2002
2001
A Ramsytype Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
1997
Truly Online Paging with Locality of Reference.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997