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

We consider the problem of distributed computation of the nearest latticepoint for a two dimensional lattice. An interactive two-party model ofcommunication is considered. Algorithms with bounded, as well as unbounded,number of rounds of communication are considered. For the algorithm with abounded number of rounds, expressions are derived for the error probability asa function of the total number of communicated bits. We observe that the errorexponent depends on the lattice. With an infinite number of allowedcommunication rounds, the average cost of achieving zero error probability isshown to be finite.

On the Interactive Communication Cost of the Distributed Nearest Lattice Point Problem