3454 search results - page 335 / 691 » Modern computer algebra |
170
click to vote
ISAAC
2004
Springer
16 years 3 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
177
click to vote
WG
2004
Springer
16 years 2 days ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
189
click to vote
SAC
2003
ACM
16 years 1 hour ago
2003
ACM
A fundamental issue in the engineering of coordination models is n coordination abstractions that are correct with respect to the specification of the coordination model they imp...
163
click to vote
FCT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
184
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...