Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManor Mendel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Sariel Har-Peled
, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. ACM Trans. Algorithms 19(1): 7:1-7:27 (2023)- 2021
- [c19]Sariel Har-Peled, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. SoCG 2021: 43:1-43:13
2010 – 2019
- 2019
- [j13]Manor Mendel:
A Simple Proof of the Johnson-Lindenstrauss Extension Theorem. Am. Math. Mon. 126(9): 838-840 (2019) - 2016
- [r2]Manor Mendel:
Metrical Task Systems. Encyclopedia of Algorithms 2016: 1279-1282 - 2015
- [j12]James R. Lee, Manor Mendel, Mohammad Moharrami:
A node-capacitated Okamura-Seymour theorem. Math. Program. 153(2): 381-415 (2015) - 2014
- [c18]Manor Mendel, Assaf Naor:
Expanders with respect to Hadamard spaces and random graphs: extended abstract. ITCS 2014: 353-358 - 2013
- [c17]James R. Lee, Manor Mendel, Mohammad Moharrami:
A node-capacitated okamura-seymour theorem. STOC 2013: 495-504 - [i12]Manor Mendel, Assaf Naor:
Expanders with respect to Hadamard spaces and random graphs. CoRR abs/1306.5434 (2013) - 2012
- [i11]James R. Lee, Manor Mendel, Mohammad Moharrami:
A node-capacitated Okamura-Seymour theorem. CoRR abs/1209.2744 (2012) - 2010
- [j11]Manor Mendel, Assaf Naor:
Maximum gradient embeddings and monotone clustering. Comb. 30(5): 581-615 (2010) - [c16]Manor Mendel, Assaf Naor:
Towards a Calculus for Non-Linear Spectral Gaps. SODA 2010: 236-255
2000 – 2009
- 2009
- [j10]Manor Mendel, Chaya Schwob:
Fast C-K-R Partitions of Sparse Graphs. Chic. J. Theor. Comput. Sci. 2009 (2009) - 2008
- [c15]Manor Mendel, Assaf Naor:
Markov convexity and local rigidity of distorted metrics. SCG 2008: 49-58 - [r1]Manor Mendel:
Metrical Task Systems. Encyclopedia of Algorithms 2008 - [i10]Manor Mendel, Chaya Schwob:
C-K-R Partitions of Sparse Graphs. CoRR abs/0809.1902 (2008) - 2007
- [c14]Manor Mendel, Assaf Naor:
Maximum Gradient Embeddings and Monotone Clustering. APPROX-RANDOM 2007: 242-256 - 2006
- [j9]Yair Bartal, Béla Bollobás, Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems. J. Comput. Syst. Sci. 72(5): 890-921 (2006) - [j8]Sariel Har-Peled, Manor Mendel:
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. SIAM J. Comput. 35(5): 1148-1184 (2006) - [c13]Manor Mendel, Assaf Naor:
Ramsey partitions and proximity data structures. FOCS 2006: 109-118 - [c12]Manor Mendel, Assaf Naor:
Metric cotype. SODA 2006: 79-88 - [i9]Amos Fiat, Manor Mendel:
Truly Online Paging with Locality of Reference. CoRR abs/cs/0601127 (2006) - [i8]Manor Mendel, Assaf Naor:
Maximum gradient embeddings and monotone clustering. CoRR abs/cs/0606109 (2006) - 2005
- [j7]Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor:
Some Low Distortion Metric Ramsey Problems. Discret. Comput. Geom. 33(1): 27-41 (2005) - [j6]James R. Lee, Manor Mendel, Assaf Naor:
Metric structures in L1: dimension, snowflakes, and average distortion. Eur. J. Comb. 26(8): 1180-1190 (2005) - [j5]Yair Bartal, Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs. J. Algorithms 55(2): 192-202 (2005) - [c11]Sariel Har-Peled, Manor Mendel:
Fast construction of nets in low dimensional metrics, and their applications. SCG 2005: 150-158 - [i7]Manor Mendel, Assaf Naor:
Ramsey partitions and proximity data structures. CoRR abs/cs/0511084 (2005) - 2004
- [j4]Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor:
Low dimensional embeddings of ultrametrics. Eur. J. Comb. 25(1): 87-92 (2004) - [j3]Yair Bartal, Manor Mendel:
Multiembedding of Metric Spaces. SIAM J. Comput. 34(1): 248-259 (2004) - [j2]Manor Mendel, Steven S. Seiden:
Online companion caching. Theor. Comput. Sci. 324(2-3): 183-200 (2004) - [c10]Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor:
Measured Descent: A New Embedding Method for Finite Metrics. FOCS 2004: 434-443 - [c9]James R. Lee, Manor Mendel, Assaf Naor:
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. LATIN 2004: 401-412 - [c8]Yair Bartal, Manor Mendel:
Dimension reduction for ultrametrics. SODA 2004: 664-665 - [c7]Yair Bartal, Manor Mendel:
Randomized k-server algorithms for growth-rate bounded graphs. SODA 2004: 666-671 - [i6]Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor:
Measured descent: A new embedding method for finite metrics. CoRR abs/cs/0412008 (2004) - [i5]Yair Bartal, Béla Bollobás, Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems. CoRR cs.DS/0406028 (2004) - [i4]Amos Fiat, Manor Mendel:
Better algorithms for unfair metrical task systems and applications. CoRR cs.DS/0406034 (2004) - [i3]Manor Mendel, Steven S. Seiden:
Online Companion Caching. CoRR cs.DS/0406036 (2004) - [i2]Yair Bartal, Manor Mendel:
Multi-Embedding of Metric Spaces. CoRR cs.DS/0408003 (2004) - [i1]Sariel Har-Peled, Manor Mendel:
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications. CoRR cs.DS/0409057 (2004) - 2003
- [j1]Amos Fiat, Manor Mendel:
Better Algorithms for Unfair Metrical Task Systems and Applications. SIAM J. Comput. 32(6): 1403-1422 (2003) - [c6]Yair Bartal, Manor Mendel:
Multi-embedding and path approximation of metric spaces. SODA 2003: 424-433 - [c5]Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor:
On metric ramsey-type phenomena. STOC 2003: 463-472 - 2002
- [c4]Amos Fiat, Manor Mendel, Steven S. Seiden:
Online Companion Caching. ESA 2002: 499-511 - 2001
- [c3]Yair Bartal, Béla Bollobás, Manor Mendel:
A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems. FOCS 2001: 396-405 - 2000
- [c2]Amos Fiat, Manor Mendel:
Better algorithms for unfair metrical task systems and applications. STOC 2000: 725-734
1990 – 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
