The following pages link to Annotations in Data Streams (Q3638037):
Displaying 10 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Best-order streaming model (Q534570) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Streaming computations with a loquacious prover (Q2986880) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- Annotations for Sparse Data Streams (Q5384013) (← links)