default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Pratik Worah

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Pratik Worah

download as .bib file

@article{DBLP:journals/corr/abs-2401-11562,
  author       = {Pratik Worah},
  title        = {Enhancing selectivity using Wasserstein distance based reweighing},
  journal      = {CoRR},
  volume       = {abs/2401.11562},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2401.11562},
  doi          = {10.48550/ARXIV.2401.11562},
  eprinttype    = {arXiv},
  eprint       = {2401.11562},
  timestamp    = {Wed, 07 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-11562.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/GrimmerLWM23,
  author       = {Benjamin Grimmer and
                  Haihao Lu and
                  Pratik Worah and
                  Vahab Mirrokni},
  title        = {The landscape of the proximal point method for nonconvex-nonconcave
                  minimax optimization},
  journal      = {Math. Program.},
  volume       = {201},
  number       = {1},
  pages        = {373--407},
  year         = {2023},
  url          = {https://doi.org/10.1007/s10107-022-01910-8},
  doi          = {10.1007/S10107-022-01910-8},
  timestamp    = {Sat, 05 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GrimmerLWM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icml/FahrbachJMW23,
  author       = {Matthew Fahrbach and
                  Adel Javanmard and
                  Vahab Mirrokni and
                  Pratik Worah},
  editor       = {Andreas Krause and
                  Emma Brunskill and
                  Kyunghyun Cho and
                  Barbara Engelhardt and
                  Sivan Sabato and
                  Jonathan Scarlett},
  title        = {Learning Rate Schedules in the Presence of Distribution Shift},
  booktitle    = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
                  2023, Honolulu, Hawaii, {USA}},
  series       = {Proceedings of Machine Learning Research},
  volume       = {202},
  pages        = {9523--9546},
  publisher    = {{PMLR}},
  year         = {2023},
  url          = {https://proceedings.mlr.press/v202/fahrbach23a.html},
  timestamp    = {Mon, 28 Aug 2023 17:23:08 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/FahrbachJMW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigecom/LemeSTW23,
  author       = {Renato Paes Leme and
                  Balasubramanian Sivan and
                  Yifeng Teng and
                  Pratik Worah},
  editor       = {Kevin Leyton{-}Brown and
                  Jason D. Hartline and
                  Larry Samuelson},
  title        = {Description Complexity of Regular Distributions},
  booktitle    = {Proceedings of the 24th {ACM} Conference on Economics and Computation,
                  {EC} 2023, London, United Kingdom, July 9-12, 2023},
  pages        = {959},
  publisher    = {{ACM}},
  year         = {2023},
  url          = {https://doi.org/10.1145/3580507.3597686},
  doi          = {10.1145/3580507.3597686},
  timestamp    = {Fri, 21 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sigecom/LemeSTW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/LemeSTW23,
  author       = {Renato Paes Leme and
                  Balasubramanian Sivan and
                  Yifeng Teng and
                  Pratik Worah},
  editor       = {Nikhil Bansal and
                  Viswanath Nagarajan},
  title        = {Pricing Query Complexity of Revenue Maximization},
  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2023, Florence, Italy, January 22-25, 2023},
  pages        = {399--415},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977554.ch17},
  doi          = {10.1137/1.9781611977554.CH17},
  timestamp    = {Fri, 17 Feb 2023 09:28:57 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LemeSTW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2303-15634,
  author       = {Matthew Fahrbach and
                  Adel Javanmard and
                  Vahab Mirrokni and
                  Pratik Worah},
  title        = {Learning Rate Schedules in the Presence of Distribution Shift},
  journal      = {CoRR},
  volume       = {abs/2303.15634},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2303.15634},
  doi          = {10.48550/ARXIV.2303.15634},
  eprinttype    = {arXiv},
  eprint       = {2303.15634},
  timestamp    = {Fri, 14 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2303-15634.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2305-05590,
  author       = {Renato Paes Leme and
                  Balasubramanian Sivan and
                  Yifeng Teng and
                  Pratik Worah},
  title        = {Description Complexity of Regular Distributions},
  journal      = {CoRR},
  volume       = {abs/2305.05590},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2305.05590},
  doi          = {10.48550/ARXIV.2305.05590},
  eprinttype    = {arXiv},
  eprint       = {2305.05590},
  timestamp    = {Mon, 15 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2305-05590.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/alt/GrimmerLWM22,
  author       = {Benjamin Grimmer and
                  Haihao Lu and
                  Pratik Worah and
                  Vahab S. Mirrokni},
  editor       = {Sanjoy Dasgupta and
                  Nika Haghtalab},
  title        = {Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via
                  Continuous-Time Systems},
  booktitle    = {International Conference on Algorithmic Learning Theory, 29 March
                  - 1 April 2022, Paris, France},
  series       = {Proceedings of Machine Learning Research},
  volume       = {167},
  pages        = {465--487},
  publisher    = {{PMLR}},
  year         = {2022},
  url          = {https://proceedings.mlr.press/v167/grimmer22a.html},
  timestamp    = {Fri, 10 Mar 2023 11:41:45 +0100},
  biburl       = {https://dblp.org/rec/conf/alt/GrimmerLWM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icml/LemeSTW21,
  author       = {Renato Paes Leme and
                  Balasubramanian Sivan and
                  Yifeng Teng and
                  Pratik Worah},
  editor       = {Marina Meila and
                  Tong Zhang},
  title        = {Learning to Price Against a Moving Target},
  booktitle    = {Proceedings of the 38th International Conference on Machine Learning,
                  {ICML} 2021, 18-24 July 2021, Virtual Event},
  series       = {Proceedings of Machine Learning Research},
  volume       = {139},
  pages        = {6223--6232},
  publisher    = {{PMLR}},
  year         = {2021},
  url          = {http://proceedings.mlr.press/v139/leme21a.html},
  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/LemeSTW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2106-04689,
  author       = {Renato Paes Leme and
                  Balasubramanian Sivan and
                  Yifeng Teng and
                  Pratik Worah},
  title        = {Learning to Price Against a Moving Target},
  journal      = {CoRR},
  volume       = {abs/2106.04689},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.04689},
  eprinttype    = {arXiv},
  eprint       = {2106.04689},
  timestamp    = {Tue, 15 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-04689.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2111-03158,
  author       = {Renato Paes Leme and
                  Balasubramanian Sivan and
                  Yifeng Teng and
                  Pratik Worah},
  title        = {Pricing Query Complexity of Revenue Maximization},
  journal      = {CoRR},
  volume       = {abs/2111.03158},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.03158},
  eprinttype    = {arXiv},
  eprint       = {2111.03158},
  timestamp    = {Wed, 10 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-03158.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2006-08667,
  author       = {Benjamin Grimmer and
                  Haihao Lu and
                  Pratik Worah and
                  Vahab S. Mirrokni},
  title        = {The Landscape of Nonconvex-Nonconcave Minimax Optimization},
  journal      = {CoRR},
  volume       = {abs/2006.08667},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.08667},
  eprinttype    = {arXiv},
  eprint       = {2006.08667},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-08667.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2010-10628,
  author       = {Benjamin Grimmer and
                  Haihao Lu and
                  Pratik Worah and
                  Vahab S. Mirrokni},
  title        = {Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via
                  Continuous-Time Systems},
  journal      = {CoRR},
  volume       = {abs/2010.10628},
  year         = {2020},
  url          = {https://arxiv.org/abs/2010.10628},
  eprinttype    = {arXiv},
  eprint       = {2010.10628},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-10628.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/amcc/Worah18,
  author       = {Pratik Worah},
  title        = {A control version of the Freidlin-Wentzell Theorem},
  booktitle    = {2018 Annual American Control Conference, {ACC} 2018, Milwaukee, WI,
                  USA, June 27-29, 2018},
  pages        = {3951--3954},
  publisher    = {{IEEE}},
  year         = {2018},
  url          = {https://doi.org/10.23919/ACC.2018.8431373},
  doi          = {10.23919/ACC.2018.8431373},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/amcc/Worah18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cikm/PapineniW18,
  author       = {Kishore Papineni and
                  Pratik Worah},
  editor       = {Alfredo Cuzzocrea and
                  James Allan and
                  Norman W. Paton and
                  Divesh Srivastava and
                  Rakesh Agrawal and
                  Andrei Z. Broder and
                  Mohammed J. Zaki and
                  K. Sel{\c{c}}uk Candan and
                  Alexandros Labrinidis and
                  Assaf Schuster and
                  Haixun Wang},
  title        = {A Dynamical System on Bipartite Graphs},
  booktitle    = {Proceedings of the 27th {ACM} International Conference on Information
                  and Knowledge Management, {CIKM} 2018, Torino, Italy, October 22-26,
                  2018},
  pages        = {1479--1482},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3269206.3269271},
  doi          = {10.1145/3269206.3269271},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cikm/PapineniW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/nips/PenningtonW18,
  author       = {Jeffrey Pennington and
                  Pratik Worah},
  editor       = {Samy Bengio and
                  Hanna M. Wallach and
                  Hugo Larochelle and
                  Kristen Grauman and
                  Nicol{\`{o}} Cesa{-}Bianchi and
                  Roman Garnett},
  title        = {The Spectrum of the Fisher Information Matrix of a Single-Hidden-Layer
                  Neural Network},
  booktitle    = {Advances in Neural Information Processing Systems 31: Annual Conference
                  on Neural Information Processing Systems 2018, NeurIPS 2018, December
                  3-8, 2018, Montr{\'{e}}al, Canada},
  pages        = {5415--5424},
  year         = {2018},
  url          = {https://proceedings.neurips.cc/paper/2018/hash/18bb68e2b38e4a8ce7cf4f6b2625768c-Abstract.html},
  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/PenningtonW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/nips/PenningtonW17,
  author       = {Jeffrey Pennington and
                  Pratik Worah},
  editor       = {Isabelle Guyon and
                  Ulrike von Luxburg and
                  Samy Bengio and
                  Hanna M. Wallach and
                  Rob Fergus and
                  S. V. N. Vishwanathan and
                  Roman Garnett},
  title        = {Nonlinear random matrix theory for deep learning},
  booktitle    = {Advances in Neural Information Processing Systems 30: Annual Conference
                  on Neural Information Processing Systems 2017, December 4-9, 2017,
                  Long Beach, CA, {USA}},
  pages        = {2637--2646},
  year         = {2017},
  url          = {https://proceedings.neurips.cc/paper/2017/hash/0f3d014eead934bbdbacb62a01dc4831-Abstract.html},
  timestamp    = {Thu, 21 Jan 2021 13:58:27 +0100},
  biburl       = {https://dblp.org/rec/conf/nips/PenningtonW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jco/Worah15,
  author       = {Pratik Worah},
  title        = {Rank bounds for a hierarchy of Lov{\'{a}}sz and Schrijver},
  journal      = {J. Comb. Optim.},
  volume       = {30},
  number       = {3},
  pages        = {689--709},
  year         = {2015},
  url          = {https://doi.org/10.1007/s10878-013-9662-4},
  doi          = {10.1007/S10878-013-9662-4},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/Worah15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/KhotTW14,
  author       = {Subhash Khot and
                  Madhur Tulsiani and
                  Pratik Worah},
  editor       = {Javier Esparza and
                  Pierre Fraigniaud and
                  Thore Husfeldt and
                  Elias Koutsoupias},
  title        = {The Complexity of Somewhat Approximation Resistant Predicates},
  booktitle    = {Automata, Languages, and Programming - 41st International Colloquium,
                  {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8572},
  pages        = {689--700},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-43948-7\_57},
  doi          = {10.1007/978-3-662-43948-7\_57},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/KhotTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/KhotTW14,
  author       = {Subhash Khot and
                  Madhur Tulsiani and
                  Pratik Worah},
  editor       = {David B. Shmoys},
  title        = {A characterization of strong approximation resistance},
  booktitle    = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
                  May 31 - June 03, 2014},
  pages        = {634--643},
  publisher    = {{ACM}},
  year         = {2014},
  url          = {https://doi.org/10.1145/2591796.2591817},
  doi          = {10.1145/2591796.2591817},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/KhotTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/LeSaulnierPWWW13,
  author       = {Timothy D. LeSaulnier and
                  Noah Prince and
                  Paul S. Wenger and
                  Douglas B. West and
                  Pratik Worah},
  title        = {Total Acquisition in Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {27},
  number       = {4},
  pages        = {1800--1819},
  year         = {2013},
  url          = {https://doi.org/10.1137/110856186},
  doi          = {10.1137/110856186},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/LeSaulnierPWWW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/TulsianiW13,
  author       = {Madhur Tulsiani and
                  Pratik Worah},
  title        = {{LS+} Lower Bounds from Pairwise Independence},
  booktitle    = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
                  2013, K.lo Alto, California, USA, 5-7 June, 2013},
  pages        = {121--132},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/CCC.2013.21},
  doi          = {10.1109/CCC.2013.21},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/TulsianiW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1305-5500,
  author       = {Subhash Khot and
                  Madhur Tulsiani and
                  Pratik Worah},
  title        = {A Characterization of Strong Approximation Resistance},
  journal      = {CoRR},
  volume       = {abs/1305.5500},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.5500},
  eprinttype    = {arXiv},
  eprint       = {1305.5500},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-5500.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/KhotTW13,
  author       = {Subhash Khot and
                  Madhur Tulsiani and
                  Pratik Worah},
  title        = {A Characterization of Strong Approximation Resistance},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-075}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/075},
  eprinttype    = {ECCC},
  eprint       = {TR13-075},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/KhotTW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/KhotTW13a,
  author       = {Subhash Khot and
                  Madhur Tulsiani and
                  Pratik Worah},
  title        = {A Characterization of Approximation Resistance},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-146}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/146},
  eprinttype    = {ECCC},
  eprint       = {TR13-146},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/KhotTW13a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/Worah13,
  author       = {Pratik Worah},
  title        = {A Short Excursion into Semi-Algebraic Hierarchies},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-017}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/017},
  eprinttype    = {ECCC},
  eprint       = {TR13-017},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Worah13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/KhotTW12,
  author       = {Subhash Khot and
                  Madhur Tulsiani and
                  Pratik Worah},
  title        = {The Complexity of Somewhat Approximation Resistant Predicates},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-151}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/151},
  eprinttype    = {ECCC},
  eprint       = {TR12-151},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/KhotTW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/TulsianiW12,
  author       = {Madhur Tulsiani and
                  Pratik Worah},
  title        = {{\textdollar}LS{\_}+{\textdollar} Lower Bounds from Pairwise Independence},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-105}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/105},
  eprinttype    = {ECCC},
  eprint       = {TR12-105},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/TulsianiW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/Worah12,
  author       = {Pratik Worah},
  title        = {Rank Bounds for a Hierarchy of Lov{\'{a}}sz and Schrijver},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-003}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/003},
  eprinttype    = {ECCC},
  eprint       = {TR12-003},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Worah12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcg/EricksonW10,
  author       = {Jeff Erickson and
                  Pratik Worah},
  title        = {Computing the Shortest Essential Cycle},
  journal      = {Discret. Comput. Geom.},
  volume       = {44},
  number       = {4},
  pages        = {912--930},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00454-010-9241-8},
  doi          = {10.1007/S00454-010-9241-8},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcg/EricksonW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GraumanHJKWWWW08,
  author       = {Tracy Grauman and
                  Stephen G. Hartke and
                  Adam S. Jobson and
                  William B. Kinnersley and
                  Douglas B. West and
                  Lesley Wiglesworth and
                  Pratik Worah and
                  Hehui Wu},
  title        = {The hub number of a graph},
  journal      = {Inf. Process. Lett.},
  volume       = {108},
  number       = {4},
  pages        = {226--228},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.ipl.2008.05.022},
  doi          = {10.1016/J.IPL.2008.05.022},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GraumanHJKWWWW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/ChambersEW08,
  author       = {Erin W. Chambers and
                  Jeff Erickson and
                  Pratik Worah},
  editor       = {Monique Teillaud},
  title        = {Testing contractibility in planar rips complexes},
  booktitle    = {Proceedings of the 24th {ACM} Symposium on Computational Geometry,
                  College Park, MD, USA, June 9-11, 2008},
  pages        = {251--259},
  publisher    = {{ACM}},
  year         = {2008},
  url          = {https://doi.org/10.1145/1377676.1377721},
  doi          = {10.1145/1377676.1377721},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/ChambersEW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/WorahS07,
  author       = {Pratik Worah and
                  Sandeep Sen},
  title        = {A linear time deterministic algorithm to find a small subset that
                  approximates the centroid},
  journal      = {Inf. Process. Lett.},
  volume       = {105},
  number       = {1},
  pages        = {17--19},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.ipl.2007.07.008},
  doi          = {10.1016/J.IPL.2007.07.008},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/WorahS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csfw/HuismanWS06,
  author       = {Marieke Huisman and
                  Pratik Worah and
                  Kim Sunesen},
  title        = {A Temporal Logic Characterisation of Observational Determinism},
  booktitle    = {19th {IEEE} Computer Security Foundations Workshop, {(CSFW-19} 2006),
                  5-7 July 2006, Venice, Italy},
  pages        = {3},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/CSFW.2006.6},
  doi          = {10.1109/CSFW.2006.6},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/csfw/HuismanWS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vlsid/BrarBKMWB04,
  author       = {Gurashish Singh Brar and
                  Susmit Biswas and
                  Sudipta Kundu and
                  Arijit Mukhopadhyay and
                  Pratik Worah and
                  Anupam Basu},
  title        = {OaSis: An Application Specific Operating System for an Embedded Environment},
  booktitle    = {17th International Conference on {VLSI} Design {(VLSI} Design 2004),
                  with the 3rd International Conference on Embedded Systems Design,
                  5-9 January 2004, Mumbai, India},
  pages        = {776--779},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/ICVD.2004.1261026},
  doi          = {10.1109/ICVD.2004.1261026},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/vlsid/BrarBKMWB04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vlsid/MukhopadhyayBWDBB04,
  author       = {Arijit Mukhopadhyay and
                  Saptarshi Biswas and
                  Pratik Worah and
                  Ramasish Das and
                  Susmit Biswas and
                  Anupam Basu},
  title        = {Katha-Mala: {A} Voice Output Communication Aid for the Children with
                  Severe Speech and Multiple Disorders {(SSMI)}},
  booktitle    = {17th International Conference on {VLSI} Design {(VLSI} Design 2004),
                  with the 3rd International Conference on Embedded Systems Design,
                  5-9 January 2004, Mumbai, India},
  pages        = {951},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/ICVD.2004.1261053},
  doi          = {10.1109/ICVD.2004.1261053},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/vlsid/MukhopadhyayBWDBB04.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.