24 citations · 166 across the 22 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.GR2015★ 3 cited
Classification of finite groups with toroidal or projective-planar permutability graphs
R. Rajkumar, P. Devi, Andrei Gagarin
Let be a group. The permutability graph of subgroups of , denoted by , is a graph having all the proper subgroups of as its vertices, and two subgroups are adjacen…
cs.DS2015★ 19 cited
Algorithms for the workflow satisfiability problem engineered for counting constraints
D. Cohen, J. Crampton, A. Gagarin +2
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…
cs.CR2015★ 4 cited
On the Workflow Satisfiability Problem with Class-Independent Constraints
Jason Crampton, Andrei Gagarin, Gregory Gutin +2
A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirem…