@article{Li_2021,
    doi = {10.1145/3434340},
    url = {https://doi.org/10.1145%2F3434340},
    year = {2021},
    month = {jan},
    publisher = {Association for Computing Machinery ({ACM})},
    volume = {5},
    number = {{POPL}},
    pages = {1--28},
    author = {Yuanbo Li and Qirun Zhang and Thomas Reps},
    title = {On the complexity of bidirected interleaved Dyck-reachability},
    journal = {Proceedings of the {ACM} on Programming Languages}
}

@article{Li_2021, doi = {10.1145/3434340}, url = {https://doi.org/10.1145%2F3434340}, year = {2021}, month = {jan}, publisher = {Association for Computing Machinery ({ACM})}, volume = {5}, number = {{POPL}}, pages = {1--28}, author = {Yuanbo Li and Qirun Zhang and Thomas Reps}, title = {On the complexity of bidirected interleaved Dyck-reachability}, journal = {Proceedings of the {ACM} on Programming Languages} }