Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Ben-Gurion University Research Portal
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs
Private approximation of search problems
Amos Beimel
,
Paz Carmi
, Kobbi Nissim
, Enav Weinreb
Institute for the Theory of Computing
Research output
:
Contribution to journal
›
Article
›
peer-review
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Private approximation of search problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Search Problems
100%
Privacy Requirements
42%
3-SAT
28%
Near-optimal
14%
Exact Solutions
14%
Algorithm Design
14%
NP-hard
14%
Approximation Ratio
14%
Algorithm 2
14%
Efficient Approximation Algorithm
14%
Privacy Definition
14%
Vertex Cover
14%
Optimal Approximation
14%
Minimal Definition
14%
Cryptographic Applications
14%
Theory of Computing
14%
Computer Science
Approximation (Algorithm)
100%
Approximation Algorithms
100%
Information Leak
50%
Privacy Requirement
37%
Approximation Ratio
12%
Algorithm Design
12%
Cryptographic Application
12%