A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity

Authors

• 1. Stefan Mengel (National Centre for Scientific Research; University of Artois)
• 2. Harry Vinall-Smeeth (Ilmenau University of Technology)

@inproceedings{mengel_pods25,
        address = {New York, NY, USA},
        series = {{PODS} '25},
        title = {{A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity}},
        url = {https://dl.acm.org/doi/10.1145/3725225},
        doi = {10.1145/3725225},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Mengel, Stefan and Vinall-Smeeth, Harry},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Semantically Similar Papers