The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Fooling views: a new lower bound technique for distributed computations under congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Compress Interactive Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information complexity approach to extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrepancy lower bound for information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying equality with limited interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Triangle Detection via Expander Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting cliques in CONGEST networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse and Lopsided Set Disjointness via Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Subgraph Detection in the CONGEST Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The landscape of communication complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Finding and Listing in CONGEST Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct product theorem for two-party bounded-round public-coin communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong direct product theorem for disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Subgraph Detection in Broadcast CONGEST. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5203681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity of an Equality Predicate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity (for Algorithm Designers) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards proving strong direct product theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:11, 24 July 2024

scientific article; zbMATH DE number 7333150
Language Label Description Also known as
English
The Communication Complexity of Set Intersection and Multiple Equality Testing
scientific article; zbMATH DE number 7333150

    Statements

    The Communication Complexity of Set Intersection and Multiple Equality Testing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 April 2021
    0 references
    communication complexity
    0 references
    set disjointness
    0 references
    distributed triangle detection
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references