1199 search results - page 134 / 240 » Parameterized Proof Complexity |
SSS
2007
Springer
14 years 3 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
ISAAC
2004
Springer
14 years 2 months 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 ...
PKC
2004
Springer
14 years 2 months ago
2004
Springer
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
JSC
2010
13 years 7 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
APLAS
2005
ACM
14 years 2 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...