We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
This study examines the comprehension and modification by novices of programs written with taskspecific and non-task-specific constructs. Teachers who write programs for use in th...
This paper reports on a case study conducted to guide the design and implementation of a group support system. Network analysis of student self-reported interactions was conducted...
Ling Xia, N. Sadat Shami, Y. Connie Yuan, Geri Gay
‘Today’ messages are short status emails sent daily by members of a project team. We present the results of a field study of the use of ‘today’ messages by six small work ...