Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Link opens in a new tab
Search content at Princeton University
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Contact Expert
View Scopus Profile
Ran Raz
Computer Science
Princeton Quantum Initiative
h-index
6792
Citations
44
h-index
Calculated based on number of publications stored in Pure and citations from Scopus
1989 …
2025
Research activity per year
Overview
Fingerprint
Network
Projects
(2)
Research output
(152)
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
Communication Complexity
51%
Multilinear
29%
Extractor
28%
Arithmetic Circuits
27%
Prover
24%
Verifier
23%
Weak pigeonhole Principle
20%
Time-space Lower Bounds
18%
Boolean Functions
18%
Random Bits
17%
Constant Depth
17%
Exponential Separation
17%
Learning Problems
17%
Parallel Repetition
17%
Pseudorandom number Generator
16%
Monotone
16%
Constant Error
15%
Parallel Repetition Theorem
15%
Arithmetic Formulas
15%
Superlinear
15%
Linear Size
14%
Information Complexity
13%
Multilinear Formulas
12%
Probabilistic Verification
12%
Branching Programs
11%
Uniform Distribution
11%
Low-degree Testing
11%
Min-entropy
10%
Matrix Product
10%
Deterministic Extractors
10%
Direct Sum
10%
Error Probability
9%
Number of Bits
9%
Parity Learning
9%
Learning Algorithm
9%
Non-signalling
9%
Exponential numbers
9%
PCP Theorem
9%
Polynomial Lower Bound
9%
Communication Information
8%
Random Strings
8%
Boolean Circuits
8%
Log-log
8%
Play Value
8%
Multilinear Circuits
8%
Bounded-depth Circuits
8%
NP-hard
8%
Logspace Computation
7%
Projection Games
7%
Bounded-depth Frege
7%
Oracle Separation
7%
Explicit Examples
7%
Resolution Proofs
7%
Formula Size
7%
Number of Edges
7%
High Probability
7%
Finite Fields
6%
External Information
6%
Noncommutative
6%
Label Cover
6%
Large Girth
6%
Distance Labeling
6%
Labeling in Graphs
6%
Polynomial Identity Testing
6%
Depth Lower Bound
6%
Bit-fixing Sources
6%
Input Matrix
6%
Planar Graph
6%
3-player Game
6%
General Graphs
6%
Two-pass
6%
Oracle
6%
Average-case Lower Bound
6%
Distance Function
6%
Bounded Degree Graphs
6%
Deterministic Turing Machine
6%
Privacy Amplification
6%
Tautology
6%
Pigeonhole Principle
6%
Communication Protocol
6%
Adversary
6%
Tight
6%
Read-once Branching Programs
6%
Polynomial Time
5%
Monotone Circuits
5%
Quasi-polynomial
5%
Time Complexity
5%
Frege Proofs
5%
Truly Random
5%
Locally Testable Codes
5%
Quantum Algorithms
5%
Proof Systems
5%
Projective Tests
5%
Multi-prover Interactive Proofs
5%
Pigeon
5%
Boolean
5%
Mathematics
Polynomial
100%
Probability
46%
Matrix (Mathematics)
28%
Boolean Function
28%
Entropy
24%
Branching Programs
22%
Main Result
17%
Probabilistically checkable proofs
16%
Low Degree
16%
Communication Protocol
15%
Finite Field
15%
Edge
13%
Cryptography
13%
Turing Machine
12%
Uniform Distribution
11%
Upper Bound
11%
Approximates
10%
Decision Tree
10%
Repeated Game
10%
Affine Subspace
9%
Polynomial Time
9%
XOR
8%
Direct Sum
8%
Fourier Analysis
8%
Black Box
8%
Interactivity
8%
Random Variable
8%
Random String
8%
Open Problem
7%
Absolute Value
7%
Interpolation
7%
Rank Tensor
6%
Lower Case
6%
Product of Matrix
6%
Distinct Element
6%
Matrix Product
6%
Counterexample
6%
Interpolation Property
6%
Query Complexity
6%
Arithmetic
6%
Submatrix
5%
Quantum Algorithm
5%
Complexity Space
5%
Exponential Rate
5%
Matching Problem
5%
Computer Science
Communication Complexity
69%
Proof
62%
Interactivity
33%
Boolean Function
23%
Entropy
20%
Cryptography
17%
Boolean Circuit
16%
Arithmetic Circuit
12%
Proof System
10%
Turing Machine
10%
Approximation (Algorithm)
9%
Soundness
9%
Information Retrieval
9%
Broadcast Channel
8%
Communication Problem
7%
Exponential Number
7%
Random Access
6%
Symmetric Protocol
6%
Circuit Evaluation
6%
Monotone Circuit
6%
Learning Problem
6%
Communication Protocol
6%
Input Distribution
6%
Internal Information
5%
Attackers
5%
Decryption
5%
Decision Tree
5%
Learning Algorithm
5%
