Sciweavers

2414 search results - page 65 / 483
» Computing Normal Subgroups
Sort
View
ASIACRYPT
2000
Springer
14 years 22 hour ago
Key Improvements to XTR
Abstract. This paper describes improved methods for XTR key representation and parameter generation (cf. [4]). If the field characteristic is properly chosen, the size of the XTR ...
Arjen K. Lenstra, Eric R. Verheul
GC
2007
Springer
13 years 7 months ago
Consistent Cycles in Graphs and Digraphs
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...
Stefko Miklavic, Primoz Potocnik, Steve Wilson
JCT
2011
83views more  JCT 2011»
13 years 2 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ENTCS
2006
176views more  ENTCS 2006»
13 years 7 months ago
Gauss: A Framework for Verifying Scientific Computing Software
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
Robert Palmer, Steve Barrus, Yu Yang, Ganesh Gopal...