Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOSSACS
/
Paper
Checking History-Determinism is NP-hard for Parity Automata.
Aditya Prakash
Venue
B
FOSSACS
Year
2024
Proceedings
FoSSaCS (1)
DBLP record
conf/fossacs/Prakash24 ↗
Browse the full
FOSSACS paper archive
.