We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
Siva Anantharaman, Hai Lin, Christopher Lynch, Pal...
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
The assumption of task independence has long been consubstantial with the formulation of many schedulability analysis techniques. That assumption is evidently advantageous for the...
The primary goal of the project was to understand the cultural similarities and differences in perception, adoption and usage of technology across three cultures (US, India and Ch...