Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the g...
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
We define and instantiate a cryptographic scheme called “private counters”, which can be used in applications such as preferential voting to express and update preferences (or...
Saturating counters are a newly defined class of generalized parallel counters that provide the exact number of inputs which are equal to 1 only if this number is below a given t...
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...
Many workload characterization studies depend on accurate measurements of the cost of executing a piece of code. Often these measurements are conducted using infrastructures to ac...
Dmitrijs Zaparanuks, Milan Jovic, Matthias Hauswir...