Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CCS
/
Paper
On the parameterized complexity of the workflow satisfiability problem.
Jason Crampton
,
Gregory Z. Gutin
,
Anders Yeo
Venue
A*
CCS
Year
2012
Proceedings
CCS
DBLP record
conf/ccs/CramptonGY12 ↗
Browse the full
CCS paper archive
.