Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Diptarka Chakraborty, Gunjan Kumar, and Kuldeep S. Meel. Support Size Estimation: The Power of Conditioning. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 33:1-33:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chakraborty_et_al:LIPIcs.MFCS.2023.33, author = {Chakraborty, Diptarka and Kumar, Gunjan and Meel, Kuldeep S.}, title = {{Support Size Estimation: The Power of Conditioning}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {33:1--33:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.33}, URN = {urn:nbn:de:0030-drops-185675}, doi = {10.4230/LIPIcs.MFCS.2023.33}, annote = {Keywords: Support-size estimation, Distribution testing, Conditional sampling, Lower bound} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar, and Kuldeep S. Meel. Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 123:1-123:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chakraborty_et_al:LIPIcs.ICALP.2023.123, author = {Chakraborty, Diptarka and Chakraborty, Sourav and Kumar, Gunjan and Meel, Kuldeep S.}, title = {{Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {123:1--123:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.123}, URN = {urn:nbn:de:0030-drops-181750}, doi = {10.4230/LIPIcs.ICALP.2023.123}, annote = {Keywords: Model counting, Approximation, Satisfiability, NP oracle, SAT oracle} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Antonios Antoniadis, Gunjan Kumar, and Nikhil Kumar. Skeletons and Minimum Energy Scheduling. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 51:1-51:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{antoniadis_et_al:LIPIcs.ISAAC.2021.51, author = {Antoniadis, Antonios and Kumar, Gunjan and Kumar, Nikhil}, title = {{Skeletons and Minimum Energy Scheduling}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {51:1--51:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.51}, URN = {urn:nbn:de:0030-drops-154849}, doi = {10.4230/LIPIcs.ISAAC.2021.51}, annote = {Keywords: scheduling, energy-efficiency, approximation algorithms, dynamic programming, combinatorial algorithms} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Umang Bhaskar and Gunjan Kumar. Partial Function Extension with Applications to Learning and Property Testing. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 46:1-46:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhaskar_et_al:LIPIcs.ISAAC.2020.46, author = {Bhaskar, Umang and Kumar, Gunjan}, title = {{Partial Function Extension with Applications to Learning and Property Testing}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {46:1--46:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.46}, URN = {urn:nbn:de:0030-drops-133906}, doi = {10.4230/LIPIcs.ISAAC.2020.46}, annote = {Keywords: Partial function extension, subadditivity, matroid rank, approximation algorithms, learning, property testing} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Umang Bhaskar and Gunjan Kumar. The Complexity of Partial Function Extension for Coverage Functions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 30:1-30:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{bhaskar_et_al:LIPIcs.APPROX-RANDOM.2019.30, author = {Bhaskar, Umang and Kumar, Gunjan}, title = {{The Complexity of Partial Function Extension for Coverage Functions}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {30:1--30:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.30}, URN = {urn:nbn:de:0030-drops-112457}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.30}, annote = {Keywords: Coverage Functions, PAC Learning, Approximation Algorithm, Partial Function Extension} }
Feedback for Dagstuhl Publishing