P
[Pra24] Aditya Prakash. Checking History-Determinism is NP-hard for Parity Automata. In FoSSaCS'24, Lecture Notes in Computer Science 14574, pages 212-233. Springer-Verlag, April 2024. 
@inproceedings{fossacs2024-Pra,
  author =              {Prakash, Aditya},
  title =               {Checking History-Determinism is {NP}-hard for Parity
                         Automata},
  editor =              {Kobayashi, Naoki and Worrell, James},
  booktitle =           {{P}roceedings of the 27th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'24)},
  acronym =             {{FoSSaCS}'24},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {14574},
  pages =               {212-233},
  year =                {2024},
  month =               apr,
  doi =                 {10.1007/978-3-031-57228-9_11},
}
List of authors