Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Philip W. L. Fong
Satisfiability and Feasibility in a Relationship-Based Workflow Authorization Model
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem With User-Independent Constraints
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory
Proceedings of the AAAI Conference on Artificial Intelligence
Formal Policy Based Authorization Model for Ubiquitous Enterprise Computing Environment
International Journal of Computer Applications
Smten With Satisfiability-Based Search
Supporting Authorization Reasoning Based on Role and Resource Hierarchies in an Ontology-Enriched XACML Model
International Journal of Computer and Communication Engineering
Workflow Model With Version Change Based on Task-Relationships
Capability-Based Authorization for HEP
EPJ Web of Conferences
Astronomy
Physics
Formal Model Based Specification of Authorization Framework for Ubiquitous Enterprise Computing Environment
International Journal of Computer Applications
