New techniques and tighter bounds for local computation algorithms (Q2628795): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5743464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balls into non-uniform bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Introduction to Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Graph Partitions for Approximation and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local computation algorithms for graphs of non-constant degrees / 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: A Local Computation Approximation Scheme to Maximum Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Online Algorithms to Local Computation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Time Local Computation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pseudorandomness for Independence and Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Coloring Algorithms for Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: lgorithmic and Analysis Techniques in Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: How asymmetry helps load balancing / rank
 
Normal rank

Latest revision as of 07:08, 12 July 2024

scientific article
Language Label Description Also known as
English
New techniques and tighter bounds for local computation algorithms
scientific article

    Statements

    New techniques and tighter bounds for local computation algorithms (English)
    0 references
    0 references
    0 references
    15 July 2016
    0 references
    local computation algorithms
    0 references
    sublinear algorithms
    0 references
    pseudorandomness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references