5 citations · 11 across the 6 of their papers we have counts for
6 papers
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree
Ajoy K. Datta, Stéphane Devismes, Colette Johnen +1
We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019). In this work, we shed new light on a self-stabilizing wave algorit…
Ring Exploration with Oblivious Myopic Robots
Ajoy K. Datta, Anissa Lamani, Lawrence L. Larmore +1
The exploration problem in the discrete universe, using identical oblivious asynchronous robots without direct communication, has been well investigated. These robots have sensors…
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…
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…
Knowledge State Algorithms: Randomization with Limited Information
Wolfgang Bein, Lawrence L. Larmore, Rüdiger Reischuk
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct compe…
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-…