default search action
BibTeX records: Ashish Chiplunkar
@inproceedings{DBLP:conf/sigecom/BubnaC23, author = {Archit Bubna and Ashish Chiplunkar}, editor = {Kevin Leyton{-}Brown and Jason D. Hartline and Larry Samuelson}, title = {Prophet Inequality: Order selection beats random order}, booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation, {EC} 2023, London, United Kingdom, July 9-12, 2023}, pages = {302--336}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3580507.3597687}, doi = {10.1145/3580507.3597687}, timestamp = {Fri, 21 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/BubnaC23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChiplunkarHKV23, author = {Ashish Chiplunkar and Monika Henzinger and Sagar Sudhir Kale and Maximilian V{\"{o}}tsch}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Online Min-Max Paging}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {1545--1565}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch57}, doi = {10.1137/1.9781611977554.CH57}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChiplunkarHKV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChiplunkarKK022, author = {Ashish Chiplunkar and John Kallaugher and Michael Kapralov and Eric Price}, title = {Factorial Lower Bounds for (Almost) Random Order Streams}, booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2022, Denver, CO, USA, October 31 - November 3, 2022}, pages = {486--497}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/FOCS54457.2022.00053}, doi = {10.1109/FOCS54457.2022.00053}, timestamp = {Sat, 31 Dec 2022 17:14:50 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChiplunkarKK022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-04145, author = {Archit Bubna and Ashish Chiplunkar}, title = {Prophet Inequality: Order selection beats random order}, journal = {CoRR}, volume = {abs/2211.04145}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.04145}, doi = {10.48550/ARXIV.2211.04145}, eprinttype = {arXiv}, eprint = {2211.04145}, timestamp = {Thu, 10 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-04145.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2212-03016, author = {Ashish Chiplunkar and Monika Henzinger and Sagar Sudhir Kale and Maximilian V{\"{o}}tsch}, title = {Online Min-Max Paging}, journal = {CoRR}, volume = {abs/2212.03016}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2212.03016}, doi = {10.48550/ARXIV.2212.03016}, eprinttype = {arXiv}, eprint = {2212.03016}, timestamp = {Thu, 08 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2212-03016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AyyadevaraC21, author = {Nikhil Ayyadevara and Ashish Chiplunkar}, editor = {Petra Mutzel and Rasmus Pagh and Grzegorz Herman}, title = {The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential}, booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)}, series = {LIPIcs}, volume = {204}, pages = {9:1--9:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ESA.2021.9}, doi = {10.4230/LIPICS.ESA.2021.9}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/AyyadevaraC21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-11119, author = {Nikhil Ayyadevara and Ashish Chiplunkar}, title = {The Randomized Competitive Ratio of Weighted {\textdollar}k{\textdollar}-server is at least Exponential}, journal = {CoRR}, volume = {abs/2102.11119}, year = {2021}, url = {https://arxiv.org/abs/2102.11119}, eprinttype = {arXiv}, eprint = {2102.11119}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-11119.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-10091, author = {Ashish Chiplunkar and John Kallaugher and Michael Kapralov and Eric Price}, title = {Approximating Local Graph Structure in Almost Random Order Streams}, journal = {CoRR}, volume = {abs/2110.10091}, year = {2021}, url = {https://arxiv.org/abs/2110.10091}, eprinttype = {arXiv}, eprint = {2110.10091}, timestamp = {Tue, 26 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-10091.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/ChiplunkarV20, author = {Ashish Chiplunkar and Sundar Vishwanathan}, title = {Randomized Memoryless Algorithms for the Weighted and the Generalized \emph{k}-server Problems}, journal = {{ACM} Trans. Algorithms}, volume = {16}, number = {1}, pages = {14:1--14:28}, year = {2020}, url = {https://doi.org/10.1145/3365002}, doi = {10.1145/3365002}, timestamp = {Fri, 24 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/ChiplunkarV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AzarCKT20, author = {Yossi Azar and Ashish Chiplunkar and Shay Kutten and Noam Touitou}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {Set Cover with Delay - Clairvoyance Is Not Required}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {8:1--8:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.8}, doi = {10.4230/LIPICS.ESA.2020.8}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/AzarCKT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/ChiplunkarKR20, author = {Ashish Chiplunkar and Sagar Sudhir Kale and Sivaramakrishnan Natarajan Ramamoorthy}, title = {How to Solve Fair k-Center in Massive Data Models}, booktitle = {Proceedings of the 37th International Conference on Machine Learning, {ICML} 2020, 13-18 July 2020, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {119}, pages = {1877--1886}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v119/chiplunkar20a.html}, timestamp = {Thu, 08 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icml/ChiplunkarKR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-07682, author = {Ashish Chiplunkar and Sagar Sudhir Kale and Sivaramakrishnan Natarajan Ramamoorthy}, title = {How to Solve Fair k-Center in Massive Data Models}, journal = {CoRR}, volume = {abs/2002.07682}, year = {2020}, url = {https://arxiv.org/abs/2002.07682}, eprinttype = {arXiv}, eprint = {2002.07682}, timestamp = {Thu, 08 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-07682.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChiplunkarKKMP18, author = {Ashish Chiplunkar and Michael Kapralov and Sanjeev Khanna and Aida Mousavifar and Yuval Peres}, editor = {Mikkel Thorup}, title = {Testing Graph Clusterability: Algorithms and Lower Bounds}, booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2018, Paris, France, October 7-9, 2018}, pages = {497--508}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/FOCS.2018.00054}, doi = {10.1109/FOCS.2018.00054}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChiplunkarKKMP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/AzarCK18, author = {Yossi Azar and Ashish Chiplunkar and Haim Kaplan}, editor = {{\'{E}}va Tardos and Edith Elkind and Rakesh Vohra}, title = {Prophet Secretary: Surpassing the 1-1/e Barrier}, booktitle = {Proceedings of the 2018 {ACM} Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018}, pages = {303--318}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3219166.3219182}, doi = {10.1145/3219166.3219182}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/AzarCK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-08543, author = {Yossi Azar and Ashish Chiplunkar and Shay Kutten and Noam Touitou}, title = {Set Cover and Vertex Cover with Delay}, journal = {CoRR}, volume = {abs/1807.08543}, year = {2018}, url = {http://arxiv.org/abs/1807.08543}, eprinttype = {arXiv}, eprint = {1807.08543}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-08543.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1808-04807, author = {Ashish Chiplunkar and Michael Kapralov and Sanjeev Khanna and Aida Mousavifar and Yuval Peres}, title = {Testing Graph Clusterability: Algorithms and Lower Bounds}, journal = {CoRR}, volume = {abs/1808.04807}, year = {2018}, url = {http://arxiv.org/abs/1808.04807}, eprinttype = {arXiv}, eprint = {1808.04807}, timestamp = {Sun, 02 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1808-04807.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AshlagiACCGKMWW17, author = {Itai Ashlagi and Yossi Azar and Moses Charikar and Ashish Chiplunkar and Ofir Geri and Haim Kaplan and Rahul Makhijani and Yuyi Wang and Roger Wattenhofer}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Williamson and Santosh S. Vempala}, title = {Min-Cost Bipartite Perfect Matching with Delays}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {81}, pages = {1:1--1:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1}, doi = {10.4230/LIPICS.APPROX-RANDOM.2017.1}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/AshlagiACCGKMWW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AzarCK17, author = {Yossi Azar and Ashish Chiplunkar and Haim Kaplan}, editor = {Philip N. Klein}, title = {Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {1051--1061}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.67}, doi = {10.1137/1.9781611974782.67}, timestamp = {Tue, 02 Feb 2021 17:07:33 +0100}, biburl = {https://dblp.org/rec/conf/soda/AzarCK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-01834, author = {Yossi Azar and Ashish Chiplunkar and Haim Kaplan}, title = {Prophet Secretary: Surpassing the 1-1/e Barrier}, journal = {CoRR}, volume = {abs/1711.01834}, year = {2017}, url = {http://arxiv.org/abs/1711.01834}, eprinttype = {arXiv}, eprint = {1711.01834}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-01834.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AzarCK16, author = {Yossi Azar and Ashish Chiplunkar and Haim Kaplan}, title = {Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays}, journal = {CoRR}, volume = {abs/1610.05155}, year = {2016}, url = {http://arxiv.org/abs/1610.05155}, eprinttype = {arXiv}, eprint = {1610.05155}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AzarCK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChiplunkarV15, author = {Ashish Chiplunkar and Sundar Vishwanathan}, title = {Metrical Service Systems with Multiple Servers}, journal = {Algorithmica}, volume = {71}, number = {1}, pages = {219--231}, year = {2015}, url = {https://doi.org/10.1007/s00453-014-9903-7}, doi = {10.1007/S00453-014-9903-7}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChiplunkarV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/comsnets/GabaleC15, author = {Vijay Gabale and Ashish Chiplunkar}, title = {Approximating deployment costs for (wireless) multi-hop networks}, booktitle = {7th International Conference on Communication Systems and Networks, {COMSNETS} 2015, Bangalore, India, January 6-10, 2015}, pages = {1--8}, publisher = {{IEEE}}, year = {2015}, url = {https://doi.org/10.1109/COMSNETS.2015.7098666}, doi = {10.1109/COMSNETS.2015.7098666}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/comsnets/GabaleC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ChiplunkarTV15, author = {Ashish Chiplunkar and Sumedh Tirodkar and Sundar Vishwanathan}, editor = {Nikhil Bansal and Irene Finocchi}, title = {On Randomized Algorithms for Matching in the Online Preemptive Model}, booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9294}, pages = {325--336}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48350-3\_28}, doi = {10.1007/978-3-662-48350-3\_28}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/esa/ChiplunkarTV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/ChiplunkarV15, author = {Ashish Chiplunkar and Sundar Vishwanathan}, editor = {Prahladh Harsha and G. Ramalingam}, title = {Approximating the Regular Graphic {TSP} in Near Linear Time}, booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015, Bangalore, India}, series = {LIPIcs}, volume = {45}, pages = {125--135}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.125}, doi = {10.4230/LIPICS.FSTTCS.2015.125}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/ChiplunkarV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChiplunkarV14, author = {Ashish Chiplunkar and Sundar Vishwanathan}, title = {Approximating Regular Graphic {TSP} in near linear time}, journal = {CoRR}, volume = {abs/1404.2396}, year = {2014}, url = {http://arxiv.org/abs/1404.2396}, eprinttype = {arXiv}, eprint = {1404.2396}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChiplunkarV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChiplunkarTV14, author = {Ashish Chiplunkar and Sumedh Tirodkar and Sundar Vishwanathan}, title = {On Randomized Algorithms for Matching in the Online Preemptive Model}, journal = {CoRR}, volume = {abs/1412.8615}, year = {2014}, url = {http://arxiv.org/abs/1412.8615}, eprinttype = {arXiv}, eprint = {1412.8615}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChiplunkarTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/ChiplunkarV13, author = {Ashish Chiplunkar and Sundar Vishwanathan}, editor = {Ding{-}Zhu Du and Guochuan Zhang}, title = {Metrical Service Systems with Multiple Servers}, booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON} 2013, Hangzhou, China, June 21-23, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7936}, pages = {481--492}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38768-5\_43}, doi = {10.1007/978-3-642-38768-5\_43}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/ChiplunkarV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChiplunkarV13, author = {Ashish Chiplunkar and Sundar Vishwanathan}, title = {On Randomized Memoryless Algorithms for the Weighted K-Server Problem}, booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2013, 26-29 October, 2013, Berkeley, CA, {USA}}, pages = {11--19}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/FOCS.2013.10}, doi = {10.1109/FOCS.2013.10}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChiplunkarV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-0123, author = {Ashish Chiplunkar and Sundar Vishwanathan}, title = {On the Competitiveness of Randomized Memoryless Algorithms for the Weighted {\textdollar}k{\textdollar}-server Problem}, journal = {CoRR}, volume = {abs/1301.0123}, year = {2013}, url = {http://arxiv.org/abs/1301.0123}, eprinttype = {arXiv}, eprint = {1301.0123}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-0123.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdcit/KrishnaMC12, author = {Shankara Narayanan Krishna and Lakshmi Manasa and Ashish Chiplunkar}, editor = {Ramaswamy Ramanujam and Srini Ramaswamy}, title = {Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives}, booktitle = {Distributed Computing and Internet Technology - 8th International Conference, {ICDCIT} 2012, Bhubaneswar, India, February 2-4, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7154}, pages = {117--128}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-28073-3\_11}, doi = {10.1007/978-3-642-28073-3\_11}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/icdcit/KrishnaMC12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-5392, author = {Ashish Chiplunkar and Sundar Vishwanathan}, title = {Metrical Service Systems with Multiple Servers}, journal = {CoRR}, volume = {abs/1206.5392}, year = {2012}, url = {http://arxiv.org/abs/1206.5392}, eprinttype = {arXiv}, eprint = {1206.5392}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-5392.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/comsnets/GabaleCRD11, author = {Vijay Gabale and Ashish Chiplunkar and Bhaskaran Raman and Partha Dutta}, editor = {David B. Johnson and Anurag Kumar}, title = {DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks}, booktitle = {Third International Conference on Communication Systems and Networks, {COMSNETS} 2011, Bangalore, India, January 4-8, 2011}, pages = {1--10}, publisher = {{IEEE}}, year = {2011}, url = {https://doi.org/10.1109/COMSNETS.2011.5716467}, doi = {10.1109/COMSNETS.2011.5716467}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/comsnets/GabaleCRD11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/formats/ChiplunkarKJ09, author = {Ashish Chiplunkar and Shankara Narayanan Krishna and Chinmay Jain}, editor = {Jo{\"{e}}l Ouaknine and Frits W. Vaandrager}, title = {Model Checking Logic {WCTL} with Multi Constrained Modalities on One Clock Priced Timed Automata}, booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference, {FORMATS} 2009, Budapest, Hungary, September 14-16, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5813}, pages = {88--102}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04368-0\_9}, doi = {10.1007/978-3-642-04368-0\_9}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/formats/ChiplunkarKJ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.