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
Arthur-Merlin streaming complexity
Tom Gur,
Ran Raz
Research output
:
Contribution to journal
›
Article
›
peer-review
12
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Arthur-Merlin streaming complexity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Distinct Element
100%
Arthur-Merlin
100%
Streaming Algorithms
75%
Hamming Distance
25%
Communication Complexity
25%
New Lower Bound
25%
Probabilistic Proof Systems
25%
Data Stream Model
25%
Distance Problems
25%
N-factor
25%
Multiplicative Factors
25%
Computer Science
Data Stream
100%
Hamming Distance
33%
Proof System
33%
Communication Complexity
33%
Space Complexity
33%
Multiplicative Factor
33%
Mathematics
Distinct Element
100%
Complexity Space
25%
Hamming Distance
25%
Multiplicative
25%