5 citations · 5 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Advice Complexity of Priority Algorithms
Allan Borodin, Joan Boyar, Kim S. Larsen +1
The priority model of "greedy-like" algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms to have access to advi…
cs.DS2018
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing
Joan Boyar, Faith Ellen, Kim S. Larsen
This work is a continuation of efforts to define and understand competitive analysis of algorithms in a distributed shared memory setting, which is surprisingly different from the…