Ashish Chiplunkar

From MaRDI portal
Person:2258083

Available identifiers

zbMath Open chiplunkar.ashishMaRDI QIDQ2258083

List of research outcomes





PublicationDate of PublicationType
Online min-max paging2024-05-14Paper
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential2023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q58744722023-02-07Paper
Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems2021-12-16Paper
Min-Cost Bipartite Perfect Matching with Delays2021-07-28Paper
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q52753622017-07-13Paper
On Randomized Algorithms for Matching in the Online Preemptive Model2015-11-19Paper
Metrical service systems with multiple servers2015-03-02Paper
Metrical Service Systems with Multiple Servers2013-06-11Paper
Model checking logic WCTL with multi constrained modalities on one clock priced timed automata2009-12-01Paper

Research outcomes over time

This page was built for person: Ashish Chiplunkar

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2258083&oldid=7399457"
Powered by MediaWiki