The following pages link to Online computation with advice (Q541670):
Displaying 13 items.
- Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
- (Q5875754) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Deterministic size discovery and topology recognition in radio networks with short labels (Q6040656) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Length-Weighted Disjoint Path Allocation (Q6163628) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
- Online computation with untrusted advice (Q6564618) (← links)
- Priority algorithms with advice for disjoint path allocation problems (Q6639746) (← links)