AbstractThe main tool to obtain a tight deterministic time hierarchy for Turing machines is a new data structure for fast distributed counting. The data structure representes an integer in a redundant manner, and it is able to accept orders from many places to increase or decrease the integer value by 1. With the help of the new data structure, it is shown that the slightest increase in computation time allows k-tape Turing machines (for fixed k ⩾ 2) to solve new problems
We show that randomization can lead to significant improvements for a few fundamental problems in di...
In both distributed counting and queuing, processors in a distributed system issue operations which ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
A distributed counter is a concurrent object which provides a test-and-incrementoperation on a share...
The importance of distributed data structures for sharing a high data access load among the processo...
this paper, we propose an efficient linearizable counter. The definition of efficiency for distribut...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
A distributed counter allows each processor in an asynchronous message passing network to access the...
AbstractThe aim of this paper is to outline a combinatorial structure appearing in distributed compu...
AbstractThe time separation results concerning classes of languages over a single-letter alphabet ac...
Toda proved a remarkable connection between the polynomial hierarchy and the counting classes. Tarui...
We present the design and implementation of a parallel algorithm for computing Gröbner bases on dist...
This paper presents a pragmatic algorithm to buil a global time on any distributed system, which is ...
This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for s...
For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters ...
We show that randomization can lead to significant improvements for a few fundamental problems in di...
In both distributed counting and queuing, processors in a distributed system issue operations which ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
A distributed counter is a concurrent object which provides a test-and-incrementoperation on a share...
The importance of distributed data structures for sharing a high data access load among the processo...
this paper, we propose an efficient linearizable counter. The definition of efficiency for distribut...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
A distributed counter allows each processor in an asynchronous message passing network to access the...
AbstractThe aim of this paper is to outline a combinatorial structure appearing in distributed compu...
AbstractThe time separation results concerning classes of languages over a single-letter alphabet ac...
Toda proved a remarkable connection between the polynomial hierarchy and the counting classes. Tarui...
We present the design and implementation of a parallel algorithm for computing Gröbner bases on dist...
This paper presents a pragmatic algorithm to buil a global time on any distributed system, which is ...
This paper presents improved deterministic distributed algorithms, with O(log n)-bit messages, for s...
For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters ...
We show that randomization can lead to significant improvements for a few fundamental problems in di...
In both distributed counting and queuing, processors in a distributed system issue operations which ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
DOI
Add to ORKG