Pages that link to "Item:Q4030193"
From MaRDI portal
The following pages link to The Probabilistic Communication Complexity of Set Intersection (Q4030193):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication (Q436334) (← links)
- On a theorem of Razborov (Q445247) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- A note on efficient aggregate queries in sensor networks (Q868957) (← links)
- Comparing two sets without disclosing them (Q948505) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- The communication complexity of interval orders (Q1201817) (← links)
- The space complexity of approximating the frequency moments (Q1305928) (← links)
- Still another rank determination of set intersection matrices with an application in communication complexity (Q1324468) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Deterministic communication complexity of set intersection (Q1897354) (← links)
- Fourier analysis for probabilistic communication complexity (Q1918947) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← 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)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Probabilistic communication complexity over the reals (Q2269005) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- Random resolution refutations (Q2311546) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- Communication complexity of set-disjointness for all probabilities (Q2816409) (← 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)
