The following pages link to (Q4449184):
Displaying 10 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- A characterization of average case communication complexity (Q845939) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
