English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, bal- ancing networks are accessed by tokens, and the distribution of the to- kens on the network's output specify the property of the network. How- ever, tokens represent increment operations only, and tokens alone are not adequate for synchronization problems that require decrement opera- tions. For such kinds of problems, antitokens have been used to represent decrement operations. It has been shown that several kinds of balancing networks which satisfy the step property, smoothing property ,a nd the threshold property for tokens alone, preserve their properties even when antitokens are introduced. A fundamental question that was left open was to characterize all the properties of balancing networks which are preserved under the introduction of antitokens. In this work, we provide such a simple combinatorial characterization for all the properties which are preserved when antitokens are introduced.

A Combinatorial Characterization of Properties Preserved by Antitokens