Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
Ramsey partitions and proximity data structures
Manor Mendel
, Assaf Naor
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Ramsey partitions and proximity data structures'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Ramsey
100%
Proximity Data
100%
Approximate Distance Oracles
50%
Point Metric
33%
Universal Constants
33%
Metric Space
33%
Dvoretzky's Theorem
33%
Query Response Time
33%
Large Distortion
33%
Theoretical Computer Science
16%
Ramsey Problem
16%
Ramsey's Theorem
16%
Finite Metric Space
16%
Mendel
16%
Geometric Data Structures
16%
Storage Requirement
16%
Hubert Spaces
16%
Approximate Rank
16%
Structure Problem
16%
Efficient Data Structures
16%
Geometric Analysis
16%
Computer Science
Data Structure
100%
Metric Space
100%
Proximity Data
100%
Theoretical Computer Science
33%
Storage Requirement
33%
Structure Problem
33%
Mathematics
Approximates
100%
Data Structure
100%
Metric Space
50%
Nonlinear
50%
Finite Metric Space
25%