We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
Software designs decay over time. While most studies focus on decay at the system level, this research studies design decay on well understood micro architectures, design patterns...
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
—Concurrent programming with shared memory in an object-oriented language such as Java is notoriously difficult. Therefore, it is important to study new program understanding te...
As the use of social networks becomes more widespread and commonplace, users are beginning to question how their privacy is protected by social networks. In this paper, we review ...
Leanne Wu, Maryam Majedi, Kambiz Ghazinour, Ken Ba...