Skip to content

Author

Debmalya Panigrahi

We have 3 of 181 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Online and Fully-Dynamic Sorting

Online sorting asks how to place $n$ sequentially arriving elements in an array to minimize the sum of absolute differences between consecutive elements. Fully-dynamic sorting further extends the problem to allow both element insertions and deletions. Without recourse, these problems face strong lower bounds on the com...

Y. Azar, S. Bhore, Devdan Dey et al. · 0 citations
Preprint Sep 2026

Online Algorithms with a Sample: Tight Bounds and Adversarial Robustness

The robust variant of the OAS model, in which an adversary is allowed to arbitrarily modify elements of the p-sample, is introduced and the first results for robust algorithms in the OAS setting are presented.

A. Hebbar, Ravi Kumar, Roie Levin et al. · 0 citations
Conference 2026

Learning-Augmented Online Sorting and TSP

It is shown that predictions enable an algorithm that is simultaneously O (1)-consistent and O (log n )-robust for online sorting with predictions, and this result is extended to the setting of multiple predictions.

I. Bercea, G. Brodal, John Iacono et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.