Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Contact Expert
View Scopus Profile
Ran Raz
Computer Science
Princeton Quantum Initiative
h-index
6358
Citations
41
h-index
Calculated based on number of publications stored in Pure and citations from Scopus
1989 …
2024
Research activity per year
Overview
Fingerprint
Network
Projects
(2)
Research output
(151)
Similar Profiles
(5)
Fingerprint
Dive into the research topics where Ran Raz is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Absolute Value
8%
Affine Sources
8%
All Languages
5%
Arithmetic Circuits
27%
Arithmetic Formulas
16%
Arthur-Merlin
8%
Bit-fixing Sources
8%
Bounded-depth Circuits
8%
Circuit Evaluation
8%
Coefficient Vector
5%
Coin-flipping Protocols
8%
Communication Complexity
34%
Communication Information
9%
Constant Depth
14%
Constant Error
10%
Depth Lower Bound
8%
Deterministic Extractors
12%
Direct Sum
5%
Distance Labeling
8%
Distinct Element
8%
Encryption-decryption
5%
Error Probability
6%
Exponential number
7%
Exponential Separation
12%
External Information
8%
Extractor
23%
Frege Proofs
7%
Information Complexity
10%
Input Matrix
8%
Label Cover
8%
Labeling in Graphs
8%
Large Classes
5%
Large Girth
8%
Learning Algorithm
5%
Learning Problems
10%
Linear Size
12%
Locally Testable Codes
6%
Log-log
11%
Low-degree Testing
12%
Majority Protocols
5%
Matrix Product
16%
Min-entropy
14%
Mixed Sources
8%
Monotone
8%
Multilinear
22%
Multilinear Circuits
8%
Multilinear Formulas
12%
Multiparty Communication Complexity
5%
Non-signaling
6%
Noncommutative
8%
NP-hard
6%
Number of Bits
5%
One-round
6%
Oracle Separation
8%
Parallel Repetition
8%
Parallel Repetition Theorem
12%
Parity Learning
8%
PCP Theorem
6%
Pigeons
6%
Polynomial Identity Testing
8%
Probabilistically Checkable Proofs
12%
Projection Games
10%
Projective Tests
5%
Prover
15%
Pseudorandom number Generator
9%
Quantum Protocol
5%
Random Bits
16%
Read-once Branching Programs
6%
Resolution Proofs
8%
Sampling numbers
6%
Space Lower Bound
12%
Streaming Algorithms
7%
Superlinear
7%
Tensor Rank
8%
Tight
5%
Time Lower Bound
8%
Truly Random
5%
Uniform Distribution
5%
Verifier
19%
Weak pigeonhole Principle
20%
Mathematics
Absolute Value
5%
Affine Subspace
8%
Almost Perfect
5%
Approximates
16%
Black Box
6%
Boolean Function
40%
Branching Programs
13%
Decision Tree
12%
Decryption
8%
Direct Sum
10%
Distinct Element
8%
Edge
8%
Error Correcting Codes
6%
Exponential Rate
6%
Finite Field
13%
Fourier Analysis
10%
Fourier Coefficient
7%
Hamming Weight
8%
Integer
10%
Interactive Proofs
6%
Low Degree
16%
Lower and upper bounds
5%
Lower Case
8%
Main Result
16%
Matrix (Mathematics)
24%
Open Problem
6%
Perfect Matchings
6%
Polynomial
100%
Polynomial Time
11%
Probabilistically checkable proofs
19%
Probability Theory
31%
Product of Matrix
8%
Quantum Circuit
6%
Quantum State
5%
Query Complexity
7%
Random Variable
8%
Rank Tensor
8%
Submatrix
7%
Turing Machine
8%
Uniform Distribution
16%
Upper Bound
17%
Computer Science
Approximation (Algorithm)
8%
Arithmetic Circuit
22%
Boolean Circuit
15%
Boolean Formula
5%
Boolean Function
23%
Circuit Evaluation
8%
Communication Complexity
60%
Communication Problem
9%
Communication Protocol
5%
Computational Complexity
6%
Fourier Coefficient
5%
Hamming Weight
8%
Information Retrieval
17%
Input Distribution
7%
Internal Information
6%
Multiplayer Game
9%
Polynomial Time
6%
Problem Instance
8%
Proof System
18%
Proof Technique
6%
Quantum Circuit
8%
Random Access
8%
Soundness
8%
Symmetric Protocol
8%
Turing Machine
8%
Uniform Distribution
12%
