On contention resolution protocols and associated probabilistic phenomena
From MaRDI portal
Publication:5890840
DOI10.1145/195058.195122zbMath1344.68039OpenAlexW2000598482MaRDI QIDQ5890840
No author found.
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195122
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Network protocols (68M12)
Related Items (7)
Exploiting storage redundancy to speed up randomized shared memory simulations ⋮ Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ ERCW PRAMs and optical communication ⋮ Shared memory simulations with triple-logarithmic delay ⋮ Appearance of complex components in a random bigraph ⋮ A lower bound for communication on the crossbar ⋮ Stochastic Contention Resolution With Short Delays
This page was built for publication: On contention resolution protocols and associated probabilistic phenomena
