Previous experiments using the minimum-effort coordination game reveal a striking regularity—large groups never coordinate efficiently. Given the frequency with which large real-world groups, such as firms, face similarly difficult coordination problems, this poses an important question: Why do we observe large, successfully coordinated groups in the real world when they are so difficult to cre...

In this paper, we describe simple techniques for object group manipulation, an important operation in user interaction with a Virtual Environment. All presented manipulation techniques exploit constraints to simplify user interaction. The techniques are based on how humans perceive groups and afford direct manipulation of such groups. Furthermore, we introduce two new intuitive ways to create a...

Noninteractive zero-knowledge proofs and noninteractive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficiency has prevented them from being used in practice. One of the roots of this inefficiency is that noninteractive zero-knowledge proofs have been constructed for general NP-complete languages such as Circuit Satisfiability,...

In this paper, without using the classification of finite simple groups, we determine the structure of  finite simple groups whose Sylow 3-subgroups are of the order 9. More precisely, we classify finite simple groups whose Sylow 3-subgroups are elementary abelian of order 9.