Randomized distributed online algorithms against adaptive offline adversaries

DOI10.1016/J.IPL.2020.105973zbMATH Open1441.68294OpenAlexW3022187609MaRDI QIDQ783703FDOQ783703

Authors: Joan Boyar, Faith Ellen, Kim S. Larsen 

Publication date: 4 August 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.105973

Recommendations

• On the power of randomization in on-line algorithms
• Randomized competitive algorithms for the list update problem
• On randomization in on-line computation.
• Randomization can be as helpful as a glimpse of the future in online computation
• Competitive randomized algorithms for nonuniform problems

zbMATH Keywords

online algorithmsrandomized algorithmsdistributed systemsadaptive offline adversary

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Online algorithms. The state of the art
• On the power of randomization in on-line algorithms
• Two results on the list update problem
• A combined BIT and TIMESTAMP algorithm for the list update problem
• Spreading Rumors Rapidly Despite an Adversary

Cited In (3)

• A reduction theorem for randomized distributed algorithms under weak adversaries
• On the power of randomization in on-line algorithms
• Title not available (Why is that?)

This page was built for publication: Randomized distributed online algorithms against adaptive offline adversaries

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