Compatible sequences and a slow Winkler percolation

DOI10.1145/380752.380874MaRDI QIDQ5176028zbMATH OpenOpenAlexFDO

Authors Peter Gács

Publication date 27 February 2015

Published in Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/380752.380874

zbMATH Keywords

dependent percolationdistributed computingscheduling

Mathematics Subject Classification ID

Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• Compatible Sequences and a Slow Winkler Percolation
• On the Compatibility of Binary Sequences
• Clairvoyant scheduling of random walks
• Dependent percolation in two dimensions
• Lipschitz embeddings of random sequences

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited in

(2)

• Compatible Sequences and a Slow Winkler Percolation
• Clairvoyant scheduling of random walks

This page was built for publication: Compatible sequences and a slow Winkler percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176028)