562 search results - page 75 / 113 » Concurrent Turing Machines |
147
click to vote
PPOPP
2011
ACM
14 years 2 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
104
click to vote
DC
2008
14 years 12 months ago
2008
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
LMCS
2007
14 years 11 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
EUROSYS
2006
ACM
15 years 9 months ago
2006
ACM
Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This pap...