Online computation with untrusted advice

DOI10.1016/J.JCSS.2024.103545MaRDI QIDQ6564618zbMATH OpenFDO

Authors Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault

Publication date 1 July 2024

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

competitive analysisadvice complexityonline computationrobust algorithmsuntrusted advice

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 67465 (Why is no real title available?)
• A new and improved algorithm for online bin packing
• A new lower bound for classic online bin packing
• Advice complexity for a class of online problems
• Algorithms with Predictions
• Competitive snoopy caching
• Contract scheduling with predictions
• Dynamic TCP acknowledgment and other stories about e/(e-1)
• Improved Randomized On-Line Algorithms for the List Update Problem
• Measuring the problem-relevant information in input
• On the Advice Complexity of Online Problems
• Online algorithms with advice for bin packing and scheduling problems
• Online bin packing with advice
• Online bin packing with advice of small size
• Online computation with advice
• Optimal scheduling of contract algorithms for anytime problem-solving
• Randomization can be as helpful as a glimpse of the future in online computation
• Self-adjusting binary search trees
• Two results on the list update problem

This page was built for publication: Online computation with untrusted advice

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