Synchronous text communication is becoming recognized as a valuable workplace communication medium yet some studies of group text chat indicate that its properties can lead to int...
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
This paper reports on a study of clinicians who care for diabetic patients, and on the design of an application to support their work. The clinicians' long-term activity is r...
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
This paper examines how software developers discuss users and how such discussions are intrinsic to the negotiation and settling of technical decisions in the development and test...