Computing with advice: when knowledge helps

MaRDI QIDQ4584901zbMATH OpenFDO

Authors Stefan Dobrev, Rastislav Královič, Richard Královič

Publication date 4 September 2018

Full work available at URL http://eatcs.org/beatcs/index.php/beatcs/article/view/36/32

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Advice complexity: quantitative approach to a-priori information. Extended abstract
• Online algorithms with advice: the tape model
• Online computation with advice
• How Much Information about the Future Is Needed?
• Online Computation with Advice

Cited in

(9)

• The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
• Distributed computing with advice: information sensitivity of graph coloring
• Modeling time criticality of information
• Labeling schemes for deterministic radio multi-broadcast
• Call admission problems on trees
• scientific article; zbMATH DE number 1670523 (Why is no real title available?)
• Advice complexity: quantitative approach to a-priori information. Extended abstract
• scientific article; zbMATH DE number 7311152 (Why is no real title available?)
• Distributed Computing with Advice: Information Sensitivity of Graph Coloring

This page was built for publication: Computing with advice: when knowledge helps

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