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
h-index
6199
Citations
40
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
(6)
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
34%
Arithmetic Circuits
27%
Extractor
23%
Multilinear
22%
Weak pigeonhole Principle
20%
Verifier
19%
Random Bits
16%
Matrix Product
16%
Arithmetic Formulas
16%
Prover
15%
Min-entropy
14%
Constant Depth
14%
Exponential Separation
12%
Parallel Repetition Theorem
12%
Multilinear Formulas
12%
Probabilistically Checkable Proofs
12%
Linear Size
12%
Space Lower Bound
12%
Deterministic Extractors
12%
Low-degree Testing
12%
Log-log
11%
Learning Problems
10%
Constant Error
10%
Projection Games
10%
Information Complexity
10%
Pseudorandom number Generator
9%
Communication Information
9%
External Information
8%
Noncommutative
8%
Oracle Separation
8%
Mixed Sources
8%
Coin-flipping Protocols
8%
Label Cover
8%
Large Girth
8%
Distance Labeling
8%
Labeling in Graphs
8%
Polynomial Identity Testing
8%
Parallel Repetition
8%
Tensor Rank
8%
Multilinear Circuits
8%
Depth Lower Bound
8%
Parity Learning
8%
Time Lower Bound
8%
Bounded-depth Circuits
8%
Bit-fixing Sources
8%
Affine Sources
8%
Resolution Proofs
8%
Absolute Value
8%
Input Matrix
8%
Circuit Evaluation
8%
Arthur-Merlin
8%
Distinct Element
8%
Monotone
8%
Superlinear
7%
Exponential number
7%
Streaming Algorithms
7%
Frege Proofs
7%
NP-hard
6%
One-round
6%
Error Probability
6%
Locally Testable Codes
6%
Sampling numbers
6%
PCP Theorem
6%
Non-signaling
6%
Pigeons
6%
Read-once Branching Programs
6%
Truly Random
5%
Learning Algorithm
5%
Tight
5%
Quantum Protocol
5%
Multiparty Communication Complexity
5%
Uniform Distribution
5%
Number of Bits
5%
All Languages
5%
Encryption-decryption
5%
Large Classes
5%
Majority Protocols
5%
Coefficient Vector
5%
Direct Sum
5%
Projective Tests
5%
Mathematics
Polynomial
100%
Boolean Function
40%
Probability Theory
31%
Matrix (Mathematics)
24%
Probabilistically checkable proofs
19%
Upper Bound
17%
Main Result
16%
Uniform Distribution
16%
Low Degree
16%
Approximates
16%
Branching Programs
13%
Finite Field
13%
Decision Tree
12%
Polynomial Time
11%
Integer
10%
Direct Sum
10%
Fourier Analysis
10%
Affine Subspace
8%
Turing Machine
8%
Edge
8%
Random Variable
8%
Hamming Weight
8%
Rank Tensor
8%
Lower Case
8%
Decryption
8%
Product of Matrix
8%
Distinct Element
8%
Fourier Coefficient
7%
Submatrix
7%
Query Complexity
7%
Quantum Circuit
6%
Interactive Proofs
6%
Black Box
6%
Error Correcting Codes
6%
Perfect Matchings
6%
Exponential Rate
6%
Open Problem
6%
Quantum State
5%
Lower and upper bounds
5%
Almost Perfect
5%
Absolute Value
5%
Computer Science
Communication Complexity
60%
Boolean Function
23%
Arithmetic Circuit
22%
Proof System
18%
Information Retrieval
17%
Boolean Circuit
15%
Uniform Distribution
12%
Multiplayer Game
9%
Communication Problem
9%
Quantum Circuit
8%
Random Access
8%
Problem Instance
8%
Turing Machine
8%
Hamming Weight
8%
Approximation (Algorithm)
8%
Symmetric Protocol
8%
Circuit Evaluation
8%
Soundness
8%
Input Distribution
7%
Computational Complexity
6%
Internal Information
6%
Proof Technique
6%
Polynomial Time
6%
Boolean Formula
5%
Communication Protocol
5%
Fourier Coefficient
5%
