Published in: LIPIcs, Volume 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)
Prerona Chatterjee, Kshitij Gajjar, and Anamay Tengse. Monotone Classes Beyond VNP. In 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 284, pp. 11:1-11:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chatterjee_et_al:LIPIcs.FSTTCS.2023.11, author = {Chatterjee, Prerona and Gajjar, Kshitij and Tengse, Anamay}, title = {{Monotone Classes Beyond VNP}}, booktitle = {43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)}, pages = {11:1--11:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-304-1}, ISSN = {1868-8969}, year = {2023}, volume = {284}, editor = {Bouyer, Patricia and Srinivasan, Srikanth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.11}, URN = {urn:nbn:de:0030-drops-193846}, doi = {10.4230/LIPIcs.FSTTCS.2023.11}, annote = {Keywords: Algebraic Complexity, Monotone Computation, VPSPACE, Transparent Polynomials} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Florian Barth, Stefan Funke, and Claudius Proissl. An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 14:1-14:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{barth_et_al:LIPIcs.ESA.2022.14, author = {Barth, Florian and Funke, Stefan and Proissl, Claudius}, title = {{An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.14}, URN = {urn:nbn:de:0030-drops-169525}, doi = {10.4230/LIPIcs.ESA.2022.14}, annote = {Keywords: Parametric Shortest Paths, Extreme Shortest Paths} }
Published in: LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)
Diptarka Chakraborty, Kshitij Gajjar, and Agastya Vibhuti Jha. Approximating the Center Ranking Under Ulam. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 213, pp. 12:1-12:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chakraborty_et_al:LIPIcs.FSTTCS.2021.12, author = {Chakraborty, Diptarka and Gajjar, Kshitij and Jha, Agastya Vibhuti}, title = {{Approximating the Center Ranking Under Ulam}}, booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)}, pages = {12:1--12:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-215-0}, ISSN = {1868-8969}, year = {2021}, volume = {213}, editor = {Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.12}, URN = {urn:nbn:de:0030-drops-155230}, doi = {10.4230/LIPIcs.FSTTCS.2021.12}, annote = {Keywords: Center Problem, Ulam Metric, Edit Distance, Closest String, Approximation Algorithms} }
Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Prerona Chatterjee. Separating ABPs and Some Structured Formulas in the Non-Commutative Setting. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 7:1-7:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chatterjee:LIPIcs.CCC.2021.7, author = {Chatterjee, Prerona}, title = {{Separating ABPs and Some Structured Formulas in the Non-Commutative Setting}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {7:1--7:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.7}, URN = {urn:nbn:de:0030-drops-142812}, doi = {10.4230/LIPIcs.CCC.2021.7}, annote = {Keywords: Non-Commutative Formulas, Lower Bound, Separating ABPs and Formulas} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Kshitij Gajjar and Jaikumar Radhakrishnan. Distance-Preserving Subgraphs of Interval Graphs. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 39:1-39:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gajjar_et_al:LIPIcs.ESA.2017.39, author = {Gajjar, Kshitij and Radhakrishnan, Jaikumar}, title = {{Distance-Preserving Subgraphs of Interval Graphs}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {39:1--39:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.39}, URN = {urn:nbn:de:0030-drops-78798}, doi = {10.4230/LIPIcs.ESA.2017.39}, annote = {Keywords: interval graphs, shortest path, distance-preserving subgraphs, bit-reversal permutation matrix} }
Feedback for Dagstuhl Publishing