Sciweavers

7133 search results - page 3 / 1427
» Communication algorithms with advice
Sort
View
104
Voted
ISAAC
2009
Springer
145views Algorithms» more  ISAAC 2009»
15 years 10 months ago
On the Advice Complexity of Online Problems
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
130
Voted
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
150
Voted
ICALP
2011
Springer
14 years 7 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
101
Voted
COCO
2007
Springer
90views Algorithms» more  COCO 2007»
15 years 9 months ago
Quantum versus Classical Proofs and Advice
Scott Aaronson, Greg Kuperberg
70
Voted
STOC
2010
ACM
161views Algorithms» more  STOC 2010»
15 years 8 months ago
A Full Characterization of Quantum Advice
Scott Aaronson and Andrew Drucker