Ashish Chiplunkar

Orcid: 0000-0002-6661-8124

According to our database1, Ashish Chiplunkar authored at least 23 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Online Min-Max Paging.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Prophet Inequality: Order selection beats random order.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Factorial Lower Bounds for (Almost) Random Order Streams.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Approximating Local Graph Structure in Almost Random Order Streams.
CoRR, 2021

The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Randomized Memoryless Algorithms for the Weighted and the Generalized <i>k</i>-server Problems.
ACM Trans. Algorithms, 2020

How to Solve Fair k-Center in Massive Data Models.
Proceedings of the 37th International Conference on Machine Learning, 2020

Set Cover with Delay - Clairvoyance Is Not Required.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018
Set Cover and Vertex Cover with Delay.
CoRR, 2018

Prophet Secretary: Surpassing the 1-1/e Barrier.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Testing Graph Clusterability: Algorithms and Lower Bounds.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Min-Cost Bipartite Perfect Matching with Delays.
Proceedings of the Approximation, 2017

2016
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.
CoRR, 2016

2015
Metrical Service Systems with Multiple Servers.
Algorithmica, 2015

Approximating the Regular Graphic TSP in Near Linear Time.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

On Randomized Algorithms for Matching in the Online Preemptive Model.
Proceedings of the Algorithms - ESA 2015, 2015

Approximating deployment costs for (wireless) multi-hop networks.
Proceedings of the 7th International Conference on Communication Systems and Networks, 2015

2013
On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem
CoRR, 2013

On Randomized Memoryless Algorithms for the Weighted K-Server Problem.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives.
Proceedings of the Distributed Computing and Internet Technology, 2012

2011
DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks.
Proceedings of the Third International Conference on Communication Systems and Networks, 2011

2009
Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009


  Loading...