Online computation with untrusted advice
From MaRDI portal
Publication:6564618
DOI10.1016/J.JCSS.2024.103545MaRDI QIDQ6564618FDOQ6564618
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)
Cites Work
- Online bin packing with advice
- On the Advice Complexity of Online Problems
- Online algorithms with advice for bin packing and scheduling problems
- Measuring the problem-relevant information in input
- Online computation with advice
- Two results on the list update problem
- Self-adjusting binary search trees
- Competitive snoopy caching
- Improved Randomized On-Line Algorithms for the List Update Problem
- A new lower bound for classic online bin packing
- Advice complexity for a class of online problems
- Randomization can be as helpful as a glimpse of the future in online computation
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- A new and improved algorithm for online bin packing
- Title not available (Why is that?)
- Optimal scheduling of contract algorithms for anytime problem-solving
- Online bin packing with advice of small size
- Algorithms with Predictions
- Contract scheduling with predictions
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)
