scientific article; zbMATH DE number 7650400

DOI10.4230/LIPICS.ITCS.2020.52MaRDI QIDQ5875754zbMATH OpenFDO

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

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1905.05655

zbMATH Keywords

advice complexitycompetitive analysisonline computationrobust algorithmsuntrusted advice

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the power of randomness versus advice in online computation
• Online Computation with Advice
• Online computation with advice
• Secure multi-party computation minimizing online rounds
• Online Metric Algorithms with Untrusted Predictions
• Randomized online computation with high probability guarantees
• Randomized distributed online algorithms against adaptive offline adversaries
• On-line/off-line leakage resilient secure computation protocols
• Near-linear unconditionally-secure multiparty computation with a dishonest minority

Cited in

(13)

• Machine learning advised algorithms for the ski rental problem with a discount
• Online Metric Algorithms with Untrusted Predictions
• Online interval scheduling with predictions
• Online search with a hint
• Contract scheduling with predictions
• Tree coloring with predictions
• Online bin covering with frequency predictions
• A survey of online knapsack problems
• Non-clairvoyant makespan minimization scheduling with predictions
• Learning-augmented query policies for minimum spanning tree with uncertainty
• Online unbounded knapsack
• Primal-dual algorithms with predictions for online bounded allocation and ad-auctions problems
• Online search with a hint

This page was built for publication:

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