Computing with advice: when knowledge helps

zbMATH Open1394.68149MaRDI QIDQ4584901FDOQ4584901

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

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

Mathematics Subject Classification ID

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

Cited In (9)

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

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)