923 search results - page 8 / 185 » On a generalization of Stickelberger's Theorem |
DAM
1998
13 years 6 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
MCSS
2007
Springer
13 years 6 months ago
2007
Springer
We provide a generalized version of the nonlinear small gain theorem for the case of more than two coupled input-to-state stable (ISS) systems. For this result the interconnection...
JCT
2007
13 years 6 months ago
2007
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
TCC
2004
Springer
14 years 1 days ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
CADE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...