Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3015570282 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.01623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Triangles and Basing Hardness on an Extremely Popular Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between information and communication in broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Proof-Labeling Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span programs for functions with constant-sized 1-certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the distributed Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed algorithms for testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed construction of purely additive spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up the Four Russians Algorithm by About One More Logarithmic Factor / 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: Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting / 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: A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed testing of excluded subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / 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: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4637980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithm for triangle finding in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed steiner forest construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for the Triangle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal bit complexity randomized distributed MIS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight unconditional lower bound on distributed randomwalk computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved combinatorial algorithm for Boolean matrix multiplication / rank
 
Normal rank

Latest revision as of 10:12, 24 July 2024

scientific article
Language Label Description Also known as
English
Fooling views: a new lower bound technique for distributed computations under congestion
scientific article

    Statements

    Fooling views: a new lower bound technique for distributed computations under congestion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references