5 citations · 14 across the 12 of their papers we have counts for
15 papers
Weighted -Server Admits an Exponentially Competitive Algorithm
Adithya Bijoy, Ankit Mondal, Ashish Chiplunkar
The weighted -server is a variant of the -server problem, where the cost of moving a server is the server's weight times the distance through which it moves. The problem is f…
Trading Prophets: How to Trade Multiple Stocks Optimally
Surbhi Rajput, Ashish Chiplunkar, Rohit Vaish
In the single stock trading prophet problem formulated by Correa et al.\ (2023), an online algorithm observes a sequence of prices of a stock. At each step, the algorithm can eithe…
A Decomposition Approach to the Weighted -server Problem
Nikhil Ayyadevara, Ashish Chiplunkar, Amatya Sharma
A natural variant of the classical online -server problem is the Weighted -server problem, where the cost of moving a server is its weight times the distance through which it…
Online Min-Max Paging
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale +1
Motivated by fairness requirements in communication networks, we introduce a natural variant of the online paging problem, called \textit{min-max} paging, where the objective is to…
Factorial Lower Bounds for (Almost) Random Order Streams
Ashish Chiplunkar, John Kallaugher, Michael Kapralov +1
In this paper we introduce and study the \textsc{StreamingCycles} problem, a random order streaming version of the Boolean Hidden Hypermatching problem that has been instrumental i…
The Randomized Competitive Ratio of Weighted -server is at least Exponential
Nikhil Ayyadevara, Ashish Chiplunkar
The weighted -server problem is a natural generalization of the -server problem in which the cost incurred in moving a server is the distance traveled times the weight of the…