Online computation with untrusted advice
From MaRDI portal
Publication:6564618
DOI10.1016/J.JCSS.2024.103545MaRDI QIDQ6564618
Christoph Dürr, Shahin Kamali, Marc P. Renault, Shendan Jin, Spyros Angelopoulos
Publication date: 1 July 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online bin packing with advice
- Online algorithms with advice for bin packing and scheduling problems
- On the list update problem with advice
- Online computation with advice
- Competitive snoopy caching
- Two results on the list update problem
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- Online bin packing with advice of small size
- Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
- On the Advice Complexity of Online Problems
- Self-adjusting binary search trees
- Improved Randomized On-Line Algorithms for the List Update Problem
- Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
- Algorithms with Predictions
- Measuring the problem-relevant information in input
- A new lower bound for classic online bin packing
- 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)
