Pages that link to "Item:Q1300607"
From MaRDI portal
The following pages link to On randomized one-round communication complexity (Q1300607):
Displaying 28 items.
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- VC-saturated set systems (Q2143393) (← links)
- A Sauer-Shelah-Perles lemma for lattices (Q2209889) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5002813) (← links)
- Streaming Dictionary Matching with Mismatches (Q5088912) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- (Q5089155) (← links)
- (Q5089196) (← links)
- (Q5090374) (← links)
- (Q5090981) (← links)
- (Q5091196) (← links)
- (Q5091258) (← links)
- (Q6065460) (← links)
- Space limited linear-time graph algorithms on big data (Q6196840) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
