332 search results - page 8 / 67 » Compositions of Graphs Revisited |
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
EUROCRYPT
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
ECOWS
2007
Springer
14 years 1 months ago
2007
Springer
Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of serviceoriented applications. It is widely rec...