A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Now that we have end-user programming environments capable of empowering kids with no programming background to build games in a matter of hours, a new quest for raising the ceili...
A proliferation of mobile devices in everyday life has increased the likelihood of technologically mediated interruptions. We examine ethnographic data from an SMSbased pervasive ...
Peter Tolmie, Andy Crabtree, Tom Rodden, Steve Ben...
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...