1368 search results - page 1 / 274 » Perfect Local Computability and Computable Simulations |
CIE
2008
Springer
13 years 7 months ago
2008
Springer
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
GLVLSI
2007
IEEE
13 years 9 months ago
2007
IEEE
he abstract and simple computation and communication mechanism in the synchronous computational model it is easy to simulate synchronous systems and to apply formal verification m...
JOC
2000
13 years 5 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
ICCI
1993
13 years 9 months ago
1993
Locking and timestamping are two popular approaches to concurrency control in databases systems. Although more than a dozen analytic performance studies of locking techniques have...
IANDC
2007
13 years 5 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...