Pages that link to "Item:Q3002788"

The following pages link to The randomized communication complexity of set disjointness (Q3002788):

Displaying 27 items.

• Certifying equality with limited interaction (Q343864) (← links)
• Best-order streaming model (Q534570) (← links)
• Property testing lower bounds via communication complexity (Q693004) (← links)
• A communication-randomness tradeoff for two-processor systems (Q1891144) (← links)
• Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
• Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
• Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
• Communication complexity of set-disjointness for all probabilities (Q2816409) (← links)
• Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
• (Q2969658) (← links)
• Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
• Sparse and Lopsided Set Disjointness via Information Theory (Q3167423) (← links)
• The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
• The Probabilistic Communication Complexity of Set Intersection (Q4030193) (← links)
• (Q4038696) (← links)
• The communication complexity of the inevitable intersection problem (Q4988302) (← links)
• Equality alone does not simulate randomness (Q5091765) (← links)
• Distributed Testing of Distance-k Colorings (Q5100965) (← links)
• The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
• (Q5875509) (← links)
• LATIN 2004: Theoretical Informatics (Q5901664) (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
• Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
• Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
• Communication and information complexity (Q6200329) (← links)
• Streaming and query once space complexity of longest increasing subsequence (Q6591455) (← links)