Sciweavers

2537 search results - page 116 / 508
» How to draw a group
Sort
View
EUROCRYPT
1999
Springer
14 years 1 months ago
On the Performance of Hyperelliptic Cryptosystems
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
Nigel P. Smart
DSN
2004
IEEE
14 years 18 days ago
Support for Mobility and Fault Tolerance in Mykil
This paper describes the support provided for mobility and fault tolerance in Mykil, which is a key distribution protocol for large, secure group multicast. Mykil is based on a com...
Jyh-How Huang, Shivakant Mishra
HICSS
1995
IEEE
145views Biometrics» more  HICSS 1995»
14 years 12 days ago
Coordination breakdowns: why groupware is so difficult to design
The complexity of group interaction means that there will be many uncertainties in the requirements for software support tools. Many existing software systems rely on the adaptabi...
Steve M. Easterbrook
JCT
2008
85views more  JCT 2008»
13 years 8 months ago
Smith normal form and Laplacians
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
Dino J. Lorenzini
COMBINATORICS
2002
107views more  COMBINATORICS 2002»
13 years 8 months ago
Combinatorial Laplacian of the Matching Complex
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
Xun Dong, Michelle L. Wachs