5 citations · 14 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
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…
cs.DS2021
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…