default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshish Chiplunkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]Archit Bubna
, Ashish Chiplunkar:
Prophet Inequality: Order selection beats random order. EC 2023: 302-336- [c17]Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch:
Online Min-Max Paging. SODA 2023: 1545-1565 - 2022
- [c16]Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price:
Factorial Lower Bounds for (Almost) Random Order Streams. FOCS 2022: 486-497 - [i13]Archit Bubna, Ashish Chiplunkar:
Prophet Inequality: Order selection beats random order. CoRR abs/2211.04145 (2022) - [i12]Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch:
Online Min-Max Paging. CoRR abs/2212.03016 (2022) - 2021
- [c15]Nikhil Ayyadevara, Ashish Chiplunkar:
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. ESA 2021: 9:1-9:11 - [i11]Nikhil Ayyadevara, Ashish Chiplunkar:
The Randomized Competitive Ratio of Weighted $k$-server is at least Exponential. CoRR abs/2102.11119 (2021) - [i10]Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price:
Approximating Local Graph Structure in Almost Random Order Streams. CoRR abs/2110.10091 (2021) - 2020
- [j2]Ashish Chiplunkar, Sundar Vishwanathan:
Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems. ACM Trans. Algorithms 16(1): 14:1-14:28 (2020) - [c14]Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover with Delay - Clairvoyance Is Not Required. ESA 2020: 8:1-8:21 - [c13]Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy:
How to Solve Fair k-Center in Massive Data Models. ICML 2020: 1877-1886 - [i9]Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy:
How to Solve Fair k-Center in Massive Data Models. CoRR abs/2002.07682 (2020)
2010 – 2019
- 2018
- [c12]Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres:
Testing Graph Clusterability: Algorithms and Lower Bounds. FOCS 2018: 497-508 - [c11]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Prophet Secretary: Surpassing the 1-1/e Barrier. EC 2018: 303-318 - [i8]Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover and Vertex Cover with Delay. CoRR abs/1807.08543 (2018) - [i7]Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres:
Testing Graph Clusterability: Algorithms and Lower Bounds. CoRR abs/1808.04807 (2018) - 2017
- [c10]Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, Roger Wattenhofer:
Min-Cost Bipartite Perfect Matching with Delays. APPROX-RANDOM 2017: 1:1-1:20 - [c9]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. SODA 2017: 1051-1061 - [i6]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Prophet Secretary: Surpassing the 1-1/e Barrier. CoRR abs/1711.01834 (2017) - 2016
- [i5]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. CoRR abs/1610.05155 (2016) - 2015
- [j1]Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. Algorithmica 71(1): 219-231 (2015) - [c8]Vijay Gabale, Ashish Chiplunkar:
Approximating deployment costs for (wireless) multi-hop networks. COMSNETS 2015: 1-8 - [c7]Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan:
On Randomized Algorithms for Matching in the Online Preemptive Model. ESA 2015: 325-336 - [c6]Ashish Chiplunkar, Sundar Vishwanathan:
Approximating the Regular Graphic TSP in Near Linear Time. FSTTCS 2015: 125-135 - 2014
- [i4]Ashish Chiplunkar, Sundar Vishwanathan:
Approximating Regular Graphic TSP in near linear time. CoRR abs/1404.2396 (2014) - [i3]Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan:
On Randomized Algorithms for Matching in the Online Preemptive Model. CoRR abs/1412.8615 (2014) - 2013
- [c5]Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. COCOON 2013: 481-492 - [c4]Ashish Chiplunkar, Sundar Vishwanathan:
On Randomized Memoryless Algorithms for the Weighted K-Server Problem. FOCS 2013: 11-19 - [i2]Ashish Chiplunkar, Sundar Vishwanathan:
On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem. CoRR abs/1301.0123 (2013) - 2012
- [c3]Shankara Narayanan Krishna, Lakshmi Manasa, Ashish Chiplunkar:
Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives. ICDCIT 2012: 117-128 - [i1]Ashish Chiplunkar, Sundar Vishwanathan:
Metrical Service Systems with Multiple Servers. CoRR abs/1206.5392 (2012) - 2011
- [c2]Vijay Gabale, Ashish Chiplunkar, Bhaskaran Raman, Partha Dutta:
DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks. COMSNETS 2011: 1-10
2000 – 2009
- 2009
- [c1]Ashish Chiplunkar, Shankara Narayanan Krishna, Chinmay Jain:
Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata. FORMATS 2009: 88-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
