5 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2009★ 1 cited
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
Wolfgang Bein, Leah Epstein, Lawrence L. Larmore +1
We consider the online list s-batch problem, where all the jobs have processing time 1 and we seek to minimize the sum of the completion times of the jobs. We give a Java program w…
cs.NI2008
Self-stabilizing K-out-of-L exclusion on tree network
Ajoy K. Datta, Stéphane Devismes, Florian Horn +1
In this paper, we address the problem of K-out-of-L exclusion, a generalization of the mutual exclusion problem, in which there are units of a shared resource, and any proce…
cs.DS2006★ 5 cited
T-Theory Applications to Online Algorithms for the Server Problem
Lawrence L. Larmore, James A. Oravec
Although largely unnoticed by the online algorithms community, T-theory, a field of discrete mathematics, has contributed to the development of several online algorithms for the k-…