@InProceedings{majumdar_LIPIcs.MFCS.2024.5,
    author = {Majumdar, Rupak},
    title = {{Fine-Grained Complexity of Program Analysis}},
    booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)},
    pages = {5:1--5:1},
    series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    isbn = {978-3-95977-335-5},
    issn = {1868-8969},
    year = {2024},
    volume = {306},
    editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
    address = {Dagstuhl, Germany},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.5},
    urn = {urn:nbn:de:0030-drops-205619},
    doi = {10.4230/LIPIcs.MFCS.2024.5},
    annote = {Keywords: Fine-grained complexity, CFL reachability, 2NPDA recognition, PDA emptiness},
    date-added = {2024-8-27 9:7:43 +0100}
}

@InProceedings{majumdar_LIPIcs.MFCS.2024.5, author = {Majumdar, Rupak}, title = {{Fine-Grained Complexity of Program Analysis}}, booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, pages = {5:1--5:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, isbn = {978-3-95977-335-5}, issn = {1868-8969}, year = {2024}, volume = {306}, editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.5}, urn = {urn:nbn:de:0030-drops-205619}, doi = {10.4230/LIPIcs.MFCS.2024.5}, annote = {Keywords: Fine-grained complexity, CFL reachability, 2NPDA recognition, PDA emptiness}, date-added = {2024-8-27 9:7:43 +0100} }