2436 search results - page 61 / 488 » Comonadic Notions of Computation |
INFORMATICALT
2010
13 years 7 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
ICS
2010
Tsinghua U.
14 years 7 months ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
TCC
2005
Springer
14 years 3 months ago
2005
Springer
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...