Pages that link to "Item:Q598248"
From MaRDI portal
The following pages link to An information statistics approach to data stream and communication complexity (Q598248):
Displaying 50 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← 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)
- Certifying equality with limited interaction (Q343864) (← links)
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- Estimating hybrid frequency moments of data streams (Q431931) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Sketching information divergences (Q1009269) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- The communication complexity of graphical games on grid graphs (Q2190386) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Applying approximate counting for computing the frequency moments of long data streams (Q2272207) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- The Hardness of Being Private (Q2943893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
